Renormalization flows in complex networks
arXiv:0811.2761 · doi:10.1103/PhysRevE.79.026104
Abstract
Complex networks have acquired a great popularity in recent years, since the graph representation of many natural, social and technological systems is often very helpful to characterize and model their phenomenology. Additionally, the mathematical tools of statistical physics have proven to be particularly suitable for studying and understanding complex networks. Nevertheless, an important obstacle to this theoretical approach is still represented by the difficulties to draw parallelisms between network science and more traditional aspects of statistical physics. In this paper, we explore the relation between complex networks and a well known topic of statistical physics: renormalization. A general method to analyze renormalization flows of complex networks is introduced. The method can be applied to study any suitable renormalization transformation. Finite-size scaling can be performed on computer-generated networks in order to classify them in universality classes. We also present applications of the method on real networks.
12 pages, 11 figures
References in corpus (15)
- Emergence of scaling in random networks
- Statistical mechanics of complex networks
- The structure and function of complex networks
- The diameter of the world wide web
- Hierarchical Organization in Complex Networks
- Self-similarity of complex networks
- Structure of Growing Networks: Exact Solution of the Barabasi--Albert's Model
- Origins of fractality in the growth of complex networks
- Clique percolation in random networks
- How to calculate the fractal dimension of a complex network: the box covering algorithm
- Skeleton and fractal scaling in complex networks
- Fractality in complex networks: critical and supercritical skeletons
- A box-covering algorithm for fractal scaling in scale-free networks
- Self-similar Scale-free Networks and Disassortativity
- Complex networks renormalization: flows and fixed points
Cited by in corpus (14)
- Network Geometry
- Self-similar scaling of density in complex real-world networks
- Weighted Fractal Networks
- Dynamics and Processing in Finite Self-Similar Networks
- Random elastic networks : strong disorder renormalization approach
- Irreversible Aggregation and Network Renormalization
- Random Sequential Renormalization of Networks I: Application to Critical Trees
- Agglomerative Percolation on Bipartite Networks: A Novel Type of Spontaneous Symmetry Breaking
- Network Renormalization
- Finite-size scaling of geometric renormalization flows in complex networks
- Random Sequential Renormalization and Agglomerative Percolation in Networks: Application to Erd"os-R'enyi and Scale-free Graphs
- Laplacian Renormalization Group: An introduction to heterogeneous coarse-graining
- Scaling properties of scale-free networks in degree-thresholding renormalization flows
- Inhomogeneous random graphs with infinite-mean fitness variables