Corpus ID: 230435693

Mapping flows on hypergraphs

@inproceedings{Eriksson2021MappingFO,
  title={Mapping flows on hypergraphs},
  author={A. Eriksson and D. Edler and A. Rojas and M. Rosvall},
  year={2021}
}
  • A. Eriksson, D. Edler, +1 author M. Rosvall
  • Published 2021
  • Physics
    • Hypergraphs offer an explicit formalism to describe multibody interactions in complex systems. To connect dynamics and function in systems with these higher-order interactions, network scientists have generalised random-walk models to hypergraphs and studied the multibody effects on flow-based centrality measures. But mapping the large-scale structure of those flows requires effective community detection methods. We derive unipartite, bipartite, and multilayer network representations of… CONTINUE READING
    View PDF on arXiv

    Figures and Tables from this paper

    Figures and Tables

    References

    SHOWING 1-10 OF 39 REFERENCES
    Maps of random walks on complex networks reveal community structure
    • 2,941
    • Highly Influential
    • PDF
    Random walks and community detection in hypergraphs
    • 1
    • PDF
    Random walks on hypergraphs
    • 13
    • PDF
    Memory in network flows and its effects on spreading dynamics and community detection.
    • 230
    • PDF
    Efficient community detection of network flows for varying Markov times and bipartite networks
    • 33
    • PDF
    A local perspective on community structure in multilayer networks
    • 38
    • PDF
    Community Structure in Time-Dependent, Multiscale, and Multiplex Networks
    • 1,428
    • PDF
    Stability of graph communities across time scales
    • 356
    • PDF
    Networks beyond pairwise interactions: structure and dynamics
    • 57
    • PDF
    Diffusion on complex networks: a way to probe their large-scale topological structures
    • 60
    • PDF