Phase transition of the 2-choices dynamics on core-periphery networks

DOI10.1007/s00446-021-00396-5OpenAlexW3165247984MaRDI QIDQ1981807

Giacomo Scornavacca, Emilio Cruciani, André Nusser, Emanuele Natale

Publication date: 6 September 2021

Published in: Distributed Computing (Search for Journal in Brave)

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

zbMATH Keywords

Markov chainsopinion dynamicscore periphery networks

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15)

Related Items

Phase Transition of a Non-linear Opinion Dynamics with Noisy Interactions ⋮ The power of small coalitions under two-tier majority on regular graphs ⋮ Phase transition of the \(k\)-majority dynamics in biased communication models ⋮ The emergence of a core-periphery structure in evolving multilayer network

Uses Software

• SNAP
• KONECT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Majority dynamics on trees and the dynamic cavity method
• Bootstrap percolation on the random graph \(G_{n,p}\)
• Convergence, unanimity and disagreement in majority dynamics on unimodular graphs and random graphs
• Bootstrap percolation on the hypercube
• Size bounds for dynamic monopolies
• Local majorities, coalitions and monopolies in graphs: A review
• Fast consensus for voting on general expander graphs
• Dynamic monopolies of constant size
• Distributed probabilistic polling and applications to proportionate agreement
• Opinion exchange dynamics
• Simple dynamics for plurality consensus
• Dynamic monopolies in two-way bootstrap percolation
• The Mathematics of Infectious Diseases
• Bootstrap percolation on the random regular graph
• Expander graphs and their applications
• Stabilizing Consensus with Many Opinions
• Efficient plurality consensus, or: The benefits of cleaning up from time to time
• The Linear Voting Model
• Discordant Voting Processes on Finite Graphs
• Bounds on the Voter Model in Dynamic Networks
• Reaching a Consensus
• Distributed Computing on Core-Periphery Networks: Axiom-Based Design
• The Power of Two Choices in Distributed Voting
• Nearly-Tight Analysis for 2-Choice and 3-Majority Consensus Dynamics
• A Polylogarithmic Gossip Algorithm for Plurality Consensus
• The Coalescing-Branching Random Walk on Expanders and the Dual Epidemic Process
• Plurality Consensus in the Gossip Model
• Core-Periphery Structure in Networks
• Concentration of Measure for the Analysis of Randomized Algorithms
• Phase Transitions of Best-of-Two and Best-of-Three on Stochastic Block Models