Information dynamics algorithm for detecting communities in networks

DOI10.1016/J.CNSNS.2012.03.023zbMATH Open1247.91158OpenAlexW1977740385MaRDI QIDQ450463FDOQ450463

Authors: Emanuele Massaro, Franco Bagnoli, Andrea Guazzini, Pietro Lio 

Publication date: 13 September 2012

Published in: Communications in Nonlinear Science and Numerical Simulation (Search for Journal in Brave)

Abstract: The problem of community detection is relevant in many scientific disciplines, from social science to statistical physics. Given the impact of community detection in many areas, such as psychology and social sciences, we have addressed the issue of modifying existing well performing algorithms by incorporating elements of the domain application fields, i.e. domain-inspired. We have focused on a psychology and social network - inspired approach which may be useful for further strengthening the link between social network studies and mathematics of community detection. Here we introduce a community-detection algorithm derived from the van Dongen's Markov Cluster algorithm (MCL) method by considering networks' nodes as agents capable to take decisions. In this framework we have introduced a memory factor to mimic a typical human behavior such as the oblivion effect. The method is based on information diffusion and it includes a non-linear processing phase. We test our method on two classical community benchmark and on computer generated networks with known community structure. Our approach has three important features: the capacity of detecting overlapping communities, the capability of identifying communities from an individual point of view and the fine tuning the community detectability with respect to prior knowledge of the data. Finally we discuss how to use a Shannon entropy measure for parameter estimation in complex networks.

Full work available at URL: https://arxiv.org/abs/1112.1224

Recommendations

• Algorithms and Models for the Web-Graph
• A linear community detection algorithm based on dynamical system in networks
• Detecting network communities: a new systematic and efficient algorithm
• scientific article; zbMATH DE number 6907813
• A community detection algorithm for dynamic networks using link clustering

zbMATH Keywords

clusteringcommunity detectioncomplex social networksinformation dynamicssocial computing

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82)

Cites Work

• Mathematical biology. Vol. 1: An introduction.
• Title not available (Why is that?)
• On Finding Graph Clusterings with Maximum Modularity
• Graph Clustering Via a Discrete Uncoupling Process

Cited In (3)

• Mapping higher-order network flows in memory and multilayer networks with Infomap
• Dynamics of non-stationary nonlinear processes that follow the maximum of differential entropy principle
• Particle competition for complex network community detection

This page was built for publication: Information dynamics algorithm for detecting communities in networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q450463)