Mapping higher-order network flows in memory and multilayer networks with Infomap

DOI10.3390/a10040112zbMath1462.90027arXiv1706.04792OpenAlexW2626759838WikidataQ57270514 ScholiaQ57270514MaRDI QIDQ2633170

Ludvig Bohlin, Daniel Edler, Martin Rosvall

Publication date: 8 May 2019

Published in: Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

community detectionmultilayer networksoverlapping communitiesmemory networkshigher-order network flowsInfomap

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Social networks; opinion dynamics (91D30) Applications of graph theory (05C90) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Deterministic network models in operations research (90B10)

Related Items (3)

Flow-Based Community Detection in Hypergraphs ⋮ The Why, How, and When of Representations for Complex Systems ⋮ The minimum description length principle for pattern mining: a survey

Uses Software

• GenLouvain
• GossipMap

Cites Work

• A Mathematical Theory of Communication
• On multiaspect graphs
• Complex networks: structure and dynamics
• Human mobility and time spent at destination: impact on spatial epidemic spreading
• Emergence of Scaling in Random Networks
• Limits of Predictability in Human Mobility
• Community Structure in Time-Dependent, Multiscale, and Multiplex Networks
• Structure of triadic relations in multiplex networks
• Fast unfolding of communities in large networks

This page was built for publication: Mapping higher-order network flows in memory and multilayer networks with Infomap