Discordant voting processes on finite graphs

DOI10.4230/LIPICS.ICALP.2016.145MaRDI QIDQ4598288zbMATH OpenOpenAlexFDO

Authors Colin Cooper, Martin Dyer, Nicolás Rivera, Alan Frieze

Publication date 19 December 2017

Full work available at URL https://doi.org/10.4230/lipics.icalp.2016.145

zbMATH Keywords

randomized algorithmvoter modelinteracting particlesdistributed consensus

Mathematics Subject Classification ID

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

Recommendations

• Discordant Voting Processes on Finite Graphs
• Threshold behaviour of discordant voting on the complete graph
• Fast plurality consensus in regular expanders
• Discordant voting protocols for cyclically linked agents
• Fast consensus for voting on general expander graphs

Cited in

(10)

• Voting 'Against' in regular and nearly regular graphs
• Discordant edges for the voter model on regular random graphs
• Threshold behaviour of discordant voting on the complete graph
• Reaching consensus on a connected graph
• Fast consensus for voting on general expander graphs
• Discordant Voting Processes on Finite Graphs
• The asynchronous DeGroot dynamics
• Discordant voting protocols for cyclically linked agents
• Phase transition of the 2-choices dynamics on core-periphery networks
• Voting protocols on the star graph

This page was built for publication: Discordant voting processes on finite graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4598288)