Flow-Based Community Detection in Hypergraphs

DOI10.1007/978-3-030-91374-8_4zbMath1505.05103arXiv2105.04389OpenAlexW3163725184MaRDI QIDQ5053664

Renaud Lambiotte, Alexis Rojas, Timoteo Carletti, Martin Rosvall, Anton Eriksson

Publication date: 6 December 2022

Published in: Understanding Complex Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2105.04389

zbMATH Keywords

map equation identifyMarkov stabilityrandom walks on hypergraphs

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Sums of independent random variables; random walks (60G50) Hypergraphs (05C65) Random walks on graphs (05C81)

Uses Software

• UCI-ml
• GenLouvain

Cites Work

• Networks beyond pairwise interactions: structure and dynamics
• Complex networks: structure and dynamics
• Mapping higher-order network flows in memory and multilayer networks with Infomap
• Simplicial complexes: Spectrum, homology and random walks
• Community Structure in Time-Dependent, Multiscale, and Multiplex Networks
• Random Walks on Simplicial Complexes and the Normalized Hodge 1-Laplacian
• Structure of triadic relations in multiplex networks
• Simplicial complexes and complex systems
• Clustering of sparse data via network communities—a prototype study of a large online market
• Fast unfolding of communities in large networks