Related papers: Hierarchical models of rigidity percolation
Renormalization group calculations are used to give exact solutions for rigidity percolation on hierarchical lattices. Algebraic scaling transformations for a simple example in two dimensions produce a transition of second order, with an…
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 function of a real network depends not only on the reliability of its own components, but is affected also by the simultaneous operation of other real networks coupled with it. Robustness of systems composed of interdependent network…
Rigidity Percolation is studied analytically on randomly bonded networks with two types of nodes, respectively with coordination numbers $z_1$ and $z_2$, and with $g_1$ and $g_2$ degrees of freedom each. For certain cases that model…
We consider a class of random, weighted networks, obtained through a redefinition of patterns in an Hopfield-like model and, by performing percolation processes, we get information about topology and resilience properties of the networks…
Percolation establishes the connectivity of complex networks and is one of the most fundamental critical phenomena for the study of complex systems. On simple networks, percolation displays a second-order phase transition; on multiplex…
I review computational studies of different models of elastic network self-organization leading to the existence of a globally isostatic (rigid but unstressed) or nearly isostatic intermediate phase. A common feature of all models…
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 square lattice with central forces between nearest neighbors is isostatic with a subextensive number of floppy modes. It can be made rigid by the random addition of next-nearest neighbor bonds. This constitutes a rigidity percolation…
We study the percolation phase transition in hierarchical scale-free nets. Depending on the method of construction, the nets can be fractal or small-world (the diameter grows either algebraically or logarithmically with the net size),…
Percolation is a model for random damage to a network. It is one of the simplest models that displays a phase transition: when the network is severely damaged, it falls apart in many small connected components, while if the damage is light,…
Disordered spring networks that are undercoordinated may abruptly rigidify when sufficient strain is applied. Since the deformation in response to applied strain does not change the generic quantifiers of network architecture - the number…
For certain hierarchical structures, one can study the percolation problem using the renormalization-group method in a very precise way. We show that the idea can be also applied to two-dimensional planar lattices by regarding them as…
Robustness of two coupled networks system has been studied only for dependency coupling (S. Buldyrev et. al., Nature, 2010) and only for connectivity coupling (E. A. Leicht and R. M. D'Souza, arxiv:09070894). Here we study, using a…
We present a simple model that enables us to analytically characterize a floppy to rigid transition and an associated self-adaptive intermediate phase in a random bond network. In this intermediate phase, the network adapts itself to lower…
Percolation refers to an interesting class of problems related to the properties of disordered systems, usually formulated in terms of objects randomly placed on an underlying lattice or continuum. Despite the simplicity of the setup, most…
Cascading failures in complex systems have been studied extensively using two different models: $k$-core percolation and interdependent networks. We combine the two models into a general model, solve it analytically and validate our…
Recent experimental results for covalent glasses suggest the existence of an intermediate phase attributed to the self-organization of the glass network resulting from the tendency to minimize its internal stress. However, the exact nature…
We first introduce the percolation problems associated with the graph theoretical concepts of $(k,l)$-sparsity, and make contact with the physical concepts of ordinary and rigidity percolation. We then devise a renormalization…
In many real network systems, nodes usually cooperate with each other and form groups, in order to enhance their robustness to risks. This motivates us to study a new type of percolation, group percolation, in interdependent networks under…