Magnetic eigenmaps for community detection in directed networks

Abstract

Communities in directed networks have often been characterized as regions with a high density of links, or as sets of nodes with certain patterns of connection. Our approach for community detection combines the optimization of a quality function and a spectral clustering of a deformation of the combinatorial Laplacian, the so-called magnetic Laplacian. The eigenfunctions of the magnetic Laplacian, that we call magnetic eigenmaps, incorporate structural information. Hence, using the magnetic eigenmaps, dense communities including directed cycles can be revealed as well as "role" communities in networks with a running flow, usually discovered thanks to mixture models. Furthermore, in the spirit of the Markov stability method, an approach for studying communities at different energy levels in the network is put forward, based on a quantum mechanical system at finite temperature.

15 pages

References in corpus (16)

• Fast unfolding of communities in large networks
• Modularity and community structure in networks
• Finding community structure in networks using the eigenvectors of matrices
• Maps of random walks on complex networks reveal community structure
• Statistical Mechanics of Community Detection
• Community structure in directed networks
• Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities
• Nonoptimal Component Placement, but Short Processing Paths, due to Long-Distance Projections in Neural Systems
• Mixture models and exploratory analysis in networks
• Random Walks, Markov Processes and the Multiscale Modular Organization of Complex Networks
• Narrow scope for resolution-limit-free community detection
• Size reduction of complex networks preserving modularity
• Neural development features: Spatio-temporal development of the Caenorhabditis elegans neuronal network
• Using Triangles to Improve Community Detection in Directed Networks
• Detecting communities of triangles in complex networks using spectral optimization
• Role-based similarity in directed networks