Renormalization group on complex networks
نویسنده
چکیده
In this article, I describe a renormalization group approach for complex networks, as applied by Rozenfeld et.al. in 1. A large number of naturally occuring networks are scale-free, i.e. display a powerlaw degree distribution 2. Moreover, many of these networks display both the small world property, and fractal characteristics. The RG approach demonstrates a transition between fractal and small world networks with increasing scale, and enables the classification of networks in one of the two universality classes. Assuming an underlying fractal structure, it also provides a method for determining the distribution of overlying shortcuts in the network.
منابع مشابه
Renormalization Group Transformation for Hamiltonian Dynamical Systems in Biological Networks
We apply the renormalization group theory to the dynamical systems with the simplest example of basic biological motifs. This includes the interpretation of complex networks as the perturbation to simple network. This is the first step to build our original framework to infer the properties of biological networks, and the basis work to see its effectiveness to actual complex systems.
متن کاملScaling properties of complex networks: Toward Wilsonian renormalization for complex networks
Nowadays, scaling methods for general large-scale complex networks have been developed. We proposed a new scaling scheme called “two-site scaling”. This scheme was applied iteratively to various networks, and we observed how the degree distribution of the network changes by two-site scaling. In particular, networks constructed by the BA algorithm behave differently from the networks observed in...
متن کاملTime-Dependent Real-Space Renormalization Group Method
In this paper, using the tight-binding model, we extend the real-space renormalization group method to time-dependent Hamiltonians. We drive the time-dependent recursion relations for the renormalized tight-binding Hamiltonian by decimating selective sites of lattice iteratively. The formalism is then used for the calculation of the local density of electronic states for a one dimensional quant...
متن کاملRenormalization group for evolving networks.
We propose a renormalization group treatment of stochastically growing networks. As an example, we study percolation on growing scale-free networks in the framework of a real-space renormalization group approach. As a result, we find that the critical behavior of percolation on the growing networks differs from that in uncorrelated networks.
متن کاملCorrelation Properties and Self-similarity of Renormalization Email Networks
A degree-thresholding renormalization method is recently introduced to find topological characteristics of some complex networks. As a matter of fact, the applicability of these characteristics depends on the level or the type of complex networks. Here, a modified version of this original algorithm is presented to unravel ubiquitous characteristics of observed email networks and obtain correct ...
متن کامل