Related papers: Bernoulli line percolation
We consider the (unoriented) long-range percolation on Z^d in dimensions d\ge1, where distinct sites x,y\in Z^d get connected with probability p_{xy}\in[0,1]. Assuming p_{xy}=|x-y|^{-s+o(1)} as |x-y|\to\infty, where s>0 and |\cdot| is a…
Transition out of a topological phase is typically characterized by discontinuous changes in topological invariants along with bulk gap closings. However, as a clean system is geometrically punctured, it is natural to ask the fate of an…
In this paper, we study a model of long-range site percolation on graphs of bounded degree, namely the Boolean percolation model. In this model, each vertex of an infinite connected graph is the center of a ball of random radius, and…
The Constrained-degree percolation model was introduced in [B.N.B. de Lima, R. Sanchis, D.C. dos Santos, V. Sidoravicius, and R. Teodoro, Stoch. Process. Appl. (2020)], where it was proven that this model has a non-trivial phase transition…
We study bond percolation in $\mathbb{Z}^d$ with an unbounded family of enhancements that enable additional bonds to act as open. A natural question is whether percolation occurs in this model if and only if percolation also occurs in the…
Let a random geometric graph be defined in the supercritical regime for the existence of a unique infinite connected component in Euclidean space. Consider the first-passage percolation model with independent and identically distributed…
We prove that for Voronoi percolation on $\mathbb{R}^d$, there exists $p_c\in[0,1]$ such that - for $p<p_c$, there exists $c_p>0$ such that $\mathbb{P}_p[0\text{ connected to distance }n]\leq \exp(-c_p n)$, - there exists $c>0$ such that…
We investigate the following vertex percolation process. Starting with a random regular graph of constant degree, delete each vertex independently with probability p, where p=n^{-alpha} and alpha=alpha(n) is bounded away from 0. We show…
In the Constrained-degree percolation model on a graph $(\mathbb{V},\mathbb{E})$ there are a sequence, $(U_e)_{e\in\mathbb{E}}$, of i.i.d. random variables with distribution $U[0,1]$ and a positive integer $k$. Each bond $e$ tries to open…
Percolation theory is extensively studied in statistical physics and mathematics with applications in diverse fields. However, the research is focused on systems with only one type of links, connectivity links. We review a recently…
We study Bernoulli bond percolation on nonunimodular quasi-transitive graphs, and more generally graphs whose automorphism group has a nonunimodular quasi-transitive subgroup. We prove that percolation on any such graph has a non-empty…
Let us consider subcritical Bernoulli percolation on a connected, transitive, infinite and locally finite graph. In this paper, we propose a new (and short) proof of the exponential decay property for the volume of clusters. We do not rely…
We examine quantum percolation on a square lattice with random dilution up to $q=38%$ and energy $0.001 \le E \le 1.6$ (measured in units of the hopping matrix element), using numerical calculations of the transmission coefficient at a much…
The random interlacements (at level u) is a one parameter family of random subsets of Z^d introduced by Sznitman in arXiv:0704.2560. The vacant set at level u is the complement of the random interlacement at level u. In this paper, we study…
In this paper we establish some properties of percolation for the vacant set of random interlacements, for d at least 5 and small intensity u. The model of random interlacements was first introduced by A.S. Sznitman in arXiv:0704.2560. It…
In this note we discuss vacant set level set percolation on a transient weighted graph. It interpolates between the percolation of the vacant set of random interlacements and the level set percolation of the Gaussian free field. We employ…
We introduce a bond percolation procedure on a $D$-dimensional lattice where two neighbouring sites are connected by $N$ channels, each operated by valves at both ends. Out of a total of $N$, randomly chosen $n$ valves are open at every…
False-vacuum eternal inflation can be described as a random walk on the network of vacua of the string landscape. In this paper we show that the problem can be mapped naturally to a problem of directed percolation. The mapping relies on two…
On a locally finite, infinite tree $T$, let $p_c(T)$ denote the critical probability for Bernoulli percolation. We prove that every positively associated, finite-range dependent percolation model on $T$ with marginals $p > p_c(T)$ must…
Robustness of two coupled networks system has been studied only for dependency coupling (S. Buldyrev et. al., Nature, 2010) and only for connectivity coupling (E. A. Leicht and R. M. D'Souza, arxiv:09070894). Here we study, using a…