Generating a random sink-free orientation in quadratic time

Electronic Journal of Combinatorics

Volumn 9, Issue 1 R, 2002, Pages 1-13

  Cohn, Henry ^a   Pemantle, Robin ^b   Propp, James ^c  

^a MICROSOFT RESEARCH   (United States)

^b OHIO STATE UNIVERSITY   (United States)

^c UNIVERSITY OF WISCONSIN MADISON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 4043166890     PISSN: 10778926     EISSN: None     Source Type: Journal    
DOI: 10.37236/1627     Document Type: Article

References (14)

1. [A] D. Aldous, A random walk construction of uniform spanning trees and uniform labelled trees, SIAM Journal of Discrete Mathematics 3 (4) (1990), 450-465.
2. [BLPS] I. Benjamini, R. Lyons, Y. Peres, and O. Schramm, Uniform spanning forests, Ann. Probab. 29 (2001), no. 1, 1-65.
3. [B] A. Broder, Generating random spanning trees, Proceedings of 30th Annual Sym-posium on Foundations of Computer Science (Research Triangle Park, NC, 1989), 442-447, IEEE, 1989.
4. [BD] R. Bubley and M. Dyer, Graph orientations with no sink and an approximation for a hard case of #SAT, Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (New Orleans, LA, 1997), 248-257, ACM, New York, 1997.
5. [CEP] H. Cohn, N. Elkies, and J. Propp, Local statistics for random domino tilings of the Aztec diamond, Duke Math. J. 85 (1996), no. 1, 117-166, arXiv:math.CO/0008243.
6. [E] K. Eriksson, Strong convergence and the polygon property of 1-player games, Discrete Math. 153 (1996), no. 1{3, 105-122.
7. [F] W. Feller, An introduction to probability theory and its applications, Volume I, third edition, John Wiley & Sons, Inc., New York, 1968.
8. [FH] J. Fill and M. Huber, The randomness recycler: a new technique for perfect sampling, Proceedings of the Forty-first Annual Symposium on Foundations of Computer Science (Redondo Beach, CA, 2000), 503-511, IEEE, 2000.
9. [H] M. Huber, Exact sampling and approximate counting techniques, Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing (Dallas, TX, 1998), 31-40, ACM, New York, 1998.
10. [JS] M. Jerrum and A. Sinclair, Approximate counting, uniform generation and rapidly mixing Markov chains, Inform. and Comput. 82 (1989), no. 1, 93-133.
11. [P] R. Pemantle, Choosing a spanning tree for the integer lattice uniformly, Ann. Probab. 19 (1991), no. 4, 1559-1574.
12. [PW1] J. Propp and D. Wilson, Exact sampling with coupled Markov chains and applications to statistical mechanics, Random Structures and Algorithms 9 (1996), no. 1-2, 223-252.
13. [PW2] J. Propp and D. Wilson, 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 27 (1998), 170-217.
14. [W] D. Wilson, Generating random spanning trees more quickly than the cover time, Proceedings of the Twenty-eighth Annual ACM Symposium on the Theory of Computing (Philadelphia, PA, 1996), 296-303, ACM, New York, 1996.