English
Related papers

Related papers: Extreme paths in oriented 2D Percolation

200 papers

We give the first properties of independent Bernoulli percolation, for oriented graphs on the set of vertices $\Z^d$ that are translation-invariant and may contain loops. We exhibit some examples showing that the critical probability for…

Probability · Mathematics 2021-06-09 Olivier Garet , Régine Marchand

We consider bond and site Bernoulli Percolation in both the oriented and the non-oriented cases on $\mathbb{Z}^d$ and obtain rigorous upper bounds for the critical points in those models for every dimension $d \geq 3$.

Probability · Mathematics 2026-03-17 Pablo A. Gomes , Alan Pereira , Remy Sanchis

Consider ordinary bond percolation on a finite or countably infinite graph. Let s, t, a and b be vertices. An earlier paper proved the (nonintuitive) result that, conditioned on the event that there is no open path from s to t, the two…

Probability · Mathematics 2007-05-23 Jacob van den Berg , Olle Haggstrom , Jeff Kahn

We present high statistics data on the distribution of shortest path lengths between two near-by points on the same cluster at the percolation threshold. Our data are based on a new and very efficient algorithm. For $d=2$ they clearly…

Statistical Mechanics · Physics 2009-10-31 P. Grassberger

We consider independent and $m$-dependent two-dimensional oriented site percolation with open-site density close to one started from Bernoulli product measures. We show that the probability of an occupied interval in the former process…

Probability · Mathematics 2020-11-24 Achillefs Tzioufas

We study the number $N\_n$ of open paths of length $n$ in supercritical oriented percolation on $\Zd \times \N$, with $d \ge 1$. We prove that on the percolation event $\{\inf N\_n\textgreater{}0\}$, $N\_n^{1/n}$ almost surely converges to…

Probability · Mathematics 2015-03-06 Olivier Garet , Jean-Baptiste Gouéré , Régine Marchand

We consider oriented long-range percolation on a graph with vertex set $\mathbb{Z}^d \times \mathbb{Z}_+$ and directed edges of the form $\langle (x,t), (x+y,t+1)\rangle$, for $x,y$ in $\mathbb{Z}^d$ and $t \in \mathbb{Z}_+$. Any edge of…

Probability · Mathematics 2017-11-22 Caio T. M. Alves , Marcelo Hilário , Bernardo N. B. de Lima , Daniel Valesin

A popular question in Bernoulli percolation models is if the probability of connection between two vertices in a transitive graph decays monotonically with the distance between these two vertices. For example, on the square lattice is an…

Probability · Mathematics 2026-01-05 Alberto M. Campos , Bernardo N. B. de Lima

We consider a directed variant of the negative-weight percolation model in a two-dimensional, periodic, square lattice. The problem exhibits edge weights which are taken from a distribution that allows for both positive and negative values.…

Disordered Systems and Neural Networks · Physics 2019-08-21 Christoph Norrenbrock , Mitchell M. Mkrtchian , Alexander K. Hartmann

We define the model of two-dimensional random interlacements using simple random walk trajectories conditioned on never hitting the origin, and then obtain some properties of this model. Also, for random walk on a large torus conditioned on…

Probability · Mathematics 2019-05-28 Francis Comets , Serguei Popov , Marina Vachkovskaia

We consider the geometry of random interlacements on the $d$-dimensional lattice. We use ideas from stochastic dimension theory developed in \cite{benjamini2004geometry} to prove the following: Given that two vertices $x,y$ belong to the…

Probability · Mathematics 2011-07-19 Eviatar B. Procaccia , Johan Tykesson

We consider inhomogeneous non-oriented Bernoulli bond percolation on $\mathbb{Z}^d$, where each edge has a parameter depending on its direction. We prove that, under certain conditions, if the sum of the parameters is strictly greater than…

Probability · Mathematics 2025-01-03 Pablo A. Gomes , Alan Pereira , Remy Sanchis

The problem of continuum percolation in dispersions of rods is reformulated in terms of weighted random geometric graphs. Nodes (or sites or vertices) in the graph represent spatial locations occupied by the centers of the rods. The…

Statistical Mechanics · Physics 2015-09-30 Avik P. Chatterjee , Claudio Grimaldi

Two vertices are said to be finitely connected if they belong to the same cluster and this cluster is finite. We derive sharp asymptotics for finite connection probabilities for supercritical Bernoulli bond percolation on Z^2.

Probability · Mathematics 2009-10-13 Massimo Campanino , Dmitry Ioffe , Oren Louidor

In this paper we present the proof of the convergence of the critical bond percolation exploration process on the square lattice to the trace of SLE$_{6}$. This is an important conjecture in mathematical physics and probability. The case of…

Probability · Mathematics 2015-03-19 Jonathan Tsai , S. C. P. Yam , Wang Zhou

We study a version of first passage percolation on $\mathbb{Z}^d$ where the random passage times on the edges are replaced by contact times represented by random closed sets on $\mathbb{R}$. Similarly to the contact process without…

Probability · Mathematics 2026-02-02 Benedikt Jahnel , Lukas Lüchtrath , Anh Duc Vu

The sequence of random probability measures $\nu_n$ that gives a path of length $n$, $\unsur{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…

Probability · Mathematics 2008-08-29 Philippe Carmona

We estimate locations of the regions of the percolation and of the non-percolation in the plane $(\lambda,\beta)$: the Poisson rate -- the inverse temperature, for interacted particle systems in finite dimension Euclidean spaces. Our…

Mathematical Physics · Physics 2015-05-13 E. Pechersky , A. Yambartsev

Previously, Sarkar and Sun have shown that for supercritical oriented percolation in dimension $1+1$, the set of rightmost infinite open paths converges to the Brownian web after proper centering and scaling. In this note, we show that a…

Probability · Mathematics 2019-10-25 Emmanuel Schertzer , Rongfeng Sun

We study the two most common types of percolation process on a sparse random graph with a given degree sequence. Namely, we examine first a bond percolation process where the edges of the graph are retained with probability p and afterwards…

Combinatorics · Mathematics 2007-05-23 Nikolaos Fountoulakis