Related papers: Percolation on the product graph of a regular tree…

We report on a possible crossover of a non universal quantity at the upper critical dimensionality in the field of percolation. Plotting recent estimates for site percolation thresholds of hypercubes in dimension 6< d< 13 against…

Recently, Scullard and Ziff noticed that a broad class of planar percolation models are self-dual under a simple condition that, in a parametrized version of such a model, reduces to a single equation. They state that the solution of the…

We consider bond percolation on random graphs with given degrees and bounded average degree. In particular, we consider the order of the largest component after the random deletion of the edges of such a random graph. We give a rough…

We prove that for Bernoulli percolation on a graph $\mathbb{Z}^2\times\{0,\dots,k\}$ ($k\ge 0$), there is no infinite cluster at criticality, almost surely. The proof extends to finite range Bernoulli percolation models on $\mathbb{Z}^2$…

We study bond percolation on the simple cubic (SC) lattice with various combinations of first, second, third, and fourth nearest-neighbors by Monte Carlo simulation. Using a single-cluster growth algorithm, we find precise values of the…

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 study oriented percolation on random causal triangulations, those are random planar graphs obtained roughly speaking by adding horizontal connections between vertices of an infinite tree. When the underlying tree is a geometric…

The main goal of this paper is to answer question 1.10 and settle conjecture 1.11 of Benjamini-Lyons-Schramm [BLS99] relating harmonic Dirichlet functions on a graph to those of the infinite clusters in the uniqueness phase of Bernoulli…

Graph pebbling considers the problem of transforming configurations of discrete pebbles to certain target configurations on the vertices of a graph, using the so-called pebbling move. This paper provides counterexamples to a monotonicity…

We present a study of site and bond percolation on periodic lattices with 3 nearest neighbors per site. We have considered 3 lattices, with different symmetries, different underlying Bravais lattices, and different degrees of longer-range…

We study percolation on nonamenable groups at the uniqueness threshold $p_u$, the critical value that separates the phase in which there are infinitely many infinite clusters from the phase in which there is a unique infinite cluster. The…

Let $G$ be a connected, locally finite, transitive graph, and consider Bernoulli bond percolation on $G$. We prove that if $G$ is nonamenable and $p > p_c(G)$ then there exists a positive constant $c_p$ such that \[\mathbf{P}_p(n \leq |K| <…

Disagreement percolation connects a Gibbs lattice gas and i.i.d. site percolation on the same lattice such that non-percolation implies uniqueness of the Gibbs measure. This work generalises disagreement percolation to the hard-sphere model…

We consider Bernoulli bond percolation on the product graph of a regular tree and a line. Schonmann showed that there are a.s. infinitely many infinite clusters at $p=p_u$ by using a certain function $\alpha(p)$. The function $\alpha(p)$ is…

In this note we consider site percolation on a two dimensional sandwich of thickness two, the graph Z^2 x {0,1}. We prove that there is no percolation at the critical point. The same arguments are valid for a sandwich of thickness three…

We investigate percolation on a randomly directed lattice, an intermediate between standard percolation and directed percolation, focusing on the isotropic case in which bonds on opposite directions occur with the same probability. We…

In this note, we investigate Bernoulli oriented bond percolation with parameter $p$ on $\mathbb{Z}^2$. In addition to the standard edges, which are open with probability $p$, we introduce diagonal edges each open with probability…

We consider a geometric percolation process partially motivated by recent work of Hejda and Kala. Specifically, we start with an initial set $X \subseteq \mathbb{Z}^2$, and then iteratively check whether there exists a triangle $T \subseteq…

We give a new derivation of mean-field percolation critical behaviour from the triangle condition that is quantitatively much better than previous proofs when the triangle diagram $\nabla_{p_c}$ is large. In contrast to earlier methods, our…

We study the problem of computing the tightest upper and lower bounds on the probability that the sum of $n$ dependent Bernoulli random variables exceeds an integer $k$. Under knowledge of all pairs of bivariate distributions denoted by a…