Related papers: Bernoulli line percolation
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…
It is well known that a continuous phase transition in Bernoulli bond percolation on the integer lattice is equivalent to a vanishing probability a vertex is invaded in invasion percolation. We provide a coupling between invasion…
The extinction transition in the presence of a localized quenched defect is studied numerically. When the bulk is at criticality, the correlation length diverges and even an infinite system cannot "decouple" from the defect. The results…
We consider Bernoulli bond percolation on a large scale-free tree in the supercritical regime, meaning informally that there exists a giant cluster with high probability. We obtain a weak limit theorem for the sizes of the next largest…
We study the stationary distribution of the (spread-out) $d$-dimensional contact process from the point of view of site percolation. In this process, vertices of $\mathbb{Z}^d$ can be healthy (state 0) or infected (state 1). With rate one…
Let H_n be the hypercube {0,1}^n, and let H_{n,p} denote the same graph with Bernoulli bond percolation with parameter p=n^-\alpha. It is shown that at \alpha=1/2 there is a phase transition for the metric distortion between H_n and…
We introduce a model for dynamic networks, where the links or the strengths of the links change over time. We solve the model by mapping dynamic networks to the problem of directed percolation, where the direction corresponds to the…
We performed molecular dynamics simulations to study relaxation phenomena during vapor-liquid transitions in a single component Lennard-Jones system. Results from two different overall densities are presented; one in the neighborhood of the…
Percolation in complex networks is viewed as both: a process that mimics network degradation and a tool that reveals peculiarities of the underlying network structure. During the course of percolation, networks undergo non-trivial…
We propose a bond-percolation model intended to describe the consumption, and eventual exhaustion, of resources in transport networks. Edges forming minimum-length paths connecting demanded origin-destination nodes are removed if below a…
We investigate the formation of an infinite cluster of entangled threads in a (2+1)-dimensional system. We demonstrate that topological percolation belongs to the universality class of the standard 2D bond percolation. We compute the…
We consider the Poisson Boolean percolation model in $\mathbb{R}^2$, where the radii of each ball is independently chosen according to some probability measure with finite second moment. For this model, we show that the two thresholds, for…
This paper presents a Monte-Carlo study of percolation in a distorted square lattice, in which, the adjacent sites are not equidistant. Starting with an undistorted lattice, the position of the lattice sites are shifted through a tunable…
\emph{Full-bond percolation} with parameter $p$ is the process in which, given a graph, for every edge independently, we delete the edge with probability $1-p$. Bond percolation is motivated by problems in mathematical physics and it is…
We consider the extinction time of the contact process on increasing sequences of finite graphs obtained from a variety of random graph models. Under the assumption that the infection rate is above the critical value for the process on the…
We consider the model of random interlacements on $\mathbb{Z}^d$ introduced in Sznitman [Vacant set of random interlacements and percolation (2007) preprint]. For this model, we prove the uniqueness of the infinite component of the vacant…
We study the phase transition of the three-dimensional complex |psi|^4 theory by considering the geometrically defined vortex-loop network as well as the magnetic properties of the system in the vicinity of the critical point. Using…
We study the behavior of scale-free networks, having connectivity distribution P(k) k^-a, close to the percolation threshold. We show that for networks with 3<a<4, known to undergo a transition at a finite threshold of dilution, the…
Biased (degree-dependent) percolation was recently shown to provide new strategies for turning robust networks fragile and vice versa. Here we present more detailed results for biased edge percolation on scale-free networks. We assume a…
Let $T$ be a regular rooted tree. For every natural number $n$, let $B_n$ be the finite subtree of vertices with graph distance at most $n$ from the root. Consider the following forest-fire model on $B_n$: Each vertex can be "vacant" or…