Community Detection with the Map Equation and Infomap: Theory and Applications

Abstract

Real-world networks have a complex topology comprising many elements often structured into communities. Revealing these communities helps researchers uncover the organizational and functional structure of the system that the network represents. However, detecting community structures in complex networks requires selecting a community detection method among a multitude of alternatives with different network representations, community interpretations, and underlying mechanisms. This tutorial focuses on a popular community detection method called the map equation and its search algorithm Infomap. The map equation framework for community detection describes communities by analyzing dynamic processes on the network. Thanks to its flexibility, the map equation provides extensions that can incorporate various assumptions about network structure and dynamics. To help decide if the map equation is a suitable community detection method for a given complex system and problem at hand - and which variant to choose - we review the map equation's theoretical framework and guide users in applying the map equation to various research problems.

References in corpus (37)

• Fast unfolding of communities in large networks
• Community detection in graphs
• From Louvain to Leiden: guaranteeing well-connected communities
• Cooperative Game Theory Approaches for Network Partitioning
• Maps of random walks on complex networks reveal community structure
• Resolution limit in community detection
• Detecting the overlapping and hierarchical community structure of complex networks
• Community detection in networks: A user guide
• Networks beyond pairwise interactions: structure and dynamics
• Community Structure in Jazz
• The performance of modularity maximization in practical contexts
• Mapping change in large networks
• 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
• Laplacian Dynamics and Multiscale Modular Structure in Networks
• Memory in network flows and its effects on spreading dynamics and community detection
• Parsimonious module inference in large networks
• Random walks on hypergraphs
• Markov dynamics as a zooming lens for multiscale community detection: non clique-like communities and the field-of-view limit
• Mapping higher-order network flows in memory and multilayer networks with Infomap
• Encoding dynamics for multiscale community detection: Markov time sweeping for the Map equation
• Estimating the resolution limit of the map equation in community detection
• Exploring the limits of community detection strategies in complex networks
• Improved mutual information measure for classification and community detection
• Efficient community detection of network flows for varying Markov times and bipartite networks
• Exploring the solution landscape enables more reliable network community detection
• Constrained information flows in temporal networks reveal intermittent communities
• Map Equation Centrality: Community-aware Centrality based on the Map Equation
• A Map Equation with Metadata: Varying the Role of Attributes in Community Detection
• Mapping flows on sparse networks with missing links
• Comparing network covers using mutual information
• Maps of sparse Markov chains efficiently reveal community structure in network flows with memory
• Mapping Flows on Bipartite Networks
• Cross-validation of correlation networks using modular structure
• Reliable data clustering with Bayesian community detection
• Variable Markov dynamics as a multi-focal lens to map multi-scale complex networks
• Mapping memory-biased dynamics with compact models reveals overlapping communities in large networks