Related papers: Renormalization group for link percolation on plan…
Percolation in a scale-free hierarchical network is solved exactly by renormalization-group theory, in terms of the different probabilities of short-range and long-range bonds. A phase of critical percolation, with algebraic…
The renormalization group (RG) is a powerful theoretical framework developed to consistently transform the description of configurations of systems with many degrees of freedom, along with the associated model parameters and coupling…
We study the singularity of the order parameter at the transition between a critical phase and an ordered phase of bond percolation on pointed hierarchical graphs. In pointed hierarchical graphs, the renormalization group (RG) equation…
The phase diagram of two interacting planar arrays of directed lines in random media is obtained by a renormalization group analysis. The results are discussed in the contexts of the roughening of reconstructed crystal surfaces, and the…
In many systems consisting of interacting subsystems, the complex interactions between elements can be represented using multilayer networks. However percolation, key to understanding connectivity and robustness, is not trivially…
Many complex networks exhibit a percolation transition involving a macroscopic connected component, with universal features largely independent of the microscopic model and the macroscopic domain geometry. In contrast, we show that the…
We study a model for coupled networks introduced recently by Buldyrev et al., Nature 464, 1025 (2010), where each node has to be connected to others via two types of links to be viable. Removing a critical fraction of nodes leads to a…
A simple but powerful network model with $n$ nodes and $m$ partly overlapping layers is generated as an overlay of independent random graphs $G_1,\dots,G_m$ with variable sizes and densities. The model is parameterised by a joint…
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…
Percolation is perhaps the simplest example of a process exhibiting a phase transition and one of the most studied phenomena in statistical physics. The percolation transition is continuous if sites/bonds are occupied independently with the…
Percolation in complex networks is viewed as both: a process that mimics network degradation and a tool that reveals peculiarities of the underlying network structure. During the course of percolation, networks undergo non-trivial…
Using renormalization group methods we study multifractality in directed percolation. Our approach is based on random lattice networks consisting of resistor like and diode like bonds with microscopic noise. These random resistor diode…
By employing the methods of renormalized field theory we show that the percolation behavior of random resistor-diode networks near the multicritical line belongs to the universality class of isotropic percolation. We construct a mesoscopic…
Hypergraphs capture the higher-order interactions in complex systems and always admit a factor graph representation, consisting of a bipartite network of nodes and hyperedges. As hypegraphs are ubiquitous, investigating hypergraph…
We study the statistical behavior under random sequential renormalization(RSR) of several network models including Erd"os R'enyi (ER) graphs, scale-free networks and an annealed model (AM) related to ER graphs. In RSR the network is locally…
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…
We revisit the phase transition for percolation on randomly stretched lattices. Starting with the usual square grid, keep all vertices untouched while erasing edges according as follows: for every integer $i$, the entire column of vertical…
The problem of continuum percolation in dispersions of rods is reformulated in terms of weighted random geometric graphs. Nodes (or sites or vertices) in the graph represent spatial locations occupied by the centers of the rods. The…
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…
Formation of a molecular network from multifunctional precursors is modelled with a random graph process. The random graph model favours reactivity for monomers that are positioned close in the network topology, and disfavours reactivity…