Geometric randomization of real networks with prescribed degree sequence

Abstract

We introduce a model for the randomization of complex networks with geometric structure. The geometric randomization (GR) model assumes a homogeneous distribution of the nodes in an underlying similarity space and uses rewirings of the links to find configurations that maximize a connection probability akin to that of the ${\mathbb{S}}^1$ or ${\mathbb{H}}^2$ geometric network models. However, GR preserves the original degree sequence, as in the configuration model, thus eliminating the fluctuations of the degree cutoff. Moreover, the model does not require the explicit estimation of hidden degree variables, which restricts the number of free parameters to one, controlling the level of clustering in the rewired network. We illustrate the potential of GR as a null model by investigating the effects on modularity that derive from the flattening of geometric communities in both real and synthetic networks. As a result, we find that for real networks the geometric and topological communities are consistent, while for the randomized counterparts, the topological communities detected are attributable to structural constraints induced by the underlying geometric architecture.

arXiv comment8 pages, 6 figures

References in corpus (35)

• Emergence of scaling in random networks
• Fast unfolding of communities in large networks
• Finding and evaluating community structure in networks
• Random graphs with arbitrary degree distributions and their applications
• Specificity and stability in topology of protein networks
• Stochastic blockmodels and community structure in networks
• Hyperbolic Geometry of Complex Networks
• Detecting rich-club ordering in complex networks
• Missing and spurious interactions and the reconstruction of complex networks
• Asymptotic analysis of the stochastic block model for modular networks and its algorithmic applications
• The statistical mechanics of networks
• Navigability of Complex Networks
• Sustaining the Internet with Hyperbolic Mapping
• Classes of complex networks defined by role-to-role connectivity profiles
• Prominence and control: The weighted rich-club effect
• The Statistical Physics of Real-World Networks
• Uncovering space-independent communities in spatial networks
• Self-similarity of complex networks and hidden metric spaces
• The entropy of network ensembles
• Measuring the evolution of contemporary western popular music
• Analytical maximum-likelihood method to detect patterns in real networks
• Generalized Bose-Fermi statistics and structural correlations in weighted networks
• Randomizing world trade. I. A binary network analysis
• Multiscale unfolding of real networks by geometric renormalization
• Correlations in weighted networks
• Emergence of Soft Communities from Geometric Preferential Attachment
• The hidden geometry of weighted complex networks
• Clustering implies geometry in networks
• The weighted random graph model
• Rich-club vs rich-multipolarization phenomena in weighted networks
• Multi-species grandcanonical models for networks with reciprocity
• Characterizing the analogy between hyperbolic embedding and community structure of complex networks
• Spatial network surrogates for disentangling complex system structure from spatial embedding of nodes
• Soft communities in similarity space
• Weighted Configuration Model

Cited by in corpus (2)

• A geometry-induced topological phase transition in random graphs
• Geometric detection of hierarchical backbones in real networks