Related papers: Bootstrap percolation on spatial networks
We study the critical behavior for percolation on inhomogeneous random networks on $n$ vertices, where the weights of the vertices follow a power-law distribution with exponent $\tau \in (2,3)$. Such networks, often referred to as…
Communication networks, power grids, and transportation networks are all examples of networks whose performance depends on reliable connectivity of their underlying network components even in the presence of usual network dynamics due to…
We introduce the heterogeneous-$k$-core, which generalizes the $k$-core, and contrast it with bootstrap percolation. Vertices have a threshold $k_i$ which may be different at each vertex. If a vertex has less than $k_i$ neighbors it is…
Localization-delocalization transition in a discrete Anderson nonlinear Schr\"odinger equation with disorder is shown to be a critical phenomenon $-$ similar to a percolation transition on a disordered lattice, with the nonlinearity…
Percolation on complex networks is used both as a model for dynamics on networks, such as network robustness or epidemic spreading, and as a benchmark for our models of networks, where our ability to predict percolation measures our ability…
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 study the long range percolation model on $\mathbb{Z}$ where sites $i$ and $j$ are connected with probability $\beta |i-j|^{-s}$. Graph distances are now well understood for all exponents $s$ except in the case $s=2$ where the model…
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,…
In the bootstrap percolation model, sites in an $L$ by $L$ square are initially independently declared active with probability $p$. At each time step, an inactive site becomes active if at least two of its four neighbours are active. We…
In this article, we consider an anisotropic finite-range bond percolation model on $\mathbb{Z}^2$. On each horizontal layer $\{(x,i): x \in \mathbb{Z}\}$ we have edges $\langle(x, i),(y, i)\rangle$ for $1 \leq |x - y| \leq N$. There are…
We study both numerically and analytically what happens to a random graph of average connectivity "alpha" when its leaves and their neighbors are removed iteratively up to the point when no leaf remains. The remnant is made of isolated…
We study percolation transition of run and tumble particles (RTPs) on a two dimensional square lattice. RTPs in these models run to the nearest neighbour along their internal orientation with unit rate, and to other nearest neighbours with…
We study numerically statistical properties and dynamical disease propagation using a percolation model on a one dimensional small world network. The parameters chosen correspond to a realistic network of school age children. We found that…
Networks composed from both connectivity and dependency links were found to be more vulnerable compared to classical networks with only connectivity links. Their percolation transition is usually of a first order compared to the second…
A region of two-dimensional space has been filled randomly with large number of growing circular discs allowing only a `slight' overlapping among them just before their growth stop. More specifically, each disc grows from a nucleation…
Recently it has been demonstrated that the connectivity transition from microscopic connectivity to macroscopic connectedness, known as percolation, is generically announced by a cascade of microtransitions of the percolation order…
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…
Higher order interactions are increasingly recognised as a fundamental aspect of complex systems ranging from the brain to social contact networks. Hypergraph as well as simplicial complexes capture the higher-order interactions of complex…
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…
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…