Coalescing random walks and voting on graphs
Authors:
Open Access
- 16 July 2012
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 47-56
Abstract
No abstract availableKeywords
All Related Versions
This publication has 15 references indexed in Scilit:
- On the coalescence time of reversible random walksTransactions of the American Mathematical Society, 2011
- Multiple Random Walks in Random Regular GraphsSIAM Journal on Discrete Mathematics, 2010
- Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness2009
- On Mixing and Edge Expansion Properties in Randomized BroadcastingAlgorithmica, 2008
- Expander graphs and their applicationsBulletin of the American Mathematical Society, 2006
- Randomized protocols for asynchronous consensusDistributed Computing, 2003
- Distributed Probabilistic Polling and Applications to Proportionate AgreementInformation and Computation, 2001
- Improved Bounds for Mixing Rates of Markov Chains and Multicommodity FlowCombinatorics, Probability and Computing, 1992
- Coalescing Random Walks and Voter Model Consensus Times on the Torus in $\mathbb{Z}^d$The Annals of Probability, 1989
- Finite particle systems and infection modelsMathematical Proceedings of the Cambridge Philosophical Society, 1983