Multiple random walks in rando m regular graphs

SIAM Journal on Discrete Mathematics

Volumn 23, Issue 4, 2009, Pages 1738-1761

  Cooper, Colin ^a   Frieze, Alan ^b   Radzik, Tomasz ^a  

^a KING'S COLLEGE LONDON   (United Kingdom)

^b CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Multiple walks; Random regular graphs; Random walks

Indexed keywords

COVER TIME; DETECTION TIME; EXPECTED TIME; EXTINCTION TIME; HARMONIC NUMBER; HIGH PROBABILITY; PREDATOR-PREY; RANDOM REGULAR GRAPH; RANDOM WALK; RANDOM WALK MODELS; REGULAR GRAPHS; VOTER MODELS;

ASYMPTOTIC ANALYSIS; FLOCCULATION; GRAPH THEORY; GRAPHIC METHODS; MAMMALS;

ELEMENTARY PARTICLE SOURCES;

EID: 77950850231     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/080729542     Document Type: Article

References (18)

1. D. Aldous, Some inequalities for reversible Markov chains, J. London Math. Soc. (2), 25 (1982), pp. 564-576.
2. D. Aldous and J. Fill, Reversible Markov Chains and Random Walks on Graphs, http://statwww. berkeley.edu/pub/users/aldous/RWG/book.html.
3. R. Aleliunas, R. M. Karp, R. J. Lipton, L. Lov́asz, and C. Rackoff, Random walks, universal traversal sequences, and the complexity of maze problems, in Proceedings of the 20th Annual IEEE Symposium on Foundations of Computer Science, 1979, pp. 218-223.
4. N. Alon, C. Avin, M. Kouch́y, G. Kozma, Z. Lotker, and M. Tuttle, Many random walks are faster than one, in Proceedings of the Twentieth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2008, pp. 119-128.
5. A. Broder, A. Karlin, A. Raghavan, and E. Upfal, Trading space for time in undirected s-t connectivity, in Proceedings of the ACM Symposium on Theory of Computing, 1989, pp. 543-549.
6. C. Cooper and A. Frieze, The cover time of random regular graphs, SIAM J. Discrete Math., 18 (2005), pp. 728-740. (Pubitemid 41640501)
7. C. Cooper and A. M. Frieze, The cover time of the preferential attachment graph, J. Combin. Theory Ser. B, 97 (2007), pp. 269-290.
8. C. Cooper and A. M. Frieze, The cover time of the giant component of a random graph, Random Structures Algorithms, 32 (2008), pp. 401-439.
9. C. Cooper, A. M. Frieze, and T. Radzik, Competition and predation in multiple random walks, in preparation.
10. D. Coppersmith, P. Tetali, and P. Winkler, Collisions among random walks on a graph, SIAM J. Discrete Math., 6 (1993), pp. 363-374.
11. U. Feige, A tight upper bound for the cover time of random walks on graphs, Random Structures Algorithms, 6 (1995), pp. 51-54.
12. U. Feige, A tight lower bound for the cover time of random walks on graphs, Random Structures Algorithms, 6 (1995), pp. 433-438.
13. W. Feller, An Introduction to Probability Theory, Vol.I, 2nd ed., Wiley, New York, 1960.
14. J. Friedman, A Proof of Alon's Second Eigenvalue Conjecture and Related Problems, Mem. Amer. Math. Soc. 195, Amer. Math. Soc., Providence, RI, 2008.
15. L. Lov́asz, Random walks on graphs: A survey, in Combinatorics, Paul Erdös is Eighty, Vol.2, Bolyai Society Mathematical Studies, Keszthely, Hungary, 1993, pp. 1-46.
16. A. Lubotzky, R. Phillips, and P. Sarnak, Ramanujan graphs, Combinatorica, 8 (1988), pp. 261-277.
17. A. Sinclair, Improved bounds for mixing rates of Markov chains and multicommodity flow, Combin. Probab. Comput., 1 (1992), pp. 351-370.
18. P. Tetali and P. Winkler, Simultaneous reversible Markov chains, in Combinatorics, Paul Erdös Is Eighty, Vol.1, Keszthely, Hungary, 1993, pp. 433-451.