How to Get a Perfectly Random Sample from a Generic Markov Chain and Generate a Random Spanning Tree of a Directed Graph

Journal of Algorithms

Volumn 27, Issue 2, 1998, Pages 170-217

  Propp, James Gary ^a   Wilson, David Bruce ^a  

^a NONE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000162904     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1997.0917     Document Type: Article

References (58)

1. D. Aldous, On simulating a Markov chain stationary distribution when transition probabilities are unknown, in "Discrete Probability and Algorithms" (D. Aldous, P. Diaconis, J. Spencer, and J. M. Steele, Eds.), IMA Volumes in Mathematics and its Applications, Vol. 72, pp. 1-9, Springer-Verlag, New York, 1995.
2. D. J. Aldous, A random walk construction of uniform spanning trees and uniform labelled trees, SIAM J. Discrete Math. 3(4) (1990), 450-465.
3. D. J. Aldous and J. A. Fill, "Reversible Markov Chains and Random Walks on Graphs," http://www.stat.berkeley.edu/∼aldous/book.html, in preparation.
4. R. Aleliunas, R. M. Karp, R. J. Lipton, L. Lovász, and C. Rackoff, Random walks, universal traversal sequences, and the complexity of maze problems, in "Twentieth Annual Symposium on Foundations of Computer Science," pp. 218-223, 1979.
5. S. F. Altschul and B. W. Erickson, Significance of nucleotide sequence alignments: A method for random sequence permutation that preserves dinucleotide and codon usage, Mol. Biol. Evol. 2 (1985), 526-538.
6. S. Asmussen, P. W. Glynn, and H. Thorisson, Stationary detection in the initial transient problem, ACM Trans. Model. Comput. Simulation, 2(2) (1992), 130-157.
7. R. J. Baxter, "Exactly Solved Models in Statistical Mechanics," Academic Press, London/New York, 1982.
8. L. Beckett and P. Diaconis, Spectral analysis for discrete longitudinal data, Adv. in Math. 103(1) (1994), 107-128.
9. J. J. Binney, N. J. Dowrick, A. J. Fisher, and M. E. J. Newman, "The Theory of Critical Phenomena: An Introduction to the Renormalization Group," Oxford Univ. Press, 1992.
10. B. Bollobás, "Graph Theory: An Introductory Course," Graduate Texts in Mathematics, Vol. 63, Springer-Verlag, New York, 1979.
11. A. A. Borovkov and S. G. Foss, Stochastically recursive sequences and their generalizations, Siberian Adv. Math. 2(1) (1992), 16-81, translated from PRIM.
12. A. Broder, Generating random spanning trees, in "Thirtieth Annual Symposium on Foundations of Computer Science," pp. 442-447, 1989.
13. R. Burton and R. Pemantle, Local characteristics, entropy and limit theorems for spanning trees and domino tilings via transfer-impedances, Ann. Probab. 21(3) (1993), 1329-1371.
14. C. J. Colbourn, "The Combinatorics of Network Reliability," Oxford Univ. Press, 1987.
15. C. J. Colbourn, R. P. J. Day, and L. D. Nel, Unranking and ranking spanning trees of a graph, J. Algorithms 10 (1989), 271-286.
16. C. J. Colbourn, B. M. Debroni, and W. J. Myrvold, Estimating the coefficients of the reliability polynomial, Congr. Numer. 62 (1988), 217-223.
17. C. J. Colbourn, W. J. Myrvold, and E. Neufeld, Two algorithms for unranking arborescences, J. Algorithms 20 (1996), 268-281.
18. D. Coppersmith and S. Winograd, Matrix multiplication via arithmetic progressions, J. Symbolic Comput. 9 (1990), 251-280.
19. P. Diaconis, "Group Representations in Probability and Statistics," Institute of Mathematical Statistics, Hayward, CA, 1988.
20. P. Diaconis and L. Saloff-Coste, What do we know about the Metropolis algorithm? in "Proceedings of the Twenty-Seventh Annual ACM Symposium on the Theory of Computing," pp. 112-129, 1995.
21. P. Diaconis and D. Stroock, Geometric bounds for eigenvalues of Markov chains, Ann. Appl. Probab. 1(1) (1991), 36-61.
22. M. Dyer and A. Frieze, Random walks, totally unimodular matrices, and a randomised dual simplex algorithm, Math. Programming 64 (1994), 1-16.
23. K. Eriksson, Strong convergence and the polygon property of 1-player games, Discrete Math. 153 (1996), 105-122.
24. T. Feder and M. Mihail, Balanced matroids, in "Proceedings of the Twenty-Fourth Annual ACM Symposium on the Theory of Computing," pp. 26-38, 1992.
25. S. Felsner and L. Wernisch, Markov chains for linear extensions, the two-dimensional case, in "Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms," pp. 239-247, 1997.
26. W. F. de la Vega and A. Guénoche, Construction de mots circulaires aléatoires uniformément distribués, Math. Sci. Humaines 58 (1977), 25-29.
27. J. A. Fill, 1995, personal communication.
28. J. A. Fill, An interruptible algorithm for perfect sampling via Markov chains, in "Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing," pp. 688-695, 1997.
29. W. M. Fitch, Random sequences, J. Mol. Biol. 163 (1983), 171-176.
30. C. M. Fortuin and P. W. Kasteleyn, On the random cluster model. I. Introduction and relation to other models, Physica 57(4) (1972), 536-564.
31. P. W. Glynn and P. Heidelberger, Bias properties of budget constrained simulations, Oper. Res. 38(5) (1990), 801-814.
32. D. Griffeath, "Additive and Cancellative Interacting Particle Systems," Lecture Notes in Mathematics, Vol. 724, Springer-Verlag, Berlin/New York, 1979.
33. A. Guénoche, Random spanning tree, J. Algorithms 4 (1983) 214-220, in French.
34. O. Häggström, M. N. M. van Lieshout, and J. Møller, Characterisation results and Markov chain Monte Carlo algorithms including exact simulation for some spatial point processes, Technical Report R-96-2040, Aalborg University, 1996.
35. O. Häggström and K. Nelander, Exact sampling from anti-monotone systems, 1997, preprint.
36. R. Holley and T. Liggett, Ergodic theorems for weakly interacting systems and the voter model, Ann. Probab. 3 (1975), 643-663.
37. M. Jerrum and A. Sinclair, Approximating the permanent, SIAM J. Comput. 18(6) (1989), 1149-1178.
38. D. Kandel, Y. Matias, R. Unger, and P. Winkler, Shuffling biological sequences, Discrete Appl. Math. 71 (1996), 171-185.
39. W. S. Kendall and J. Møller, Perfect Metropolis-Hastings simulation of locally stable spatial point processes, in preparation.
40. W. S. Kendall, Perfect simulation for the area-interaction point process, in "Proceedings of the Symposium on Probability Towards the Year 2000," held in 1995. (C. C. Heyde and L. Accardi, Eds.), Probability Perspective, World Scientific Press, to appear in 1998.
41. V. G. Kulkarni, Generating random combinatorial objects, J. Algorithms 11(2) (1990), 185-207.
42. G. F. Lawler, "Intersections of Random Walks," Birkhäuser, Basel, 1991.
43. T. Liggett, "Interacting Particle Systems," Springer-Verlag, New York, 1985.
44. L. Lovász and M. Simonovits, On the randomized complexity of volume and diameter, in "Thirty-Third Annual Symposium on Foundations of Computer Science," pp. 482-491, 1992.
45. L. Lovász and P. Winkler, Exact mixing in an unknown Markov chain, Electron. J. Combin. 2 (1995), paper No. R15.
46. M. Luby, D. Randall, and A. Sinclair, Markov chain algorithms for planar lattice structures (extended abstract), in "Thirty-Sixth Annual Symposium on Foundations of Computer Science," pp. 150-159, 1995.
47. M. Luby and E. Vigoda, Approximately counting up to four (extended abstract), in "Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing," pp. 682-687, 1997.
48. R. B. Lund and D. B. Wilson, Exact sampling algorithms for storage systems and networks, in preparation.
49. R. Lyons and Y. Peres, "Probability on Trees," http://php.indiana.edu/∼rdlyons/ prbtree/prbtree.html, in preparation.
50. J. Møller, A note on perfect simulation of conditionally specified models, 1997, preprint.
51. D. J. Murdoch and P. J. Green, Exact sampling from a continuous state space, 1997, preprint.
52. L. D. Nel and C. J. Colbourn, Combining Monte Carlo estimates and bounds for network reliability, Networks 20 (1990), 277-298.
53. R. Pemantle, Choosing a spanning tree for the integer lattice uniformly, Ann. Probab. 19(4) (1991), 1559-1574.
54. C. A. Phillips, 1991, personal communication.
55. J. G. Propp and D. B. Wilson, Exact sampling with coupled Markov chains and applications to statistical mechanics, Rand. Struct. Algorithms 9 (1996), 223-252.
56. A. Sinclair, "Algorithms for Random Generation and Counting: A Markov Chain Approach," Birkhäuser, Basel, 1993.
57. H. N. V. Temperley, in "Combinatorics: Proceedings of the British Combinatorial Conference 1973," pp. 202-204, London Mathematical Society Lecture Notes Series No. 13, 1974.
58. D. B. Wilson, Annotated bibliography of perfectly random sampling with Markov chains DIMACS Series in Discrete Mathematics and Theoretical Computer Science, "Microsurveys in Discrete Probability," D. Aldous and J. Propp, Eds., American Mathematical Society, 1998, to appear, http://dimacs.rutgers.edu/∼dbwilson/exact.