Coalescing random walks and voting on connected graphs

SIAM Journal on Discrete Mathematics

Volumn 27, Issue 4, 2013, Pages 1748-1758

  Cooper, Colin ^a   Elsässer, Robert ^b   Ono, Hirotaka ^c   Radzik, Tomasz ^a  

^a KING'S COLLEGE LONDON   (United Kingdom)

^b UNIVERSITY OF SALZBURG   (Austria)

^c KYUSHU UNIVERSITY   (Japan)

Author keywords

Coalescing random walks; Random walks; Voter model

Indexed keywords

BIPARTITE GRAPHS; COALESCENCE TIME; DISCRETE-TIME RANDOM WALK; RANDOM WALK; SINGLE PARTICLE; SKEWED DEGREE DISTRIBUTION; TRANSITION MATRICES; VOTER MODELS;

COALESCENCE; EIGENVALUES AND EIGENFUNCTIONS; ELEMENTARY PARTICLE SOURCES; FLOCCULATION; MATHEMATICAL MODELS; RANDOM PROCESSES;

GRAPH THEORY;

EID: 84891292678     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/120900368     Document Type: Article

References (12)

1. D. Aldous, Meeting times for independent Markov chains, Stochastic Process. Appl., 38 (1991), pp. 185-193.
2. D. Aldous and J. Fill, Reversible Markov Chains and Random Walks on Graphs, http:// stat-www.berkeley.edu/pub/users/aldous/RWG/book.html.
3. C. Cooper, A. M. Frieze, and T. Radzik, Multiple Random Walks in Random Regular Graphs, SIAM J. Discrete Math., 23 (2009), pp. 1738-1761.
4. C. Cooper, R. Elsasser, H. Ono, and T. Radzik, Coalescing random walks and voting on graphs, in Proceedings of the 31st ACM Symposium on Principles of Distributed Computing, 2012, pp. 47-56.
5. J. T. Cox, Coalescing random walks and voter model consensus times on the torus in Zd, Ann. Probab., 17 (1989), pp. 1333-1366.
6. C. Gkantsidis, M. Mihail, and A. Saberi, Conductance and congestion in power law graphs, in Proceedings of ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, 2003, pp. 148-159.
7. Y. Hassin and D. Peleg, Distributed probabilistic polling and applications to proportionate agreement, Inform. and Comput., 171 (2001), pp. 248-268.
8. A. Israeli and M. Jalfon, Token management schemes and random walks yeild self stabilizing mutual exclusion, in Proceedings of the 9th Annual ACM Symposium on Principles of Distributed Computing (PODC), 1990, pp. 119-131.
9. D. Levin, Y. Peres, and E. Wilmer, Markov Chains and Mixing Times, AMS, Providence, RI, 2009.
10. L. Lovasz, Random walks on graphs: A survey, in Combinatorics, Paul Erdos is Eighty, vol. 2, Bolyai Society Mathematical Studies, Keszthely, Hungary, 1993, pp. 1-46.
11. R. Oliveira, On the coalescence time of reversible random walks, Trans. Amer. Math. Soc., 364 (2012), pp. 2109-2128.
12. A. Sinclair, Improved bounds for mixing rates of Markov chains and multicommodity flow, Combin., Probab. Comput., 1 (1992), pp. 351-370.