arXiv · 2105.04389
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.
Explore related subjects
Keep this discovery
Anton Eriksson, Timoteo Carletti, Renaud Lambiotte, Alexis Rojas, Martin Rosvall. 2021-05-10. Flow-based Community Detection in Hypergraphs. https://doi.org/10.1007/978-3-030-91374-8_4
Cite the original work for its findings. Save a collection to share your selection of sources.