Limiting behavior for a general class of voter models with confidence threshold
From MaRDI portal
Publication:2964178
Abstract: This article is concerned with a general class of stochastic spatial models for the dynamics of opinions. Like in the voter model, individuals are located on the vertex set of a connected graph and update their opinion at a constant rate based on the opinion of their neighbors. However, unlike in the voter model, the set of opinions is represented by the set of vertices of another connected graph that we call the opinion graph: when an individual interacts with a neighbor, she imitates this neighbor if and only if the distance between their opinions, defined as the graph distance induced by the opinion graph, does not exceed a certain confidence threshold. When the confidence threshold is at least equal to the radius of the opinion graph, we prove that the one-dimensional process fluctuates and clusters and give a universal lower bound for the probability of consensus of the process on finite connected graphs. We also establish a general sufficient condition for fixation of the infinite system based on the structure of the opinion graph, which we then significantly improve for opinion graphs which are distance-regular. Our general results are used to understand the dynamics of the system for various examples of opinion graphs: paths and stars, which are not distance-regular, and cycles, hypercubes and the five Platonic solids, which are distance-regular.
Recommendations
- Opinion dynamics with confidence threshold: an alternative to the Axelrod model
- Probability of consensus in spatial opinion models with confidence threshold
- Fixation results for threshold voter systems
- The bounded confidence model of opinion dynamics
- The critical value of the Deffuant model equals one half
Cites work
- A model for spatial conflict
- Clustering and coexistence in the one-dimensional vectorial Deffuant model
- Consensus in the two-state Axelrod model
- Constrained opinion dynamics: freezing and slow evolution
- Ergodic theorems for weakly interacting infinite systems and the voter model
- Explicit sufficient invariants for an interacting particle system
- Fixation in the one-dimensional Axelrod model
- Fixation results for the two-feature Axelrod model with a variable number of opinions
- Flux and fixation in cyclic particle systems
- Nearest-neighbor Markov interaction processes on multidimensional lattices
- Probability Inequalities for Sums of Bounded Random Variables
- Site recurrence for annihilating random walks on Z^ n.
- The Axelrod model for the dissemination of culture revisited
Cited in
(13)- Stochastic spatial model for the division of labor in social insects
- Consensus in the Hegselmann-Krause model
- Limit behavior of the exponential voter model
- Latent voter model on locally tree-like random graphs
- Cutoff for the noisy voter model
- Clustering in the three and four color cyclic particle systems in one dimension
- Fixation results for threshold voter systems
- Consensus and voting on large graphs: an application of graph limit theory
- Fluid limit of threshold voter models on tori
- Probability of consensus in the multivariate Deffuant model on finite connected graphs
- Opinion dynamics with confidence threshold: an alternative to the Axelrod model
- Probability of consensus in spatial opinion models with confidence threshold
- Stochastic dynamics on hypergraphs and the spatial majority rule model
This page was built for publication: Limiting behavior for a general class of voter models with confidence threshold
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2964178)
