Evolving voter model on dense random graphs

DOI10.1214/16-AAP1230MaRDI QIDQ2013582zbMATHFDO

Authors Riddhipratim Basu, Allan Sly

Publication date 8 August 2017

Published in The Annals of Applied Probability (Search for Journal in Brave)

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

zbMATH Keywords

voter modelcoevolutionary networkdense Erdős-Rényi graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Random walks on graphs (05C81) Processes in random environments (60K37)

Abstract: In this paper we examine a variant of the voter model on a dynamically changing network where agents have the option of changing their friends rather than changing their opinions. We analyse, in the context of dense random graphs, two models considered in Durrett et. al.(Proc. Natl. Acad. Sci. 109: 3682-3687, 2012). When an edge with two agents holding different opinion is updated, with probability $$, one agent performs a voter model step and changes its opinion to copy the other, and with probability $$, the edge between them is broken and reconnected to a new agent chosen randomly from (i) the whole network (rewire-to-random model) or, (ii) the agents having the same opinion (rewire-to-same model). We rigorously establish in both the models, the time for this dynamics to terminate exhibits a phase transition in the model parameter $$. For $$ sufficiently small, with high probability the network rapidly splits into two disconnected communities with opposing opinions, whereas for $$ large enough the dynamics runs for longer and the density of opinion changes significantly before the process stops. In the rewire-to-random model, we show that a positive fraction of both opinions survive with high probability.

Recommendations

• Bounds on the Voter Model in Dynamic Networks
• Latent voter model on locally tree-like random graphs
• Voter model on networks partitioned into two cliques of arbitrary sizes
• Consensus of interacting particle systems on Erdős-Rényi graphs
• A voter model in random environment

Cited in

(13)

• Asymptotic behaviour of the noisy voter model density process
• Dense multigraphon-valued stochastic processes and edge-changing dynamics in the configuration model
• Bounds on the Voter Model in Dynamic Networks
• Local symmetry and global structure in adaptive voter models
• An inverse voter model for co-evolutionary networks: Stationary efficiency and phase transitions
• Voter models with heterozygosity selection
• Voting protocols on the star graph
• Phase transition of the 2-choices dynamics on core-periphery networks
• Latent voter model on locally tree-like random graphs
• Discordant Voting Processes on Finite Graphs
• Discordant voting protocols for cyclically linked agents
• Characterizing segregation in the schelling-voter model
• Threshold behaviour of discordant voting on the complete graph

This page was built for publication: Evolving voter model on dense random graphs

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