Consensus in Complex Networks with Noisy Agents and Peer Pressure
arXiv:2306.14586 · doi:10.1016/j.physa.2022.128263
Abstract
In this paper we study a discrete time consensus model on a connected graph with monotonically increasing peer-pressure and noise perturbed outputs masking a hidden state. We assume that each agent maintains a constant hidden state and a presents a dynamic output that is perturbed by random noise drawn from a mean-zero distribution. We show consensus is ensured in the limit as time goes to infinity under certain assumptions on the increasing peer-pressure term and also show that the hidden state cannot be exactly recovered even when model dynamics and outputs are known. The exact nature of the distribution is computed for a simple two vertex graph and results found are shown to generalize (empirically) to more complex graph structures.
arXiv comment11 pages, 10 figures
References in corpus (15)
- Statistical physics of social dynamics
- Mean-field theory for scale-free random networks
- Interaction Ruling Animal Collective Behaviour Depends on Topological rather than Metric Distance: Evidence from a Field Study
- Flocks, herds, and schools: A quantitative theory of flocking
- Scale-free correlations in bird flocks
- Continuous Opinion Dynamics under Bounded Confidence: A Survey
- Statistical mechanics of money
- The Spontaneous Emergence of Conventions: An Experimental Study of Cultural Evolution
- Voter model dynamics in complex networks: Role of dimensionality, disorder and degree distribution
- Persuasion dynamics
- Opinion dynamics: rise and fall of political parties
- On the dynamics of social conflicts: looking for the Black Swan
- Flocking dynamics and mean-field limit in the Cucker-Smale-type model with topological interactions
- Obstacle and predator avoidance by a flock
- Approach to consensus in models of continuous-opinion dynamics: a study inspired by the physics of granular gases