English
Related papers

Related papers: Supercritical loop percolation on $\mathbb{Z}^d$ f…

200 papers

We consider long-range percolation, Ising model, and self-avoiding walk on $\mathbb{Z}^d$, with couplings decaying like $|x|^{-(d+\alpha)}$ where $0 < \alpha \le 2$, above the upper critical dimensions. In the spread-out setting where the…

Probability · Mathematics 2025-12-23 Yucheng Liu

We exploit a connection between distances in the infinite percolation cluster, when the parameter is close to one, and the discrete-time TASEP on $\mathbb{Z}$. This shows that when the parameter goes to one, large balls in the cluster are…

Probability · Mathematics 2013-05-02 Anne-Laure Basdevant , Nathanaël Enriquez , Lucas Gerin , Jean-Baptiste Gouéré

We consider $Z^d$, with d bigger or equal to three. We investigate the vacant set of random interlacements in the strongly percolative regime, the vacant set of the simple random walk, and the excursion set above a given level of the…

Probability · Mathematics 2019-07-08 Alain-Sol Sznitman

We study limit laws for simple random walks on supercritical long range percolation clusters on $\Z^d, d \geq 1$. For the long range percolation model, the probability that two vertices $x, y$ are connected behaves asymptotically as…

Probability · Mathematics 2010-01-28 Nicholas Crawford , Allan Sly

We consider Bernoulli first-passage percolation on the triangular lattice in which sites have 0 and 1 passage times with probability $p$ and $1-p$, respectively. For each $p\in(0,p_c)$, let $\mathcal {B}(p)$ be the limit shape in the…

Probability · Mathematics 2022-09-01 Chang-Long Yao

We introduce a model of random interlacements made of a countable collection of doubly infinite paths on Z^d, d bigger or equal to 3. A non-negative parameter u measures how many trajectories enter the picture. This model describes in the…

Probability · Mathematics 2010-06-08 Alain-Sol Sznitman

It is natural to expect that there are only three possible types of scaling limits for the collection of all percolation interfaces in the plane: (1) a trivial one, consisting of no curves at all, (2) a critical one, in which all points of…

Probability · Mathematics 2010-02-10 Federico Camia , Matthijs Joosten , Ronald Meester

The state space of our model is the Euclidean space in dimension d = 2. Simultaneously, from all points of a homogeneous Poisson point process, we let grow independent and identically distributed random continuum paths. Each path stops…

Probability · Mathematics 2024-09-25 David Coupier , David Dereudre , Jean-Baptiste Gouéré

The vacant set of random interlacements on ${\mathbb{Z}}^d$, $d\ge3$, has nontrivial percolative properties. It is known from Sznitman [Ann. Math. 171 (2010) 2039--2087], Sidoravicius and Sznitman [Comm. Pure Appl. Math. 62 (2009) 831--858]…

Probability · Mathematics 2010-12-08 Alain-Sol Sznitman

We prove the sharpness of the phase transition for speed in the biased random walk on the supercritical percolation cluster on Z^d. That is, for each d at least 2, and for any supercritical parameter p > p_c, we prove the existence of a…

Probability · Mathematics 2013-10-18 Alexander Fribergh , Alan Hammond

We study percolation properties of the upper invariant measure of the contact process on $\mathbb{Z}^d$. Our main result is a sharp percolation phase transition with exponentially small clusters throughout the subcritical regime and a…

Probability · Mathematics 2020-08-05 Thomas Beekenkamp

In this article, we analyse the $\varphi^4$ model on $\mathbb Z^d$ in the supercritical regime $\beta > \beta_c$. We consider a random cluster representation of the $\varphi^4$ model, which corresponds to an Ising random cluster model on a…

Probability · Mathematics 2025-06-02 Trishen S. Gunaratnam , Christoforos Panagiotis , Romain Panis , Franco Severo

We consider loop ensembles on random trees. The loops are induced by a Poisson process of links sampled on the underlying tree interpreted as a metric graph. We allow two types of links, crosses and double bars. The crosses-only case…

Probability · Mathematics 2025-03-06 Andreas Klippel , Benjamin Lees , Christian Mönch

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

Substantial progress has been made in recent years on the 2D critical percolation scaling limit and its conformal invariance properties. In particular, chordal SLE6 (the Stochastic Loewner Evolution with parameter k=6) was, in the work of…

Probability · Mathematics 2009-11-10 Federico Camia , Charles M. Newman

We study the percolation of strongly connected clusters (SCCs), in which sites are mutually reachable through directed paths, in systems with randomly oriented bonds by extensive simulations on hypercubic lattices from dimension $d=2$ to…

Statistical Mechanics · Physics 2026-05-19 Qi Wang , Ming Li

We introduce and study a model of percolation with constant freezing (PCF) where edges open at constant rate 1, and clusters freeze at rate \alpha independently of their size. Our main result is that the infinite volume process can be…

Probability · Mathematics 2014-11-26 Edward Mottram

We solve the O(n) model, defined in terms of self- and mutually avoiding loops coexisting with voids, on a 3-simplex fractal lattice, using an exact real space renormalization group technique. As the density of voids is decreased, the model…

Statistical Mechanics · Physics 2008-10-24 Dibyendu Das , Supravat Dey , Jesper Lykke Jacobsen , Deepak Dhar

We consider a random connection model (RCM) $\xi$ driven by a Poisson process $\eta$. We derive exponential moment bounds for an arbitrary cluster, provided that the intensity $t$ of $\eta$ is below a certain critical intensity $t_T$. The…

Probability · Mathematics 2026-02-05 Mikhail Chebunin , Günter Last

By means of numerical simulations we investigate the geometric properties of loops on hypercubic lattice graphs in dimensions d=2 through 7, where edge weights are drawn from a distribution that allows for positive and negative weights. We…

Disordered Systems and Neural Networks · Physics 2013-05-29 O. Melchert , L. Apolo , A. K. Hartmann