vix.ing · top · new · best · stats · spec

Increasing Peer Pressure on any Connected Graph Leads to Consensus

2017/02/25 by Justin Semonsen, Christopher Griffin, Semonsen, Justin +5
Physics and Astronomy · #Complex Network Analysis Techniques #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Physical sciences #Opinion Dynamics and Social Influence #Physics and Society (physics.soc-ph) #Quantum many-body systems #Social and Information Networks (cs.SI)

paper · pdf · doi:10.48550/arxiv.1702.07912

openalex publication_date 2017/02/25 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In this paper, we study a model of opinion dynamics in a social network in the presence increasing interpersonal influence, i.e., increasing peer pressure. Each agent in the social network has a distinct social stress function given by a weighted sum of internal and external behavioral pressures. We assume a weighted average update rule and prove conditions under which a connected group of agents converge to a fixed opinion distribution, and under which conditions the group reaches consensus. We show that the update rule is a gradient descent and explain its transient and asymptotic convergence properties. Through simulation, we study the rate of convergence on a scale-free network and then validate the assumption of increasing peer pressure in a simple empirical model.

Related