Related papers: Unusual percolation in simple small-world networks
Theoretical attempts proposed so far to describe ordinary percolation processes on real-world networks rely on the locally tree-like ansatz. Such an approximation, however, holds only to a limited extent, as real graphs are often…
Wireless multi-hop ad hoc communication networks represent an infrastructure-less and self-organized generalization of todays wireless cellular networks. Connectivity within such a network is an important issue. Continuum percolation and…
Static wireless networks are by now quite well understood mathematically through the random geometric graph model. By contrast, there are relatively few rigorous results on the practically important case of mobile networks, in which the…
Recently, the number of non-standard percolation models has proliferated. In all these models, there exists a phase transition at which long range connectivity is established, if local connectedness increases through a threshold $p_c$. In…
We investigate the role of clustering on the critical behavior of the contact process (CP) on small-world networks using the Watts-Strogatz (WS) network model with an edge rewiring probability p. The critical point is well predicted by a…
Zero-range processes, in which particles hop between sites on a lattice, are closely related to equilibrium networks, in which rewiring of links take place. Both systems exhibit a condensation transition for appropriate choices of the…
We propose the $K$-selective percolation process as a model for the iterative removals of nodes with the specific intermediate degree in complex networks. In the model, a random node with degree $K$ is deactivated one by one until no more…
Jigsaw percolation is a model for the process of solving puzzles within a social network, which was recently proposed by Brummitt, Chatterjee, Dey and Sivakoff. In the model there are two graphs on a single vertex set (the `people' graph…
We present a numerical study for the threshold percolation probability, $p_c$, in the bond percolation model with multiple ranges, in the square lattice. A recent Theorem demonstrated by de Lima {\it et al.} [B. N. B. de Lima, R. P.…
We introduce a model of random interlacements made of a countable collection of doubly infinite paths on Z^d, d bigger or equal to 3. A non-negative parameter u measures how many trajectories enter the picture. This model describes in the…
We introduce a set of iterative equations that exactly solves the size distribution of components on small arbitrary graphs after the random removal of edges. We also demonstrate how these equations can be used to predict the distribution…
Percolation, the formation of a macroscopic connected component, is a key feature in the description of complex networks. The dynamical properties of a variety of systems can be understood in terms of percolation, including the robustness…
In 1999, Zhang proved that, for first passage percolation on the square lattice $\mathbb{Z}^2$ with i.i.d. non-negative edge weights, if the probability that the passage time distribution of an edge $P(t_e = 0) =1/2 $, the critical value…
In this work we investigate the problem of estimating the percolation centrality of every vertex in a graph. This centrality measure quantifies the importance of each vertex in a graph going through a contagious process. It is an open…
The localization transition and the critical properties of the Lorentz model in three dimensions are investigated by computer simulations. We give a coherent and quantitative explanation of the dynamics in terms of continuum percolation…
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…
Understanding the resilience of infrastructures such as transportation network has significant importance for our daily life. Recently, a homogeneous spatial network model was developed for studying spatial embedded networks with…
We describe in detail a new and highly efficient algorithm for studying site or bond percolation on any lattice. The algorithm can measure an observable quantity in a percolation system for all values of the site or bond occupation…
We further study the interfaces arising in a situation of inhomogeneity. More precisely, we identify a characteristic length for the gradient percolation model, that enables us to tighten previous estimates established for it. This allows…
Dependency links in single-layer networks offer a convenient way of modeling nonlocal percolation effects in networked systems where certain pairs of nodes are only able to function together. We study the percolation properties of the weak…