English
Related papers

Related papers: Annulus crossing formulae for critical planar perc…

200 papers

We consider Bernoulli (bond) percolation with parameter $p$ on the Cayley tree of order $k$. We introduce the notion of zebra-percolation that is percolation by paths of alternating open and closed edges. In contrast with standard…

Probability · Mathematics 2013-01-08 D. Gandolfo , U. A. Rozikov , J. Ruiz

We consider a critical Bernoulli site percolation on the uniform infinite planar triangulation. We study the tail distributions of the peeling time, perimeter, and volume of the hull of a critical cluster. The exponents obtained here…

Probability · Mathematics 2017-01-09 Matthias Gorny , Édouard Maurel-Segala , Arvind Singh

This paper determines values of intersection exponents between packs of planar Brownian motions in the half-plane and in the plane that were not derived in our first two papers. For instance, it is proven that the exponent $\xi (3,3)$…

Probability · Mathematics 2015-06-26 Gregory F. Lawler , Oded Schramm , Wendelin Werner

Kenyon, Miller, Sheffield, and Wilson (2015) showed how to encode a random bipolar-oriented planar map by means of a random walk with a certain step size distribution. Using this encoding together with the mating-of-trees construction of…

Probability · Mathematics 2025-11-07 Ewain Gwynne , Nina Holden , Xin Sun

We consider the Constrained-degree percolation model on the hypercubic lattice, $\mathbb L^d=(\mathbb Z^d,\mathbb E^d)$ for $d\geq 3$. It is a continuous time percolation model defined by a sequence, $(U_e)_{e\in\mathbb E^d}$, of i.i.d.…

Probability · Mathematics 2023-01-03 Ivailo Hartarsky , Bernardo N. B. de Lima

We consider percolation on the discrete torus $\mathbb{Z}_n^d$ at $p_c(\mathbb{Z}^d)$, the critical value for percolation on the corresponding infinite lattice $\mathbb{Z}^d$, and within the scaling window around it. We assume that $d$ is a…

Probability · Mathematics 2025-12-23 Arthur Blanc-Renaudie , Asaf Nachmias

Consider Bernoulli(1/2) percolation on $\Z^d$, and define a perfect matching between open and closed vertices in a way that is a deterministic equivariant function of the configuration. We want to find such matching rules that make the…

Probability · Mathematics 2009-09-08 Adam Timar

We study Bernoulli first-passage percolation (FPP) on the triangular lattice $\mathbb{T}$ in which sites have 0 and 1 passage times with probability $p$ and $1-p$, respectively. Denote by $\mathcal {C}_{\infty}$ the infinite cluster with…

Probability · Mathematics 2018-12-20 Chang-Long Yao

By a combination of variational and topological techniques in the presence of invariant cones, we detect a new type of positive axially symmetric solutions of the Dirichlet problem for the elliptic equation $$ -\Delta u + u = a(x)|u|^{p-2}u…

Analysis of PDEs · Mathematics 2023-05-15 Alberto Boscaggin , Francesca Colasuonno , Benedetta Noris , Tobias Weth

We prove that any distributional limit of finite planar graphs in which the degree of the root has an exponential tail is almost surely recurrent. As a corollary, we obtain that the uniform infinite planar triangulation and quadrangulation…

Probability · Mathematics 2012-06-05 Ori Gurel-Gurevich , Asaf Nachmias

Let $ \mathbb{L}^{d} = ( \mathbb{Z}^{d},\mathbb{E}^{d} ) $ be the $ d $-dimensional hypercubic lattice. We consider a model of inhomogeneous Bernoulli percolation on $ \mathbb{L}^{d} $ in which every edge inside the $ s $-dimensional…

Probability · Mathematics 2021-07-22 Bernardo N. B. de Lima , Sébastien Martineau , Humberto C. Sanna , Daniel Valesin

Corner percolation is a dependent bond percolation model on Z^2 introduced by B\'alint T\'oth, in which each vertex has exactly two incident edges, perpendicular to each other. G\'abor Pete has proven in 2008 that under the maximal entropy…

Probability · Mathematics 2022-12-09 Régine Marchand , Irène Marcovici , Pierrick Siest

We show that the laws of scaling limits of nearcritical percolation exploration paths with different parameters are singular with respect to each other. This generalises a result of Nolin and Werner, using a similar technique. As a…

Probability · Mathematics 2014-05-08 Simon Aumann

We consider Bernoulli percolation on transitive graphs of polynomial growth. In the subcritical regime ($p<p_c$), it is well known that the connection probabilities decay exponentially fast. In the present paper, we study the supercritical…

Probability · Mathematics 2023-05-17 Daniel Contreras , Sébastien Martineau , Vincent Tassion

Let $G=(V,E)$ be a connected, locally finite, transitive graph, and consider Bernoulli bond percolation on $G$. In recent work, we conjectured that if $G$ is nonamenable then the matrix of critical connection probabilities…

Probability · Mathematics 2020-09-24 Tom Hutchcroft

We compute the crossover exponents of all quadratic and cubic deformations of critical field theories with permutation symmetry $S_q$ in $d=6-\epsilon$ (Landau-Potts field theories) and $d=4-\epsilon$ (hypertetrahedral models) up to three…

Statistical Mechanics · Physics 2020-12-30 Mahmoud Safari , Gian Paolo Vacca , Omar Zanusso

We consider two-dimensional critical bond percolation. Conditioned on the existence of an open circuit in an annulus, we show that the ratio of the expected size of the shortest open circuit to the expected size of the innermost circuit…

Probability · Mathematics 2015-06-12 Michael Damron , Jack Hanson , Philippe Sosoe

We study an interacting particle system in which moving particles activate dormant particles linked by the components of critical bond percolation. Addressing a conjecture from Beckman, Dinan, Durrett, Huo, and Junge for a continuous…

Probability · Mathematics 2020-08-26 Matthew Junge

Hyperbolic structures are obtained by tiling a hyperbolic surface with negative Gaussian curvature. These structures generally exhibit two percolation transitions: a system-wide connection can be established at a certain occupation…

Statistical Mechanics · Physics 2012-05-23 Seung Ki Baek

A construction as a growth process for sampling of the uniform infinite planar triangulation (UIPT), defined in a previous paper, is given. The construction is algorithmic in nature, and is an efficient method of sampling a portion of the…

Probability · Mathematics 2007-05-23 Omer Angel