A generalized voter model on complex networks
From MaRDI portal
Publication:836971
DOI10.1007/S10955-009-9757-6zbMATH Open1181.82029arXiv0804.1269OpenAlexW1994211124MaRDI QIDQ836971FDOQ836971
Authors: Casey M. Schneider-Mizell, Leonard M. Sander 
Publication date: 9 September 2009
Published in: Journal of Statistical Physics (Search for Journal in Brave)
Abstract: We study a generalization of the voter model on complex networks, focusing on the scaling of mean exit time. Previous work has defined the voter model in terms of an initially chosen node and a randomly chosen neighbor, which makes it difficult to disentangle the effects of the stochastic process itself relative to the network structure. We introduce a process with two steps, one that selects a pair of interacting nodes and one that determines the direction of interaction as a function of the degrees of the two nodes and a parameter which sets the likelihood of the higher degree node giving its state. Traditional voter model behavior can be recovered within the model. We find that on a complete bipartite network, the traditional voter model is the fastest process. On a random network with power law degree distribution, we observe two regimes. For modest values of , exit time is dominated by diffusive drift of the system state, but as the high nodes become more influential, the exit time becomes becomes dominated by frustration effects. For certain selection processes, a short intermediate regime occurs where exit occurs after exponential mixing.
Full work available at URL: https://arxiv.org/abs/0804.1269
Recommendations
- Voter model on networks partitioned into two cliques of arbitrary sizes
- Effect of network topology on the ordering dynamics of voter models
- A nonlinear \(q\)-voter model with deadlocks on the Watts-Strogatz graph
- Mean-field analysis of the \(q\)-voter model on networks
- Conservation laws for voter-like models on random directed networks
Interacting random processes; statistical mechanics type models; percolation theory (60K35) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41) Voting theory (91B12)
Cites Work
- The Structure and Function of Complex Networks
- A guide to first-passage processes
- A critical point for random graphs with a given degree sequence
- Collective dynamics of `small-world' networks
- Interacting particle systems. With a new postface.
- Finiteness and fluctuations in growing networks
- Kinetics of random sequential parking on a line
Cited In (19)
- Ordering dynamics of the multi-state voter model
- Mapping the \(q\)-voter model: from a single chain to complex networks
- Effect of network topology on the ordering dynamics of voter models
- Bounds on the Voter Model in Dynamic Networks
- A nonlinear \(q\)-voter model with deadlocks on the Watts-Strogatz graph
- Convergence to global consensus in opinion dynamics under a nonlinear voter model
- The swing voter's curse in social networks
- Stochastic dynamics of the multi-state voter model over a network based on interacting cliques and zealot candidates
- Ordering in voter models on networks: exact reduction to a single-coordinate diffusion
- Dynamical behavior of rumor spreading under a temporal random control strategy
- Voter model on networks partitioned into two cliques of arbitrary sizes
- Asymptotic behaviour of the noisy voter model density process
- Conservation laws for voter-like models on random directed networks
- Discursive voter models on the supercritical scale-free network
- Supportive interactions in the noisy voter model
- Conformity and dissonance in generalized voter models
- On the impact of zealots in a population of susceptible agents in a best-of-n problem within a heterogeneous network
- Title not available (Why is that?)
- Complex dynamics of a nonlinear voter model with contrarian agents
This page was built for publication: A generalized voter model on complex networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q836971)
