Related papers: Hierarchical models of rigidity percolation
Many real-world networks are embedded in space, and their resilience in the presence of reinforced nodes has not been studied. Here we model such networks using a spatial network model that have an exponential distribution of link length…
We study geometrical clues of a rigidity transition due to the emergence of a system-spanning state of self stress in under-constrained systems of individual polygons and spring networks constructed from such polygons. When a polygon with…
Many-body systems when continuous phase transition occurs are mainly built in the interrelationship between particles, implemented through many-body correlations. Some of them may exhibit so-called topological order hardly measured by…
We analyze a model that interpolates between scale-free and Erdos-Renyi networks. The model introduced generates a one-parameter family of networks and allows to analyze the role of structural heterogeneity. Analytical calculations are…
We offer a solution to a long-standing problem in the physics of networks, the creation of a plausible, solvable model of a network that displays clustering or transitivity -- the propensity for two neighbors of a network node also to be…
It is believed that, much like a cat's cradle, the cytoskeleton can be thought of as a network of strings under tension. We show that both regular and random bond-disordered networks having bonds that buckle upon compression exhibit a…
The study of crossing probabilities - i.e. probabilities of existence of paths crossing rectangles - has been at the heart of the theory of two-dimensional percolation since its beginning. They may be used to prove a number of results on…
By applying effective medium-style calculations to random spring networks, we demonstrate that internal stresses fundamentally alter the nature of the rigidity transition in disordered materials, changing it from continuous to first-order…
Percolation theory has been largely used in the study of structural properties of complex networks such as the robustness, with remarkable results. Nevertheless, a purely topological description is not sufficient for a correct…
In interdependent networks, it is usually assumed, based on percolation theory, that nodes become nonfunctional if they lose connection to the network giant component. However, in reality, some nodes, equipped with alternative resources,…
We develop a theoretical approach to percolation in random clustered networks. We find that, although clustering in scale-free networks can strongly affect some percolation properties, such as the size and the resilience of the giant…
We solve the weak percolation problem for multiplex networks with overlapping edges. In weak percolation, a vertex belongs to a connected component if at least one of its neighbors in each of the layers is in this component. This is a…
We compare phase transition and critical phenomena of bond percolation on Euclidean lattices, nonamenable graphs, and complex networks. On a Euclidean lattice, percolation shows a phase transition between the nonpercolating phase and…
Percolation theory is an approach to study vulnerability of a system. We develop analytical framework and analyze percolation properties of a network composed of interdependent networks (NetONet). Typically, percolation of a single network…
The phase transitions of random-field q-state Potts models in d=3 dimensions are studied by renormalization-group theory by exact solution of a hierarchical lattice and, equivalently, approximate Migdal-Kadanoff solutions of a cubic…
We investigate the critical phenomena of the degree-ordered percolation (DOP) model on the hierarchical $(u,v)$ flower network. Using the renormalization-group like procedure, we derive the recursion relations for the percolating…
The present paper reports on our effort to characterize vortical interactions in complex fluid flows through the use of network analysis. In particular, we examine the vortex interactions in two-dimensional decaying isotropic turbulence and…
Heterogeneous k-core percolation is an extension of a percolation model which has interesting applications to the resilience of networks under random damage. In this model, the notion of node robustness is local, instead of global as in…
Three elastic phases of covalent networks, (I) floppy, (II) isostatically rigid and (III) stressed-rigid have now been identified in glasses at specific degrees of cross-linking (or chemical composition) both in theory and experiments. Here…
We introduce a class of random graphs with a community structure, which we call the hierarchical configuration model. On the inter-community level, the graph is a configuration model, and on the intra-community level, every vertex in the…