Dynamical detection of network communities

M.G. Quiles, Elbert E. N. Macau, N. Rubido

Research output: Contribution to journalArticle

8 Citations (Scopus)

Abstract

A prominent feature of complex networks is the appearance of communities, also known as modular structures. Specifically, communities are groups of nodes that are densely connected among each other but connect sparsely with others. However, detecting communities in networks is so far a major challenge, in particular, when networks evolve in time. Here, we propose a change in the community detection approach. It underlies in defining an intrinsic dynamic for the nodes of the network as interacting particles (based on diffusive equations of motion and on the topological properties of the network) that results in a fast convergence of the particle system into clustered patterns. The resulting patterns correspond to the communities of the network. Since our detection of communities is constructed from a dynamical process, it is able to analyse time-varying networks straightforwardly. Moreover, for static networks, our numerical experiments show that our approach achieves similar results as the methodologies currently recognized as the most efficient ones. Also, since our approach defines an N-body problem, it allows for efficient numerical implementations using parallel computations that increase its speed performance.
Original languageEnglish
Article number25570
JournalScientific Reports
Volume6
DOIs
Publication statusPublished - 9 May 2016

Keywords

  • complex networks
  • computational science
  • nonlinear phenomena

Fingerprint Dive into the research topics of 'Dynamical detection of network communities'. Together they form a unique fingerprint.

  • Cite this