Self-similar scaling of density in complex real-world networks

Abstract

Despite their diverse origin, networks of large real-world systems reveal a number of common properties including small-world phenomena, scale-free degree distributions and modularity. Recently, network self-similarity as a natural outcome of the evolution of real-world systems has also attracted much attention within the physics literature. Here we investigate the scaling of density in complex networks under two classical box-covering renormalizations-network coarse-graining-and also different community-based renormalizations. The analysis on over 50 real-world networks reveals a power-law scaling of network density and size under adequate renormalization technique, yet irrespective of network type and origin. The results thus advance a recent discovery of a universal scaling of density among different real-world networks [Laurienti et al., Physica A 390 (20) (2011) 3608-3613.] and imply an existence of a scale-free density also within-among different self-similar scales of-complex real-world networks. The latter further improves the comprehension of self-similar structure in large real-world networks with several possible applications.

References in corpus (17)

• Finding community structure in networks using the eigenvectors of matrices
• Cooperative Game Theory Approaches for Network Partitioning
• Near linear time algorithm to detect community structures in large-scale networks
• Resolution limit in community detection
• How to calculate the fractal dimension of a complex network: the box covering algorithm
• Graph Evolution: Densification and Shrinking Diameters
• Unfolding communities in large complex networks: Combining defensive and offensive label propagation for core extraction
• Robust network community detection using balanced propagation
• A box-covering algorithm for fractal scaling in scale-free networks
• Community structure of complex software systems: Analysis and applications
• Complex networks renormalization: flows and fixed points
• Exploring self-similarity of complex cellular networks: The edge-covering method with simulated annealing and log-periodic sampling
• Percolation in self-similar networks
• Fractal scale-free networks resistant to disease spread
• Renormalization flows in complex networks
• Coarse Graining for Synchronization in Directed Networks
• Random Sequential Renormalization of Networks I: Application to Critical Trees

Cited by in corpus (20)

• Identifying influential spreaders in complex networks based on gravity formula
• Community structure of complex software systems: Analysis and applications
• Diversity of information pathways drives scaling and sparsity in real-world networks
• Explorability and the origin of Network Sparsity in Living Systems
• Predicting missing links via significant paths
• Improving link prediction in complex networks by adaptively exploiting multiple structural features of networks
• Mechanism of organization increase in complex systems
• Counterexample: scale-free networked graphs with invariable diameter and density feature
• Optimal high-level descriptions of dynamical systems
• Label propagation for clustering
• Node mixing and group structure of complex software networks
• Exponential Self-Organization and Moore's Law: Measures and Mechanisms
• Propinquity drives the emergence of network structure and density
• Convex skeletons of complex networks
• Empirical comparison of network sampling techniques
• Patterns of Primes and Composites from Divisibility Network of Natural Numbers
• Modelling the Self-similarity in Complex Networks Based on Coulomb's Law
• Approximating Spatial Distance Through Confront Networks: Application to the Segmentation of Medieval Avignon
• Interactive Levy Flight in Interest Space
• Temporal similarity metrics for latent network reconstruction: The role of time-lag decay