Opinion Dynamics With Decaying Confidence: Application to Community Detection in Graphs

Abstract

We study a class of discrete-time multi-agent systems modelling opinion dynamics with decaying confidence. We consider a network of agents where each agent has an opinion. At each time step, the agents exchange their opinion with their neighbors and update it by taking into account only the opinions that differ from their own less than some confidence bound. This confidence bound is decaying: an agent gives repetitively confidence only to its neighbors that approach sufficiently fast its opinion. Essentially, the agents try to reach an agreement with the constraint that it has to be approached no slower than a prescribed convergence rate. Under that constraint, global consensus may not be achieved and only local agreements may be reached. The agents reaching a local agreement form communities inside the network. In this paper, we analyze this opinion dynamics model: we show that communities correspond to asymptotically connected component of the network and give an algebraic characterization of communities in terms of eigenvalues of the matrix defining the collective dynamics. Finally, we apply our opinion dynamics model to address the problem of community detection in graphs. We propose a new formulation of the community detection problem based on eigenvalues of normalized Laplacian matrix of graphs and show that this problem can be solved using our opinion dynamics model. We consider three examples of networks, and compare the communities we detect with those obtained by existing algorithms based on modularity optimization. We show that our opinion dynamics model not only provides an appealing approach to community detection but that it is also effective.

Hybrid Optimization Algorithm for Community and Fraud Detection in Complex Networks for High Immunity Towards Link and Node Failures

“…The temporal dynamics plays a vital role while integrating provides a better perceptive of network behavior [1][2][3]. Basically, the community relates the grouping of nodes with a cluster connected with many edges and cluster exists with few edges [4].…”

“…The networks are becoming wider and wider since it is the period of information explosion. Thus, we required many effective community detection algorithms for analyzing the networks with millions of vertices [1][2][3][4][5][6][7][8][9][10][11][12][13][14][15].…”

Guaranteed cost control design for synchronization in networks of linear singularly perturbed systems

“…The multi-agent formalism allows treating problems coming from a wide application domain such as engineering [1], biology, sociology [2], [3], economy. Consensus and synchronization are challenging problems widely studied in the context of linear agents interacting through a directed or undirected graph with a fixed or dynamically changing topology.…”

Robustness Analysis of Network Modularity

“…Another important way of comprehending large-scale networks is modularity analysis, which has been one of academic research interest in recent years. There are several different definitions on network modularity [2], [3], [4], [5], [6]. Among these, a defining characteristic of a module is that nodes in the same module have more frequent interconnections than to the connections to the nodes in different modules.…”