Threshold behaviour of discordant voting on the complete graph

DOI10.1016/j.jda.2018.07.001zbMath1486.68128OpenAlexW2896927236WikidataQ129096172 ScholiaQ129096172MaRDI QIDQ1632507

Nicolás Rivera, Colin Cooper

Publication date: 14 December 2018

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://kclpure.kcl.ac.uk/portal/en/publications/threshold-behaviour-of-discordant-voting-on-the-complete-graph(794be31e-a2f4-41aa-b874-0dd251072e09).html

zbMATH Keywords

random processesvoting algorithmsdistributed computing

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Processes in random environments (60K37) Coloring of graphs and hypergraphs (05C15) Distributed systems (68M14) Randomized algorithms (68W20) Random walks on graphs (05C81)

Related Items

Distributed Averaging in Opinion Dynamics

Cites Work

• Evolving voter model on dense random graphs
• Modeling complex systems with adaptive networks
• Graph fission in an evolving voter model
• Unnamed Item
• Unnamed Item