Flow-based Community Detection in Hypergraphs
arXiv:2105.04389 · doi:10.1007/978-3-030-91374-8_4
Abstract
To connect structure, dynamics and function in systems with multibody interactions, network scientists model random walks on hypergraphs and identify communities that confine the walks for a long time. The two flow-based community-detection methods Markov stability and the map equation identify such communities based on different principles and search algorithms. But how similar are the resulting communities? We explain both methods' machinery applied to hypergraphs and compare them on synthetic and real-world hypergraphs using various hyperedge-size biased random walks and time scales. We find that the map equation is more sensitive to time-scale changes and that Markov stability is more sensitive to hyperedge-size biases.
References in corpus (36)
- Fast unfolding of communities in large networks
- Finding and evaluating community structure in networks
- Community detection in graphs
- From Louvain to Leiden: guaranteeing well-connected communities
- Maps of random walks on complex networks reveal community structure
- Functional cartography of complex metabolic networks
- Multilayer Networks
- Community Structure in Time-Dependent, Multiscale, and Multiplex Networks
- Statistical Mechanics of Community Detection
- Networks beyond pairwise interactions: structure and dynamics
- Mathematical Formulation of Multi-Layer Networks
- Simplicial models of social contagion
- The physics of spreading processes in multilayer networks
- Multilevel compression of random walks on networks reveals hierarchical organization in large integrated systems
- Random Walks, Markov Processes and the Multiscale Modular Organization of Complex Networks
- Laplacian Dynamics and Multiscale Modular Structure in Networks
- Memory in network flows and its effects on spreading dynamics and community detection
- Causality-Driven Slow-Down and Speed-Up of Diffusion in Non-Markovian Temporal Networks
- Random walks on hypergraphs
- Representing higher-order dependencies in networks
- Identifying modular flows on multilayer networks reveals highly overlapping organization in social systems
- Simplicial complexes and complex systems
- Mapping higher-order network flows in memory and multilayer networks with Infomap
- Simplicial complexes: spectrum, homology and random walks
- Clustering via Hypergraph Modularity
- Inhomogeneous Hypergraph Clustering with Applications
- The stability of a graph partition: A dynamics-based framework for community detection
- Diffusion on Complex Networks : A way to probe their large scale topological structures
- Efficient community detection of network flows for varying Markov times and bipartite networks
- Community Detection for Hypergraph Networks via Regularized Tensor Power Iteration
- Mapping flows on hypergraphs
- Spectral Detection on Sparse Hypergraphs
- Random Walks on Hypergraphs with Edge-Dependent Vertex Weights
- Mapping flows on sparse networks with missing links
- Mapping Flows on Bipartite Networks
- Multilayer flows in molecular networks identify biological modules in the human proteome