A model of opinion dynamics for community detection in graphs

Abstract : In this paper, we propose a new approach to the problem of community detection in graphs. It is based on a model of opinion dynamics with decaying confidence. This model is a multi-agent system where each agent receives the opinions of its neighbors and then updates its opinion by taking a weighted average of its own opinion and those of its neighbors that are within some confidence range. The confidence ranges are getting smaller at each time step: an agent gives repetitively confidence only to the neighbors that approach sufficiently fast its own opinion. Under that constraint, global consensus may not be achieved and the agents may only reach local agreement organizing themselves in communities. A characterization of these communities is given in terms of eigenvalues of normalized Laplacian matrices of graphs. This shows that our model of opinion dynamics with decaying confidence provides an appealing approach to community detection in graphs. Experimental results show that our approach is also effective.
Complete list of metadatas

Contributor : Brigitte Bidégaray-Fesquet <>
Submitted on : Wednesday, January 2, 2013 - 12:10:35 PM
Last modification on : Thursday, July 4, 2019 - 9:54:02 AM




Irinel-Constantin Morarescu, Antoine Girard. A model of opinion dynamics for community detection in graphs. NecSys'10 - 2nd IFAC Workshop on Distributed Estimation and Control in Networked Systems, Sep 2010, Annecy, France. pp.251-256, ⟨10.3182/20100913-2-FR-4014.00001⟩. ⟨hal-00769568⟩



Record views