Constrained information flows in temporal networks reveal intermittent communities

Abstract

Many real-world networks represent dynamic systems with interactions that change over time, often in uncoordinated ways and at irregular intervals. For example, university students connect in intermittent groups that repeatedly form and dissolve based on multiple factors, including their lectures, interests, and friends. Such dynamic systems can be represented as multilayer networks where each layer represents a snapshot of the temporal network. In this representation, it is crucial that the links between layers accurately capture real dependencies between those layers. Often, however, these dependencies are unknown. Therefore, current methods connect layers based on simplistic assumptions that do not capture node-level layer dependencies. For example, connecting every node to itself in other layers with the same weight can wipe out dependencies between intermittent groups, making it difficult or even impossible to identify them. In this paper, we present a principled approach to estimating node-level layer dependencies based on the network structure within each layer. We implement our node-level coupling method in the community detection framework Infomap and demonstrate its performance compared to current methods on synthetic and real temporal networks. We show that our approach more effectively constrains information inside multilayer communities so that Infomap can better recover planted groups in multilayer benchmark networks that represent multiple modes with different groups and better identify intermittent communities in real temporal contact networks. These results suggest that node-level layer coupling can improve the modeling of information spreading in temporal networks and better capture intermittent community structure.

arXiv comment10 pages, 10 figures, published in PRE

References in corpus (19)

• Maps of random walks on complex networks reveal community structure
• Multilayer Networks
• Benchmark graphs for testing community detection algorithms
• Community Structure in Time-Dependent, Multiscale, and Multiplex Networks
• Quantifying social group evolution
• Mathematical Formulation of Multi-Layer Networks
• The map equation
• High-resolution measurements of face-to-face contact patterns in a primary school
• Measuring large-scale social networks with high resolution
• Fundamental structures of dynamic social networks
• Detecting the community structure and activity patterns of temporal networks: a non-negative tensor factorization approach
• Data on face-to-face contacts in an office building suggests a low-cost vaccination strategy based on community linkers
• Community detection, link prediction, and layer interdependence in multilayer networks
• Identifying modular flows on multilayer networks reveals highly overlapping organization in social systems
• Inferring the mesoscale structure of layered, edge-valued and time-varying networks
• Clustering Network Layers With the Strata Multilayer Stochastic Block Model
• A network approach to analyzing highly recombinant malaria parasite genes
• Exploring the limits of community detection strategies in complex networks
• Community detection in directed acyclic graphs

Cited by in corpus (10)

• Mapping flows on hypergraphs
• A Framework for the Construction of Generative Models for Mesoscale Structure in Multilayer Networks
• Multilayer Network Science: from Cells to Societies
• Flow stability for dynamic community detection
• Directed Percolation in Random Temporal Network Models with Heterogeneities
• Inference of Edge Correlations in Multilayer Networks
• Community Detection with the Map Equation and Infomap: Theory and Applications
• Fundamental Structures in Dynamic Communication Networks
• Single-trajectory map equation
• Skeleton coupling: a novel interlayer mapping of community evolution in temporal networks