Dependent percolation and colliding random walks

Random Structures and Algorithms

Volumn 16, Issue 1, 2000, Pages 58-84

  Winkler, Peter ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0034385769     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1098-2418(200001)16:1<58::AID-RSA5>3.0.CO;2-E     Document Type: Article

References (8)

1. D.J. Aldous and J. Fill, Reversible Markov Chains and Random Walks on Graphs (to appear). Draft on web at http://www.stat.berkeley.edu/users/aldous/book.html.
2. P.N. Balister, B. Bollobás, and A.N. Stacey, Dependent percolation in two dimensions, draft (1999).
3. D. Coppersmith, P. Tetali and P. Winkler, Collisions among random walks on a graph, SIAM J Disc Math 6 No. 3 (1993), 363-374.
4. P.G. Doyle and J.L. Snell, Random walks and electric networks, Mathematical Assoc. of America, Washington, DC, 1984.
5. P. Gács, Prescient scheduling (work in progress), preprint (1999).
6. G. Grimmett, Percolation, Springer-Verlag, Heidelberg, 1989.
7. J.M. Howie, Fundamentals of semigroup theory, London Math. Soc. Monograph (New Series) #12, Clarendon Press, Oxford, 1995.
8. P. Tetali, An extension of Foster's network theorem, Comb Prob & Comput 3 (1994), 421-427.