Identifying robust features of community structure in complex networks

Abstract

Network science has presented community detection as a valuable tool for revealing functional modules in complex systems rooted in the wiring architectures of complex networks. The varying procedures of community detection can produce, however, divisions of a network into communities that vary considerably in structure but are deemed to be of similar merit. This is especially problematic when the network is constructed on uncertain data, since small changes to the network's configuration can cause radically different structure to be detected. To reconcile with the ambiguity in interpreting degenerate network partitions as representations of the underlying system function, we introduce a recursive significance clustering scheme that identifies the subsets of nodes having stable joint community assignments under network perturbation. These robust node groups are referred to here as cores, and represent well-supported features of network structure as distinct from the nodes with unstable community assignments. We show that cores characterize the variability inherent to non-overlapping community structure in networks and are cohesive under temporal evolution of the network.

References in corpus (41)

• Fast unfolding of communities in large networks
• Statistical mechanics of complex networks
• The structure and function of complex networks
• Community structure in social and biological networks
• Finding and evaluating community structure in networks
• Modularity and community structure in networks
• Community detection in graphs
• Finding community structure in very large networks
• From Louvain to Leiden: guaranteeing well-connected communities
• Fast algorithm for detecting community structure in networks
• Uncovering the overlapping community structure of complex networks in nature and society
• Cooperative Game Theory Approaches for Network Partitioning
• Maps of random walks on complex networks reveal community structure
• Benchmark graphs for testing community detection algorithms
• Defining and identifying communities in networks
• The worldwide air transportation network: Anomalous centrality, community structure, and cities' global roles
• A smart local moving algorithm for large-scale modularity-based community detection
• The performance of modularity maximization in practical contexts
• Modularity from Fluctuations in Random Graphs and Complex Networks
• The map equation
• Consensus clustering in complex networks
• Mapping change in large networks
• A Comparative Analysis of Community Detection Algorithms on Artificial Networks
• Limits of modularity maximization in community detection
• Community Discovery in Dynamic Networks: a Survey
• The ground truth about metadata and community detection in networks
• Robustness of community structure in networks
• Modularity-Maximizing Network Communities via Mathematical Programming
• Markov dynamics as a zooming lens for multiscale community detection: non clique-like communities and the field-of-view limit
• Think Locally, Act Locally: The Detection of Small, Medium-Sized, and Large Communities in Large Networks
• Finding instabilities in the community structure of complex networks
• Flow networks: A characterization of geophysical fluid transport
• 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
• Consistency of community structure in complex networks
• Uncovering the community structure associated with the diffusion dynamics of networks
• Exploring the solution landscape enables more reliable network community detection
• Fast consensus clustering in complex networks
• Consistency landscape of network communities
• Relational flexibility of network elements based on inconsistent community detection
• Robustness of community structure under edge addition