Related papers: Renormalization group for evolving networks
We introduce an exponential random graph model for networks with a fixed degree distribution and with a tunable degree-degree correlation. We then investigate the nature of a percolation transition in the correlated network with the Poisson…
A classification of critical behavior is provided in systems for which the renormalization group equations are control-parameter dependent. It describes phase transitions in networks with a recursive, hierarchical structure but appears to…
A relation between geometric phases and criticality of spin chains are studied by using the quantum renormalization-group approach. We have shown how the geometric phase evolve as the size of the system becomes large, i.e., the finite size…
We consider the properties of vibrational dynamics on random networks, with random masses and spring constants. The localization properties of the eigenstates contrast greatly with the Laplacian case on these networks. We introduce several…
We review recent developments in tensor network approaches, focusing on renormalization group methods. Since they are free from the negative sign and complex action problems, there is growing interest in their application to lattice field…
We introduce the general formulation of a renormalization method suitable to study the critical properties of non-equilibrium systems with steady-states: the Dynamically Driven Renormalization Group. We renormalize the time evolution…
We propose a cross-order Laplacian renormalization group (X-LRG) scheme for arbitrary higher-order networks. The renormalization group is a pillar of the theory of scaling, scale-invariance, and universality in physics. An RG scheme based…
Random graphs have played an instrumental role in modelling real-world networks arising from the internet topology, social networks, or even protein-interaction networks within cells. Percolation, on the other hand, has been the fundamental…
The robustness of complex networks against node failure and malicious attack has been of interest for decades, while most of the research has focused on random attack or hub-targeted attack. In many real-world scenarios, however, attacks…
During the past two decades, percolation has long served as a basic paradigm for network resilience, community formation and so on in complex systems. While the percolation transition is known as one of the most robust continuous…
Real networks often grow through the sequential addition of new nodes that connect to older ones in the graph. However, many real systems evolve through the branching of fundamental units, whether those be scientific fields, countries, or…
We propose a numerical method to evaluate the upper critical dimension $d_c$ of random percolation clusters in Erd\H{o}s-R\'{e}nyi networks and in scale-free networks with degree distribution ${\cal P}(k) \sim k^{-\lambda}$, where $k$ is…
We study the behavior of scale-free networks, having connectivity distribution P(k) k^-a, close to the percolation threshold. We show that for networks with 3<a<4, known to undergo a transition at a finite threshold of dilution, the…
We present an exact solution of percolation in a generalized class of Watts-Strogatz graphs defined on a 1-dimensional underlying lattice. We find a non-classical critical point in the limit of the number of long-range bonds in the system…
We derive the determinant of the Laplacian for the Hanoi networks and use it to determine their number of spanning trees (or graph complexity) asymptotically. While spanning trees generally proliferate with increasing average degree, the…
Recent work on the internet, social networks, and the power grid has addressed the resilience of these networks to either random or targeted deletion of network nodes. Such deletions include, for example, the failure of internet routers or…
We address the problem of social network de-anonymization when relationships between people are described by scale-free graphs. In particular, we propose a rigorous, asymptotic mathematical analysis of the network de-anonymization problem…
Although well described by mean-field theory in the thermodynamic limit, scaling has long been puzzling for finite systems in high dimensions. This raised questions about the efficacy of the renormalization group and foundational concepts…
Using perturbative renormalization group we investigate the influence of random velocity field on the critical behavior of directed bond percolation process near its second-order phase transition between absorbing and active phase.…
The state of many physical, biological and socio-technical systems evolves by combining smooth local transitions and abrupt resetting events to a set of reference values. The inclusion of the resetting mechanism not only provides the…