๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Equivalent mixing conditions for Markov chains

โœ Scribed by Richard C. Bradley

Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
161 KB
Volume
41
Category
Article
ISSN
0167-7152

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A semidefinite bound for mixing rates of
A semidefinite bound for mixing rates of Markov chains
โœ Nabil Kahale ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 214 KB ๐Ÿ‘ 2 views

We study general geometric techniques for bounding the spectral gap of a reversible Markov chain. We show that the best bound obtainable using these techniques can be computed in polynomial time via semidefinite programming, and is off by at most a factor of order log 2 n, where n is the number of s

Digraph-based conditioning for Markov ch
Digraph-based conditioning for Markov chains
โœ S. Kirkland ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 217 KB

For an irreducible stochastic matrix T , we consider a certain condition number c(T ), which measures the stability of the corresponding stationary distribution when T is perturbed. We characterize the strongly connected directed graphs D such that c(T ) is bounded as T ranges over S D , the set of

Improved bounds for a condition number f
Improved bounds for a condition number for Markov chains
โœ M. Neumann; J. Xu ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 246 KB

Let P be the transition matrix for an n-state, homogeneous, ergodic Markov chain. Set Q = I -P and let Q # = [q # i,j ] be the group (generalized) inverse of Q. A well-known condition number, due to Funderlic and Meyer, which is used in the error analysis for the computation of the stationary distri