Geographical Coarsegraining of Complex Networks

Abstract

We perform the renormalization-group-like numerical analysis of geographically embedded complex networks on the two-dimensional square lattice. At each step of coarsegraining procedure, the four vertices on each $2\times 2$ square box are merged to a single vertex, resulting in the coarsegrained system of the smaller sizes. Repetition of the process leads to the observation that the coarsegraining procedure does not alter the qualitative characteristics of the original scale-free network, which opens the possibility of subtracting a smaller network from the original network without destroying the important structural properties. The implication of the result is also suggested in the context of the recent study of the human brain functional network.

To appear in Phys. Rev. Lett

References in corpus (14)

• Emergence of scaling in random networks
• Statistical mechanics of complex networks
• Assortative mixing in networks
• Evolution of networks
• Specificity and stability in topology of protein networks
• Mean-field theory for scale-free random networks
• Hierarchical Organization in Complex Networks
• Why social networks are different from other types of networks
• Growing Scale-Free Networks with Tunable Clustering
• Scale-free Networks on Lattices
• Hierarchy Measures in Complex Networks
• Structural transitions in scale-free networks
• First-order transition in small-world networks
• Geographical Embedding of Scale-Free Networks

Cited by in corpus (24)

• Vital nodes identification in complex networks
• Extracting the multiscale backbone of complex weighted networks
• Maximal planar networks with large clustering coefficient and power-law degree distribution
• Skeleton and fractal scaling in complex networks
• Information filtering in complex weighted networks
• Horizontal visibility graphs transformed from fractional Brownian motions: Topological properties versus Hurst index
• Exploring self-similarity of complex cellular networks: The edge-covering method with simulated annealing and log-periodic sampling
• Localizations on Complex Networks
• Scaling of Energy Dissipation in Nonequilibrium Reaction Networks
• Statistical significance of rich-club phenomena in complex networks
• Coarse Graining for Synchronization in Directed Networks
• Irreducible network backbones: unbiased graph filtering via maximum entropy
• Statistically consistent coarse-grained simulations for critical phenomena in complex networks
• Scaling of critical connectivity of mobile ad hoc communication networks
• Multiscale network renormalization: scale-invariance without geometry
• Network Renormalization
• Finite-size scaling of geometric renormalization flows in complex networks
• Spectral coarse graining for random walk in bipartite networks
• Dynamics on Spatial Networks and the Effect of Distance Coarse Graining
• Topological estimation of the latent geometry of a complex network
• Dissipation at limited resolutions: Power law and detection of hidden dissipative scales
• Coarse-grained Monte Carlo simulations of the phase transition of Potts model on weighted networks
• Scaling properties of complex networks: Toward Wilsonian renormalization for complex networks
• A hybrid multiscale coarse-grained method for dynamics on complex networks