Discordant Voting Processes on Finite Graphs

DOI10.1137/16M1105979zbMath1400.68153arXiv1604.06884OpenAlexW2474211214WikidataQ61831989 ScholiaQ61831989MaRDI QIDQ4691143

Martin Dyer, Colin Cooper, Nicolás Rivera, Alan M. Frieze

Publication date: 18 October 2018

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1604.06884

zbMATH Keywords

voter modelinteracting particlesdistributed consensusdiscrete random processdiscordant voting

Mathematics Subject Classification ID

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

Related Items (1)

Voter models on subcritical scale‐free random graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sum of the reciprocals of the binomial coefficients
• Coalescing random walks and voter model consensus times on the torus in \({\mathbb{Z}}^ d\)
• Distributed probabilistic polling and applications to proportionate agreement
• Evolving voter model on dense random graphs
• Slow emergence of cooperation for win-stay lose-shift on trees
• Modeling complex systems with adaptive networks
• Multiple Random Walks in Random Regular Graphs
• Probability with Martingales
• A greedy algorithm for solving a certain class of linear programmes
• The Linear Voting Model
• Bounds on the Voter Model in Dynamic Networks
• Graph fission in an evolving voter model
• On the coalescence time of reversible random walks
• Coalescing Random Walks and Voting on Connected Graphs

This page was built for publication: Discordant Voting Processes on Finite Graphs