Coalescing Random Walks and Voting on Connected Graphs

@article{Cooper2013CoalescingRW,
  title={Coalescing Random Walks and Voting on Connected Graphs},
  author={Colin S Cooper and Robert Els{\"a}sser and Hirotaka Ono and Tomasz Radzik},
  journal={SIAM J. Discrete Math.},
  year={2013},
  volume={27},
  pages={1748-1758}
}
In a coalescing random walk, a set of particles make independent discrete-time random walks on a graph. Whenever one or more particles meet at a vertex, they unite to form a single particle, which then continues a random walk through the graph. Let G = (V,E), be an undirected and connected graph, with n vertices and m edges. The coalescence time, C(n), is the expected time for all particles to coalesce, when initially one particle is located at each vertex. We study the problem of bounding the… CONTINUE READING
Highly Cited
This paper has 35 citations. REVIEW CITATIONS
Recent Discussions
This paper has been referenced on Twitter 2 times over the past 90 days. VIEW TWEETS
22 Citations
13 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 22 extracted citations

Similar Papers

Loading similar papers…