Interplay between -core and community structure in complex networks
arXiv:2005.01147 · doi:10.1038/s41598-020-71426-8
Abstract
The organisation of a network in a maximal set of nodes having at least neighbours within the set, known as -core decomposition, has been used for studying various phenomena. It has been shown that nodes in the innermost -shells play a crucial role in contagion processes, emergence of consensus, and resilience of the system. It is known that the -core decomposition of many empirical networks cannot be explained by the degree of each node alone, or equivalently, random graph models that preserve the degree of each node (i.e., configuration model). Here we study the -core decomposition of some empirical networks as well as that of some randomised counterparts, and examine the extent to which the -shell structure of the networks can be accounted for by the community structure. We find that preserving the community structure in the randomisation process is crucial for generating networks whose -core decomposition is close to the empirical one. We also highlight the existence, in some networks, of a concentration of the nodes in the innermost -shells into a small number of communities.
34 pages, 4 tables, and 15 figures. Main + supplementary. Final version accepted for publication
References in corpus (34)
- Emergence of scaling in random networks
- Fast unfolding of communities in large networks
- The NumPy array: a structure for efficient numerical computation
- Identification of influential spreaders in complex networks
- Benchmark graphs for testing community detection algorithms
- Resolution limit in community detection
- Stochastic blockmodels and community structure in networks
- Community detection in networks: A user guide
- Higher-order organization of complex networks
- Detecting rich-club ordering in complex networks
- Social Structure of Facebook Networks
- The Rich-Club Phenomenon In The Internet Topology
- Random Walks, Markov Processes and the Multiscale Modular Organization of Complex Networks
- Laplacian Dynamics and Multiscale Modular Structure in Networks
- Structure and dynamics of core-periphery networks
- Comparing Community Structure to Characteristics in Online Collegiate Social Networks
- Triadic closure as a basic generating mechanism of communities in complex networks
- Nestedness in complex networks: Observation, emergence, and implications
- Emergence of communities in weighted networks
- Nonparametric Bayesian inference of the microcanonical stochastic block model
- Spectral coarse-graining of complex networks
- Network histograms and universality of blockmodel approximation
- Enhanced reconstruction of weighted networks from strengths and degrees
- Multi-scale structure and topological anomaly detection via a new network statistic: The onion decomposition
- Consistency of community structure in complex networks
- Voter model on the two-clique graph
- Characterizing the analogy between hyperbolic embedding and community structure of complex networks
- Committed activists and the reshaping of status-quo social consensus
- An Empirical Study of the Relation Between Community Structure and Transitivity
- Universality of the stochastic block model
- Hierarchical benchmark graphs for testing community detection algorithms
- Percolation on random networks with arbitrary k-core structure
- Percolation and the effective structure of complex networks
- k-core structure of real multiplex networks