• Corpus ID: 208527813

Geometric origins of self-similarity in the evolution of real networks

  title={Geometric origins of self-similarity in the evolution of real networks},
  author={Muhua Zheng and Guillermo Garc'ia-P'erez and Mari'an Bogun'a and M. {\'A}ngeles Serrano},
  journal={arXiv: Physics and Society},
One of the aspirations of network science is to explain the growth of real networks, often through the sequential addition of new nodes that connect to older ones in the graph. However, many real systems evolve through the branching of fundamental units, whether those be scientific fields, countries, or species. Here, we provide empirical evidence for self-similar branching growth in the evolution of real networks and present the Geometric Branching Growth model, which is designed to predict… 

Figures from this paper

Network geometry

Progress in network geometry, its theory, and applications to biological, sociotechnical and other real-world networks is summarized and perspectives on future research directions and challenges in this frontier in the study of complexity are offered.

Geometric renormalization unravels self-similarity of the multiscale human connectome

The spatial multiscale organization of the human brain is explored by using two high-quality datasets with connectomes at five anatomical resolutions for 84 healthy subjects and it is found that the zoomed-out layers remain self-similar and that a geometric network model, where distances are not Euclidean, predicts the observations by application of a renormalization protocol.



Emergence of scaling in random networks

A model based on these two ingredients reproduces the observed stationary scale-free distributions, which indicates that the development of large networks is governed by robust self-organizing phenomena that go beyond the particulars of the individual systems.

Origins of fractality in the growth of complex networks

It is shown that the key principle that gives rise to the fractal architecture of networks is a strong effective ‘repulsion’ (or, disassortativity) between the most connected nodes (that is, the hubs) on all length scales, rendering them very dispersed.

Superfamilies of Evolved and Designed Networks

An approach to systematically study similarity in the local structure of networks, based on the significance profile (SP) of small subgraphs in the network compared to randomized networks, finds several superfamilies of previously unrelated networks with very similar SPs.

Self-similarity of complex networks and hidden metric spaces

These findings indicate that hidden geometries underlying these real networks are a plausible explanation for their observed topologies and, in particular, for their self-similarity with respect to the degree-based renormalization.

Multiscale unfolding of real networks by geometric renormalization

A geometric renormalization group for networks is defined by embedding them into an underlying hidden metric space and it is found that real scale-free networks show geometric scaling under this renormalized group transformation.

Critical phenomena in complex networks

A wide range of critical phenomena in equilibrium and growing networks including the birth of the giant connected component, percolation, $k$-core percolations, phenomena near epidemic thresholds, condensation transitions,critical phenomena in spin models placed on networks, synchronization, and self-organized criticality effects in interacting systems on networks are mentioned.

Percolation in self-similar networks

It is provided a simple proof that graphs in a general class of self-similar networks have zero percolation threshold and the derivation of the giant component size do not require the assumption that networks are treelike.

Handbook of Graphs and Networks: From the Genome to the Internet

This book defines the field of complex interacting networks in its infancy and presents the dynamics of networks and their structure as a key concept across disciplines and offers concepts to model network structures and dynamics, focussed on approaches applicable across disciplines.

On curvature and temperature of complex networks

It is shown that heterogeneous degree distributions in observed scale-free topologies of complex networks can emerge as a consequence of the exponential expansion of hidden hyperbolic space and a remarkable congruency between the embedding and the model is found.

Extracting the multiscale backbone of complex weighted networks

A filtering method is defined that offers a practical procedure to extract the relevant connection backbone in complex multiscale networks, preserving the edges that represent statistically significant deviations with respect to a null model for the local assignment of weights to edges.