Threshold $q$-voter model
July 10, 2018 Β· Declared Dead Β· π Physical Review E
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Allan R. Vieira, Celia Anteneodo
arXiv ID
1807.03661
Category
physics.soc-ph
Cross-listed
cond-mat.stat-mech,
cs.SI
Citations
42
Venue
Physical Review E
Last Checked
3 months ago
Abstract
We introduce the threshold $q$-voter opinion dynamics where an agent, facing a binary choice, can change its mind when at least $q_0$ amongst $q$ neighbors share the opposite opinion. Otherwise, the agent can still change its mind with a certain probability $\varepsilon$. This threshold dynamics contemplates the possibility of persuasion by an influence group even when there is not full agreement among its members. In fact, individuals can follow their peers not only when there is unanimity ($q_0=q$) in the lobby group, as assumed in the $q$-voter model, but, depending on the circumstances, also when there is simple majority ($q_0>q/2$), Byzantine consensus ($q_0>2q/3$), or any minimal number $q_0$ amongst $q$. This realistic threshold gives place to emerging collective states and phase transitions which are not observed in the standard $q$-voter. The threshold $q_0$, together with the stochasticity introduced by $\varepsilon$, yields a phenomenology that mimics as particular cases the $q$-voter with stochastic drivings such as nonconformity and independence. In particular, nonconsensus majority states are possible, as well as mixed phases. Continuous and discontinuous phase transitions can occur, but also transitions from fluctuating phases into absorbing states.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β physics.soc-ph
π
π
The Cartographer
R.I.P.
π»
Ghosted
Networks beyond pairwise interactions: structure and dynamics
R.I.P.
π»
Ghosted
Statistical physics of human cooperation
R.I.P.
π»
Ghosted
Vital nodes identification in complex networks
R.I.P.
π»
Ghosted
Influence maximization in complex networks through optimal percolation
R.I.P.
π»
Ghosted
Scale-free networks are rare
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
π»
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
π»
Ghosted
Deep Convolutional Neural Networks for Computer-Aided Detection: CNN Architectures, Dataset Characteristics and Transfer Learning
R.I.P.
π»
Ghosted