Transition matrices for well-conditioned Markov chains

被引:9
作者
Kirkland, S. J.
Neumann, Michael [1 ]
Xu, Jianhong
机构
[1] Univ Connecticut, Dept Math, Storrs, CT 06269 USA
[2] Univ Regina, Dept Math & Stat, Regina, SK S4S 0A2, Canada
[3] So Illinois Univ, Dept Math, Carbondale, IL 62901 USA
关键词
Markov chain; stationary distribution; stochastic matrix; doubly stochastic matrix; group inverse; condition number;
D O I
10.1016/j.laa.2006.06.003
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Let T is an element of R-n x n bean irreducible stochastic matrix with stationary distribution vector pi. Set A = 1 - T, and define the quantity kappa(3)(T) = 1/2 max(j=1......n) pi(j)parallel to A(j)(-1)parallel to(infinity), where A(j), j = 1,...,n, are the (n - 1) x (n - 1) principal submatrices of A obtained by deleting the jth row and column of A. Results of Cho and Meyer, and of Kirkland show that kappa(3) provides a sensitive measure of the conditioning of 7 under perturbation of T. Moreover, it is known that kappa(3) (T) >= n-1/2n. In this paper, we investigate the class of irreducible stochastic matrices T of order it such that K3 (T) n-1/2n, for such matrices correspond to Markov chains with desirable conditioning properties. We identify some restrictions on the zero-nonzero patterns of such matrices, and construct several infinite classes of matrices for which kappa(3) is as small as possible. (C) 2006 Elsevier Inc. All rights reserved.
引用
收藏
页码:118 / 131
页数:14
相关论文
共 50 条
[31]   Maximum Entropy Estimation of Transition Probabilities of Reversible Markov Chains [J].
Van der Straeten, Erik .
ENTROPY, 2009, 11 (04) :867-887
[32]   ON COMPLETENESS OF RANDOM TRANSITION COUNTS FOR MARKOV CHAINS. II [J].
Palma, Agnieszka .
PROBABILITY AND MATHEMATICAL STATISTICS-POLAND, 2012, 32 (02) :203-214
[33]   When transition count for a Markov chains is a complete sufficient statistic [J].
Paszkiewicz, A .
STATISTICS & PROBABILITY LETTERS, 2006, 76 (08) :757-763
[34]   Adaptive Social Learning for Tracking Rare Transition Markov Chains [J].
Khammassi, Malek ;
Bordignon, Virginia ;
Matta, Vincenzo ;
Sayed, Ali H. .
32ND EUROPEAN SIGNAL PROCESSING CONFERENCE, EUSIPCO 2024, 2024, :1032-1036
[35]   Determinants of transition in artificially discrete Markov chains using microdata [J].
Vassilopoulos, Achilleas ;
Klonaris, Stathis .
ECONOMICS LETTERS, 2016, 146 :17-20
[36]   The computation of key properties of Markov chains via perturbations [J].
Hunter, Jeffrey J. .
LINEAR ALGEBRA AND ITS APPLICATIONS, 2016, 511 :176-202
[37]   SENSITIVITY OF FINITE MARKOV-CHAINS UNDER PERTURBATION [J].
SENETA, E .
STATISTICS & PROBABILITY LETTERS, 1993, 17 (02) :163-168
[38]   Convergence rates for reversible Markov chains without the assumption of nonnegative definite matrices [J].
Yong-Hua Mao .
Science China Mathematics, 2010, 53 :1979-1988
[39]   Convergence rates for reversible Markov chains without the assumption of nonnegative definite matrices [J].
Mao Yong-Hua .
SCIENCE CHINA-MATHEMATICS, 2010, 53 (08) :1979-1988
[40]   Convergence rates for reversible Markov chains without the assumption of nonnegative definite matrices [J].
MAO YongHua School of Mathematical SciencesBeijing Normal UniversityLaboratory of Mathematics and Complex SystemsMinistry of EducationBeijing China .
Science China(Mathematics), 2010, 53 (08) :1979-1988