Discordant voting processes on finite graphs

DOI10.4230/LIPICS.ICALP.2016.145zbMATH Open1388.68219OpenAlexW2906532161MaRDI QIDQ4598288FDOQ4598288

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

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

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)

Cited In (10)

• 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
• Discordant Voting Processes on Finite Graphs
• Fast consensus for voting on general expander graphs
• The asynchronous DeGroot dynamics
• Discordant voting protocols for cyclically linked agents
• Voting protocols on the star graph
• Phase transition of the 2-choices dynamics on core-periphery networks
• Voting 'Against' in regular and nearly regular graphs

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)