Organization of modular networks

Abstract

We examine the global organization of heterogeneous equilibrium networks consisting of a number of well distinguished interconnected parts--``communities'' or modules. We develop an analytical approach allowing us to obtain the statistics of connected components and an intervertex distance distribution in these modular networks, and to describe their global organization and structure. In particular, we study the evolution of the intervertex distance distribution with an increasing number of interlinks connecting two infinitely large uncorrelated networks. We demonstrate that even a relatively small number of shortcuts unite the networks into one. In more precise terms, if the number of the interlinks is any finite fraction of the total number of connections, then the intervertex distance distribution approaches a delta-function peaked form, and so the network is united.

9 pages, 3 figures

References in corpus (19)

• Statistical mechanics of complex networks
• The structure and function of complex networks
• Random graphs with arbitrary degree distributions and their applications
• Evolution of networks
• Critical phenomena in complex networks
• Why social networks are different from other types of networks
• Scale-Free Networks are Ultrasmall
• New Model of Internet Topology Using k-shell Decomposition
• MEDUSA - New Model of Internet Topology Using k-shell Decomposition
• k-core organization of complex networks
• Average path length in random networks
• Average path length in uncorrelated random networks with hidden variables
• Random graphs as models of networks
• k-core decomposition: a tool for the visualization of large scale networks
• k-core (bootstrap) percolation on complex networks: Critical phenomena and nonlocal effects
• Cascading Dynamics in Modular Networks
• Metric structure of random networks
• Preferential attachment of communities: the same principle, but a higher level
• Modular networks emerge from multiconstraint optimization

Cited by in corpus (9)

• Multilayer Networks
• The unreasonable effectiveness of tree-based theory for networks with clustering
• Cavity analysis on the robustness of random networks against targeted attacks: Influences of degree-degree correlations
• Critical field-exponents for secure message-passing in modular networks
• Statistical Mechanics of Semi-Supervised Clustering in Sparse Graphs
• Distance Distribution in Extreme Modular Networks
• Sandpile cascades on interacting tree-like networks
• Influence of long-range interactions on strategy selection in crowd
• Statistics of remote regions of networks