Markov approximations of chains of infinite order
✍ Scribed by R. Fernández; A. Galves
- Publisher
- Springer
- Year
- 2002
- Tongue
- English
- Weight
- 86 KB
- Volume
- 33
- Category
- Article
- ISSN
- 1678-7714
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Let P be a positive recurrent infinite transition matrix with invariant distribution π and (n) P be a truncated and arbitrarily augmented stochastic matrix with invariant distribution (n) π. We investigate the convergence (n) ππ → 0, as n → ∞, and derive a widely applicable sufficient criterion. Mor
consider a simple and widely used method for evaluating quasi-stationary distributions of continuous time Markov chains. The infinite state space is replaced by a large, but finite approximation, which is used to evaluate a candidate distribution. We give some conditions under which the method works
Let Q be a convex solid in R", partitioned mto two volumes u and t' by an area s. We show that s > min(u, o)/diam Q, and use this inequality to obtain the lower bound n -'/' on the conductance of order Markov chains, which describe nearly uniform generators of linear extensions for posets of size n.