TY - JOUR
T1 - Opinion Dynamics with Topological Gossiping
T2 - Asynchronous Updates under Limited Attention
AU - Rossi, Wilbert Samuel
AU - Frasca, Paolo
N1 - Funding Information:
Manuscript received November 7, 2019; revised January 18, 2020; accepted February 7, 2020. Date of publication February 19, 2020; date of current version March 3, 2020. This work was supported in part by CNRS under PEPS S2IH “MOB” and 80 PRIME “DOOM” grants. Recommended by Senior Editor S. Tarbouriech. (Corresponding author: Wilbert Samuel Rossi.) Wilbert Samuel Rossi was with the Department of Applied Mathematics, University of Twente, 7500 AE Enschede, The Netherlands. He is now with the University College Groningen, University of Groningen, 9701BA Groningen, The Netherlands (e-mail: [email protected]).
Publisher Copyright:
© 2017 IEEE.
PY - 2020/7/1
Y1 - 2020/7/1
N2 - This letter introduces a general model of opinion dynamics with opinion-dependent connectivity. Agents update their opinions asynchronously: for the updating agent, the new opinion is the average of the k closest opinions within a subset of m agents that are sampled from the population of size n. Depending on k and m with respect to n , the dynamics can have a variety of equilibria, which include consensus and clustered configurations. The model covers as special cases a classical gossip update (if m=n ) and a deterministic update defined by the k nearest neighbors (if m=k ). We prove that the dynamics converges to consensus if n>2 ( m-k ). Before convergence, however, the dynamics can remain for long time in the vicinity of metastable clustered configurations.
AB - This letter introduces a general model of opinion dynamics with opinion-dependent connectivity. Agents update their opinions asynchronously: for the updating agent, the new opinion is the average of the k closest opinions within a subset of m agents that are sampled from the population of size n. Depending on k and m with respect to n , the dynamics can have a variety of equilibria, which include consensus and clustered configurations. The model covers as special cases a classical gossip update (if m=n ) and a deterministic update defined by the k nearest neighbors (if m=k ). We prove that the dynamics converges to consensus if n>2 ( m-k ). Before convergence, however, the dynamics can remain for long time in the vicinity of metastable clustered configurations.
KW - Agent-based systems
KW - large-scale systems
KW - network analysis and control
KW - randomized algorithm
KW - n/a OA procedure
UR - http://www.scopus.com/inward/record.url?scp=85080106533&partnerID=8YFLogxK
U2 - 10.1109/LCSYS.2020.2974822
DO - 10.1109/LCSYS.2020.2974822
M3 - Article
AN - SCOPUS:85080106533
SN - 2475-1456
VL - 4
SP - 566
EP - 571
JO - IEEE Control Systems Letters
JF - IEEE Control Systems Letters
IS - 3
M1 - 9003276
ER -