Voter models on heterogeneous networks
Top Cited Papers
- 22 April 2008
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review E
- Vol. 77 (4) , 041121
- https://doi.org/10.1103/physreve.77.041121
Abstract
We study simple interacting particle systems on heterogeneous networks, including the voter model and the invasion process. These are both two-state models in which in an update event an individual changes state to agree with a neighbor. For the voter model, an individual “imports” its state from a randomly chosen neighbor. Here the average time to reach consensus for a network of nodes with an uncorrelated degree distribution scales as , where is the moment of the degree distribution. Quick consensus thus arises on networks with broad degree distributions. We also identify the conservation law that characterizes the route by which consensus is reached. Parallel results are derived for the invasion process, in which the state of an agent is “exported” to a random neighbor. We further generalize to biased dynamics in which one state is favored. The probability for a single fitter mutant located at a node of degree to overspread the population—the fixation probability—is proportional to for the voter model and to for the invasion process.
Keywords
All Related Versions
This publication has 25 references indexed in Scilit:
- Evolutionary games on graphsPublished by Elsevier ,2007
- Voter Model on Heterogeneous GraphsPhysical Review Letters, 2005
- Conservation laws for the voter model in complex networksEurophysics Letters, 2005
- Velocity and Hierarchical Spread of Epidemic Outbreaks in Scale-Free NetworksPhysical Review Letters, 2004
- Finiteness and fluctuations in growing networksJournal of Physics A: General Physics, 2002
- Ising model on networks with an arbitrary distribution of connectionsPhysical Review E, 2002
- Epidemic Spreading in Scale-Free NetworksPhysical Review Letters, 2001
- Resilience of the Internet to Random BreakdownsPhysical Review Letters, 2000
- A critical point for random graphs with a given degree sequenceRandom Structures & Algorithms, 1995
- Kinetics of monomer-monomer surface catalytic reactionsPhysical Review A, 1992