Disjoint decomposition of Markov chains and sampling circuits in cayley graphs

Combinatorics Probability and Computing

Volumn 15, Issue 3, 2006, Pages 411-448

  Martin, Russell ^a   Randall, Dana ^b  

^a UNIVERSITY OF LIVERPOOL   (United Kingdom)

^b Georgia Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; NUMERICAL ANALYSIS; PROBABILITY; SAMPLING; STATE SPACE METHODS; THEOREM PROVING;

CAYLEY GRAPHS; DECOMPOSITION THEOREM; ERGODIC FLOW; SAMPLING CIRCUITS; STATISTICAL PHYSICS;

MARKOV PROCESSES;

EID: 33645697622     PISSN: 09635483     EISSN: 14692163     Source Type: Journal    
DOI: 10.1017/S0963548305007352     Document Type: Article

References (18)

1. Bubley, R. and Dyer, M. (1999) Faster random generation of linear extensions. Discrete Math. 201 81-88.
2. Bubley, R. and Dyer, M. (1997) Path coupling: A technique for proving rapid mixing in Markov chains. In Proc. 38th Annual IEEE Symposium on Foundations of Computer Science (FOCS 1997), pp. 223-231.
3. Diaconis, P. and Saloff-Coste, L. (1993) Comparison theorems for reversible Markov chains.Ann. Appl. Probab. 3 696-730.
4. Dyer, M. and Greenhill, C. (1998) A more rapidly mixing Markov chain for graph colorings.Random Struct. Alg. 13 285-317.
5. Jerrum, M. R. and Sinclair, A. J. (1989) Approximate counting, uniform generation and rapidly mixing Markov chains. Inform. Comput. 82 93-133.
6. Jerrum, M. and Son, J.-B. (2002) Spectral gap and log-Sobolev constant for balanced matroids.In Proc. 43rd IEEE Symposium on Foundations of Computer Science (FOCS 2002), pp. 721-729.
7. Jerrum, M., Son, J.-B., Tetali, P. and Vigoda, E. (2004) Elementary bounds on Poincaré and log-Sobolev constants for decomposable Markov chains. Isaac Newton Institute preprint NI03006-CMP, available at http://www.newton.cam.ac.uk/preprints/NI03006.pdf. Ann. Appl. Probab. 14 1741-1765.
8. Luby, M., Randall, D. and Sinclair, A. J. (2001) Markov chain algorithms for planar lattice structures. SIAM J. Comput. 31 167-192.
9. Madras, N. and Randall, D. (1996) Factoring graphs to bound mixing rates. In Proc. 37th Annual IEEE Symposium on Foundations of Computer Science (FOCS 1996), pp. 194-203.
10. Madras, N. and Randall, D. (2002) Markov chain decomposition for convergence rate analysis.Ann. Appl. Probab. 12 581-606.
11. Martin, R. and Randall, D. (2000) Sampling adsorbing staircase walks using a new Markov chain decomposition method. In Proc. 41st Annual IEEE Symposium on Foundations of Computer Science (FOCS 2000), pp. 492-502.
12. McShine, L. and Tetali, P. (1999) On the mixing time of the triangulation walk and other Catalan structures. Randomization methods in algorithm design, DIMACS Series on Discrete Mathematics and Theoretical Computer Science 43 147-160.
13. Randall, D. and Tetali, P. (2000) Analyzing Glauber dynamics by comparison of Markov chains. J. Math. Phys. 41 1598-1615.
14. van Rensburg, B. (1999) Adsorbing staircase walks and staircase polygons. Ann. Combinatorics 3 451-473.
15. van Rensburg, E. J. J. (1998) Collapsing and adsorbing polygons. J. Phys. A: Mathematical and General 31 8295-8306.
16. Sinclair, A. J. (1993) Algorithms for Random Generation and Counting: A Markov Chain Approach, Birkhäuser, Boston.
17. Stanley, R. (1999) Enumerative Combinatorics, Vol. II, Cambridge University Press.
18. Wilson, D. B. (2004) Mixing times of lozenge tiling and card shuffling Markov chains. Ann.Appl Probab. 14 274-325.