Flow-based Community Detection in Hypergraphs

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 (14)

• Fast unfolding of communities in large networks
• Maps of random walks on complex networks reveal community structure
• Statistical Mechanics of Community Detection
• Networks beyond pairwise interactions: structure and dynamics
• 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
• Random walks on hypergraphs
• Identifying modular flows on multilayer networks reveals highly overlapping organization in social systems
• Mapping higher-order network flows in memory and multilayer networks with Infomap
• Inhomogeneous Hypergraph Clustering with Applications
• Mapping flows on hypergraphs
• Random Walks on Hypergraphs with Edge-Dependent Vertex Weights
• Mapping Flows on Bipartite Networks
• Multilayer flows in molecular networks identify biological modules in the human proteome