TY - JOUR

T1 - Limiting behavior for a general class of voter models with confidence threshold

AU - Lanchier, Nicolas

AU - Scarlatos, Stylianos

N1 - Funding Information:
The authors would like to thank an anonymous referee whose comments help improve the presentation of the results. Nicolas Lanchier was sup- ported in part by NSF Grant DMS-10-05282 and NSA Grant MPS-14-040958, and Stylianos Scarlatos by an IKY Fellowship of Excellence for Postgraduate Studies in Greece - Siemens Program 2014-2015.

PY - 2016

Y1 - 2016

N2 - This article is concerned with a general class of stochastic spatial models for the dynamics of opinions. Like in the one-dimensional voter model, individuals are located on the integers 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 a finite 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. Our first result shows that, when the confidence threshold is at least equal to the radius of the opinion graph, the process fluctuates and clusters. We also establish a general sufficient condition for fixation of the process 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.

AB - This article is concerned with a general class of stochastic spatial models for the dynamics of opinions. Like in the one-dimensional voter model, individuals are located on the integers 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 a finite 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. Our first result shows that, when the confidence threshold is at least equal to the radius of the opinion graph, the process fluctuates and clusters. We also establish a general sufficient condition for fixation of the process 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.

KW - Annihilating random walks

KW - Confidence threshold

KW - Distance-regular graphs

KW - Fixation

KW - Fluctuation

KW - Interacting particle systems

KW - Opinion dynamics

KW - Voter model

UR - http://www.scopus.com/inward/record.url?scp=85011878865&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85011878865&partnerID=8YFLogxK

U2 - 10.30757/alea.v14-05

DO - 10.30757/alea.v14-05

M3 - Article

AN - SCOPUS:85011878865

SN - 1980-0436

VL - 14

SP - 63

EP - 92

JO - Alea

JF - Alea

IS - 1

ER -