Related papers: Phase transition in the diffusion and bootstrap pe…
We analyze the properties of Degree-Ordered Percolation (DOP), a model in which the nodes of a network are occupied in degree-descending order. This rule is the opposite of the much studied degree-ascending protocol, used to investigate…
Bootstrap percolation is a process that is used to model the spread of an infection on a given graph. In the model considered here each vertex is equipped with an individual threshold. As soon as the number of infected neighbors exceeds…
Bootstrap percolation is a simple but non-trivial model. It has applications in many areas of science and has been explored on random networks for several decades. In single layer (simplex) networks, it has been recently observed that…
We study homogeneous, independent percolation on general quasi-transitive graphs. We prove that in the disorder regime where all clusters are finite almost surely, in fact the expectation of the cluster size is finite. This extends a…
The percolation phase transition in complex network systems attracts much attention and has numerous applications in various research fields. Finite size effects smooth the transition and make it difficult to predict the critical point of…
We investigate the influence of sub-Ohmic dissipation on randomly diluted quantum Ising and rotor models. The dissipation causes the quantum dynamics of sufficiently large percolation clusters to freeze completely. As a result, the…
We consider the level-sets of continuous Gaussian fields on $\mathbb{R}^d$ above a certain level $-\ell\in \mathbb{R}$, which defines a percolation model as $\ell$ varies. We assume that the covariance kernel satisfies certain regularity,…
Due to their conceptual and mathematical simplicity, Erd\"os-R\'enyi or classical random graphs remain as a fundamental paradigm to model complex interacting systems in several areas. Although condensation phenomena have been widely…
Percolation is one of the most studied processes in statistical physics. A recent paper by Achlioptas et al. [Science 323, 1453 (2009)] has shown that the percolation transition, which is usually continuous, becomes discontinuous…
The evolution of the Erd\H{o}s-R\'enyi (ER) network by adding edges can be viewed as a cluster aggregation process. Such ER processes can be described by a rate equation for the evolution of the cluster-size distribution with the connection…
Percolation theory allows simple description of the phase transition based on the scaling properties of the network clusters with respect to a single parameter - site or bond occupation probability. How to design a network exhibiting the…
We consider vertex percolation on pseudo-random $d-$regular graphs. The previous study by the second author established the existence of phase transition from small components to a linear (in $\frac{n}{d}$) sized component, at…
We consider robustness and percolation properties of the networks of networks, in which random nodes in different individual networks (layers) can be interdependent. We explore the emergence of the giant mutually connected component,…
The culling process in Bootstrap Percolation is Abelian since the final stable configuration does not depend on the details of the updating procedure. An efficient algorithm is devised using this idea for the determination of the bootstrap…
We study the level spacing distribution p(s) in the spectrum of random networks. According to our numerical results, the shape of p(s) in the Erdos-Renyi (E-R) random graph is determined by the average degree <k>, and p(s) undergoes a…
Bootstrap percolation on a graph is a deterministic process that iteratively enlarges a set of occupied sites by adjoining points with at least $\theta$ occupied neighbors. The initially occupied set is random, given by a uniform product…
Bootstrap percolation is an often used model to study the spread of diseases, rumors, and information on sparse random graphs. The percolation process demonstrates a critical value such that the graph is either almost completely affected or…
The main purpose of percolation theory is to model phase transitions in a variety of random systems, which is highly valuable in fields related to materials physics, biology, or otherwise unrelated areas like oil extraction or even quantum…
When real networks are considered, coupled networks with connectivity and feedback-dependency links are not rare but more general. Here we develop a mathematical framework and study numerically and analytically percolation of interacting…
We investigate the component sizes of the critical configuration model, as well as the related problem of critical percolation on a supercritical configuration model. We show that, at criticality, the finite third moment assumption on the…