Coalescing random walks and voting on graphs

DOI10.1145/2332432.2332440zbMath1301.68201OpenAlexW1997918610MaRDI QIDQ2933775

Colin Cooper, Hirotaka Ono, Tomasz Radzik, Robert Elsässer

Publication date: 5 December 2014

Published in: Proceedings of the 2012 ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2332432.2332440

zbMATH Keywords

random walksdistributed voting

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Voting theory (91B12) Distributed systems (68M14) Random walks on graphs (05C81)

Related Items (7)

Coalescence and meeting times on \(n\)-block Markov chains ⋮ Interacting particle systems as stochastic social dynamics ⋮ Biased opinion dynamics: when the devil is in the details ⋮ Fast Convergence of k-Opinion Undecided State Dynamics in the Population Protocol Model ⋮ Distributed Averaging in Opinion Dynamics ⋮ Brief Announcement: Discrete Incremental Voting ⋮ A Fast Algorithm to Find All High-Degree Vertices in Graphs with a Power-Law Degree Sequence

This page was built for publication: Coalescing random walks and voting on graphs