Modular decomposition of Markov chain: detecting hierarchical organization of pervasive communities
arXiv:1909.07066
Abstract
In network science, a group of nodes connected with each other at higher probability than with those outside the group is referred to as a community. From the perspective that individual communities are associated with functional modules constituting complex systems described by networks, discovering communities is primarily important for understanding overall functions of these systems. Much effort has been devoted to developing methods to detect communities in networks since the early days of network science. Nevertheless, the method to reveal key characteristics of communities in real-world network remains to be established. Here we formulate decomposition of a random walk spreading over the entire network into local modules as proxy for communities. This formulation will reveal the pervasive structure of communities and their hierarchical organization, which are the hallmarks of real-world networks but are out of reach of most existing methods.
arXiv comment18 pages, 3 figures
References in corpus (16)
- Fast unfolding of communities in large networks
- Community structure in social and biological networks
- Modularity and community structure in networks
- Fast algorithm for detecting community structure in networks
- Cooperative Game Theory Approaches for Network Partitioning
- Maps of random walks on complex networks reveal community structure
- Benchmark graphs for testing community detection algorithms
- Community detection algorithms: a comparative analysis
- Community Structure in Time-Dependent, Multiscale, and Multiplex Networks
- Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities
- An information-theoretic framework for resolving community structure in complex networks
- The ground truth about metadata and community detection in networks
- An efficient and principled method for detecting communities in networks
- Community detection in networks: Structural communities versus ground truth
- Encoding dynamics for multiscale community detection: Markov time sweeping for the Map equation
- Efficient community detection of network flows for varying Markov times and bipartite networks