Paper Info
Title
On the Convergence Properties of Social Hegselmann–Krause Dynamics
Abstract
We study the convergence properties of <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">social Hegselmann–Krause (HK) dynamics</i> , a variant of the HK model of opinion dynamics where a physical connectivity graph that accounts for the extrinsic factors that could prevent interaction between certain pairs of agents is incorporated. As opposed to the original HK dynamics (which terminates in finite time), we show that for any underlying connected and incomplete graph, under a certain mild assumption, the expected termination time of social HK dynamics is infinity. We then investigate the rate of convergence to the steady state, and provide bounds on the maximum <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$\epsilon$</tex-math></inline-formula> -convergence time in terms of the properties of the physical connectivity graph. We extend this discussion and observe that for almost all <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$n$</tex-math></inline-formula> , there exists an <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$n$</tex-math></inline-formula> -vertex physical connectivity graph on which social HK dynamics may not even <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$\epsilon$</tex-math></inline-formula> -converge to the steady state within a bounded time frame. We then provide nearly tight necessary and sufficient conditions for arbitrarily slow merging (a phenomenon that is essential for arbitrarily slow <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$\epsilon$</tex-math></inline-formula> -convergence to the steady state). Using the necessary conditions, we show that complete <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$r$</tex-math></inline-formula> -partite graphs have bounded <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$\epsilon$</tex-math></inline-formula> -convergence times.
Year
DOI
Venue
2022
10.1109/TAC.2021.3052748
IEEE Transactions on Automatic Control
Keywords
DocType
Volume
Multiagent systems,networked control systems,network theory (graphs),nonlinear systems
Journal
67
Issue
ISSN
Citations 
2
0018-9286
0
PageRank 
References 
Authors
0.34
8
3
Name
Order
Citations
PageRank
Parasnis Rohit100.34
Massimo Franceschetti22200167.33
Behrouz Touri317621.12