March 12, 2024
While renormalization groups are fundamental in physics, renormalization of complex networks remains vague in its conceptual definition and methodology. Here, we propose a novel strategy to renormalize complex networks. Rather than resorting to handling the bare structure of a network, we overlay it with a readily renormalizable physical model, which reflects real-world scenarios with a broad generality. From the renormalization of the overlying system, we extract a rigorous and simple renormalization group transformation of arbitrary networks. In this way, we obtain a transparent, model-dependent physical meaning of the network renormalization, which in our case is a scale transformation preserving the transition dynamics of low-density particles. We define the strength of a node in accordance with the physical model and trace the change of its distribution under our renormalization process. This analysis demonstrates that the strength distributions of scale-free networks remain scale-invariant, whereas those of homogeneous random networks do not.
Similar papers 1
November 17, 2008
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 ...
September 10, 2016
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.
June 27, 2024
Scale invariance profoundly influences the dynamics and structure of complex systems, spanning from critical phenomena to network architecture. Here, we propose a precise definition of scale-invariant networks by leveraging the concept of a constant entropy loss rate across scales in a renormalization-group coarse-graining setting. This framework enables us to differentiate between scale-free and scale-invariant networks, revealing distinct characteristics within each class. ...
August 1, 2008
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 the nature. In addition, an iterative scaling scheme can define a new renormalizin...
January 27, 2020
Recently, the concept of geometric renormalization group provides a good approach for studying the structural symmetry and functional invariance of complex networks. Along this line, we systematically investigate the finite-size scaling of structural and dynamical observables in geometric renormalization flows of synthetic and real evolutionary networks. Our results show that these observables can be well characterized by a certain scaling function. Specifically, we show that...
June 4, 2024
The renormalization group (RG) constitutes a fundamental framework in modern theoretical physics. It allows the study of many systems showing states with large-scale correlations and their classification in a relatively small set of universality classes. RG is the most powerful tool for investigating organizational scales within dynamic systems. However, the application of RG techniques to complex networks has presented significant challenges, primarily due to the intricate i...
March 19, 2024
The Renormalization Group is crucial for understanding systems across scales, including complex networks. Renormalizing networks via network geometry, a framework in which their topology is based on the location of nodes in a hidden metric space, is one of the foundational approaches. However, the current methods assume that the geometric coupling is strong, neglecting weak coupling in many real networks. This paper extends renormalization to weak geometric coupling, showing ...
September 26, 2009
We show that renormalization group (RG) theory applied to complex networks are useful to classify network topologies into universality classes in the space of configurations. The RG flow readily identifies a small-world/fractal transition by finding (i) a trivial stable fixed point of a complete graph, (ii) a non-trivial point of a pure fractal topology that is stable or unstable according to the amount of long-range links in the network, and (iii) another stable point of a f...
February 14, 2023
Complex networks can model a range of different systems, from the human brain to social connections. Some of those networks have a large number of nodes and links, making it impractical to analyze them directly. One strategy to simplify these systems is by creating miniaturized versions of the networks that keep their main properties. A convenient tool that applies that strategy is the renormalization group (RG), a methodology used in statistical physics to change the scales ...
March 25, 2008
Recently, it has been claimed that some complex networks are self-similar under a convenient renormalization procedure. We present a general method to study renormalization flows in graphs. We find that the behavior of some variables under renormalization, such as the maximum number of connections of a node, obeys simple scaling laws, characterized by critical exponents. This is true for any class of graphs, from random to scale-free networks, from lattices to hierarchical gr...