### A note on percolation on ${\mathbb{Z}}^{d}$: isoperimetric profile via exponential cluster repulsion.

Skip to main content (access key 's'),
Skip to navigation (access key 'n'),
Accessibility information (access key '0')

The aim of this paper is to extend the well-known asymptotic shape result for first-passage percolation on ${\mathbb{Z}}^{d}$ to first-passage percolation on a random environment given by the infinite cluster of a supercritical Bernoulli percolation model. We prove the convergence of the renormalized set of wet vertices to a deterministic shape that does not depend on the realization of the infinite cluster. As a special case of our result, we obtain an asymptotic shape theorem for the chemical distance in supercritical...

I consider p-Bernoulli bond percolation on transitive, nonamenable, planar graphs with one end and on their duals. It is known from [BS01] that in such a graph G we have three essential phases of percolation, i.e. $0<{p}_{c}\left(G\right)<{p}_{u}\left(G\right)<1$, where ${p}_{c}$ is the critical probability and ${p}_{u}$-the unification probability. I prove that in the middle phase a.s. all the ends of all the infinite clusters have one-point boundaries in ∂ℍ². This result is similar to some results in [Lal].

A competition model on ${\mathbb{N}}^{2}$ between three clusters and governed by directed last passage percolation is considered. We prove that coexistence, i.e. the three clusters are simultaneously unbounded, occurs with probability $6-8log2$. When this happens, we also prove that the central cluster almost surely has a positive density on ${\mathbb{N}}^{2}$. Our results rely on three couplings, allowing to link the competition interfaces (which represent the borderlines between the clusters) to some particles in the multi-TASEP, and...

In the past years, many properties of the largest connected components of critical percolation on the high-dimensional torus, such as their sizes and diameter, have been established. The order of magnitude of these quantities equals the one for percolation on the complete graph or Erdős–Rényi random graph, raising the question whether the scaling limits of the largest connected components, as identified by Aldous (1997), are also equal. In this paper, we investigate the cycle structureof the largest...

The sequence of random probability measures νn that gives a path of length n, $\frac{1}{n}$ times the sum of the random weights collected along the paths, is shown to satisfy a large deviations principle with good rate function the Legendre transform of the free energy of the associated directed polymer in a random environment. Consequences on the asymptotics of the typical number of paths whose collected weight is above a fixed proportion are then drawn.

In dynamical percolation, the status of every bond is refreshed according to an independent Poisson clock. For graphs which do not percolate at criticality, the dynamical sensitivity of this property was analyzed extensively in the last decade. Here we focus on graphs which percolate at criticality, and investigate the dynamical sensitivity of the infinite cluster. We first give two examples of bounded degree graphs, one which percolates for all times at criticality and one which has exceptional...

We prove several facts concerning Lipschitz percolation, including the following. The critical probability pL for the existence of an open Lipschitz surface in site percolation on ℤd with d ≥ 2 satisfies the improved bound pL ≤ 1 − 1/[8(d − 1)]. Whenever p > pL, the height of the lowest Lipschitz surface above the origin has an exponentially decaying tail. For p sufficiently close to 1, the connected regions of ℤd−1 above which the surface has height 2 or more exhibit stretched-exponential...