On a decomposition for infinite transition matrices

CSpace

	On a decomposition for infinite transition matrices
	Zhao, YQQ ; Li, W ; Braun, WJ
	1997
发表期刊	QUEUEING SYSTEMS
ISSN	0257-0130
卷号	27 期号:1-2 页码:127-130
摘要	Keyman gives an interesting factorization of I-P, where P is the transition probability matrix for an ergodic Markov chain. We show that this factorization is valid if and only if the Markov chain is recurrent. Moreover, we provide a decomposition result which includes all ergodic, null recurrent as well as the transient Markov chains as special cases. Such a decomposition has been shown to be useful in the analysis of queues.
关键词	stochastic and substochastic matrices Markov chains decomposition and factorization
语种	英语
WOS研究方向	Computer Science ; Operations Research & Management Science
WOS类目	Computer Science, Interdisciplinary Applications ; Operations Research & Management Science
WOS记录号	WOS:000071818500007
出版者	BALTZER SCI PUBL BV
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/13227
专题	中国科学院数学与系统科学研究院
通讯作者	Zhao, YQQ
作者单位	1.Univ Winnipeg, Dept Math & Stat, Winnipeg, MB R3B 2E9, Canada 2.Chinese Acad Sci, Inst Appl Math, Beijing, Peoples R China
推荐引用方式 GB/T 7714	Zhao, YQQ,Li, W,Braun, WJ. On a decomposition for infinite transition matrices[J]. QUEUEING SYSTEMS,1997,27(1-2):127-130.
APA	Zhao, YQQ,Li, W,&Braun, WJ.(1997).On a decomposition for infinite transition matrices.QUEUEING SYSTEMS,27(1-2),127-130.
MLA	Zhao, YQQ,et al."On a decomposition for infinite transition matrices".QUEUEING SYSTEMS 27.1-2(1997):127-130.