Skip to Main content Skip to Navigation
Conference papers

Asynchronous opinion dynamics on the k-nearest-neighbors graph

Wilbert Rossi 1 Paolo Frasca 2
2 NECS - Networked Controlled Systems
GIPSA-DA - Département Automatique, Inria Grenoble - Rhône-Alpes
Abstract : This paper is about a new model of opinion dynamics with opinion-dependent connectivity. We assume that agents update their opinions asynchronously and that each agent's new opinion depends on the opinions of the k agents that are closest to it. We show that the resulting dynamics is substantially different from comparable models in the literature, such as bounded-confidence models. We study the equilibria of the dynamics, observing that they are robust to perturbations caused by the introduction of new agents. We also prove that if the number of agents n is smaller than 2k, the dynamics converge to consensus. This condition is only sufficient.
Complete list of metadatas

Cited literature [19 references]  Display  Hide  Download
Contributor : Paolo Frasca <>
Submitted on : Thursday, September 20, 2018 - 10:11:14 AM
Last modification on : Wednesday, May 13, 2020 - 4:16:01 PM
Document(s) archivé(s) le : Friday, December 21, 2018 - 1:25:18 PM


Files produced by the author(s)




Wilbert Rossi, Paolo Frasca. Asynchronous opinion dynamics on the k-nearest-neighbors graph. 57th IEEE Conference on Decision and Control (CDC 2018), Dec 2018, Miami, FL, United States. pp.3648-3653, ⟨10.1109/CDC.2018.8619285⟩. ⟨hal-01877618⟩



Record views


Files downloads