Fast consensus for voting on general expander graphs

DOI10.1007/978-3-662-48653-5_17zbMath1394.68032OpenAlexW2237112965MaRDI QIDQ1664139

Colin Cooper, Takeharu Shiraga, Robert Elsässer, Nicolás Rivera, Tomasz Radzik

Publication date: 24 August 2018

Full work available at URL: https://doi.org/10.1007/978-3-662-48653-5_17

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14)

Related Items

Phase transitions of Best‐of‐two and Best‐of‐three on stochastic block models, On Coalescence Time in Graphs: When Is Coalescing as Fast as Meeting?, Phase transition of the \(k\)-majority dynamics in biased communication models, Unnamed Item, Fast Convergence of k-Opinion Undecided State Dynamics in the Population Protocol Model, The Maximum Label Propagation Algorithm on Sparse Random Graphs, Phase transition of the 2-choices dynamics on core-periphery networks, Minimizing message size in stochastic communication patterns: fast self-stabilizing protocols with 3 bits, Majority dynamics and the median process: connections, convergence and some new conjectures