Exact Mixing in an Unknown Markov Chain

We give a simple stopping rule which will stop an unknown, irreducible $n$-state Markov chain at a state whose probability distribution is exactly the stationary distribution of the chain. The expected stopping time of the rule is bounded by a polynomial in the maximum mean hitting time of the chain. Our stopping rule can be made deterministic unless the chain itself has no random transitions.

[1]  L. Khachiyan,et al.  On the conductance of order Markov chains , 1991 .

[2]  Miklós Simonovits,et al.  Random Walks in a Convex Body and an Improved Volume Algorithm , 1993, Random Struct. Algorithms.

[3]  D. Aldous.  On Simulating a Markov Chain Stationary Distribution when Transition Probabilities are Unknown , 1995 .

[4]  David Applegate,et al.  Sampling and integration of near log-concave functions , 1991, STOC '91.

[5]  Béla Bollobás,et al.  Random Graphs , 1985 .

[6]  M. Karonski.  Collisions among Random Walks on a Graph , 1993 .

[7]  M. Freidlin,et al.  Random Perturbations of Dynamical Systems , 1984 .

[8]  P. Tetali.  Random walks and the effective resistance of networks , 1991 .

[9]  David Aldous,et al.  The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees , 1990, SIAM J. Discret. Math..

[10]  Andrei Z. Broder,et al.  How hard is it to marry at random? (On the approximation of the permanent) , 1986, STOC '86.

[11]  Claude Berge,et al.  Graphs and Hypergraphs , 2021, Clustering.

[12]  Mark Jerrum,et al.  Conductance and the Rapid Mixing Property for Markov Chains: the Approximation of the Permanent Resolved (Preliminary Version) , 1988, STOC 1988.

[13]  Andrei Z. Broder,et al.  Generating random spanning trees , 1989, 30th Annual Symposium on Foundations of Computer Science.

[14]  Peter G. Doyle,et al.  Random Walks and Electric Networks: REFERENCES , 1987 .

[15]  Peter W. Glynn,et al.  Stationarity detection in the initial transient problem , 1992, TOMC.