English
Related papers

Related papers: Oriented Percolation in One-Dimensional 1/|x-y|^2 …

200 papers

We present a coupled decreasing sequence of random walks on $ \mathbb Z $ that dominates the edge process of oriented-bond percolation in two dimensions. Using the concept of "random walk in a strip ", we construct an algorithm that…

Probability · Mathematics 2007-05-23 Thomas Logan Ritchie , Vladimir Belitsky

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

In Catalan percolation, all nearest-neighbor edges $\{i,i+1\}$ along $\mathbb Z$ are initially occupied, and all other edges are open independently with probability $p$. Open edges $\{i,j\}$ are occupied if some pair of edges $\{i,k\}$ and…

We introduce and study a new percolation model, inspired by recent works on jigsaw percolation, graph bootstrap percolation, and percolation in polluted environments. Start with an oriented graph $G_0$ of initially occupied edges on $n$…

Probability · Mathematics 2025-11-18 Janko Gravner , Brett Kolesnik

Let $0<a<b<\infty$, and for each edge $e$ of $Z^d$ let $\omega_e=a$ or $\omega_e=b$, each with probability 1/2, independently. This induces a random metric $\dist_\omega$ on the vertices of $Z^d$, called first passage percolation. We prove…

Probability · Mathematics 2008-11-26 Itai Benjamini , Gil Kalai , Oded Schramm

Percolation with edge-passage probability p and first-passage percolation are studied for the n-cube B_n ={0,1}^n with nearest neighbor edges. For oriented and unoriented percolation, p=e/n and p=1/n are the respective critical…

Probability · Mathematics 2007-05-23 James Allen Fill , Robin Pemantle

This note was motivated by natural questions related to oriented percolation on a layered environment that introduces long range dependence. As a convenient tool, we are led to deal with questions on the strict decrease of the percolation…

Probability · Mathematics 2024-06-26 Bernardo N. B. de Lima , Daniel Ungaretti , Maria Eulália Vares

A model named `Colored Percolation' has been introduced with its infinite number of versions in two dimensions. The sites of a regular lattice are randomly occupied with probability $p$ and are then colored by one of the $n$ distinct colors…

Statistical Mechanics · Physics 2017-09-13 Sumanta Kundu , S. S. Manna

We consider different problems within the general theme of long-range percolation on oriented graphs. Our aim is to settle the so-called truncation question, described as follows. We are given probabilities that certain long-range oriented…

Probability · Mathematics 2016-06-22 Aernout C. D. van Enter , Bernardo N. B. de Lima , Daniel Valesin

We introduce and study derivatives in first-passage percolation with edge weights given by i.i.d. random variables supported on ${a,b}$. We show that the variance of the passage time can be expressed in terms of these derivatives. We…

Probability · Mathematics 2026-05-14 Ivan Matic , Rados Radoicic , Dan Stefanica

We consider the Constrained-degree percolation model in random environment on the square lattice. In this model, each vertex $v$ has an independent random constraint ${\kappa}_v$ which takes the value $j\in \{0,1,2,3\}$ with probability…

Probability · Mathematics 2021-11-02 Rémy Sanchis , Diogo C. dos Santos , Roger W. C. Silva

We consider a four-vertex model introduced by B\'{a}lint T\'{o}th: a dependent bond percolation model on $\mathbb{Z}^2$ in which every edge is present with probability 1/2 and each vertex has exactly two incident edges, perpendicular to…

Probability · Mathematics 2009-09-29 Gábor Pete

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

We give a geometrically exact treatment of percolation through voids around assemblies of randomly placed impermeable barrier particles, introducing a computationally inexpensive approach to finding critical barrier density thresholds…

Statistical Mechanics · Physics 2018-01-01 Donald Priour , Nicholas McGuigan

We study the independent alignment percolation model on $\mathbb{Z}^d$ introduced by Beaton, Grimmett and Holmes [arXiv:1908.07203]. It is a model for random intersecting line segments defined as follows. First the sites of $\mathbb{Z}^d$…

Probability · Mathematics 2026-02-02 Marcelo Hilário , Daniel Ungaretti

Eulerian percolation on Z 2 with parameter p is the classical Bernoulli bond percolation with parameter p conditioned on the fact that every site has an even degree. We first explain why Eulerian percolation with parameter p coincides with…

Probability · Mathematics 2021-09-10 Olivier Garet , Regine Marchand , Irène Marcovici

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…

Probability · Mathematics 2026-03-03 Célio Terra

Consider an independent site percolation model with parameter $p \in (0,1)$ on $\Z^d,\ d\geq 2$ where there are only nearest neighbor bonds and long range bonds of length $k$ parallel to each coordinate axis. We show that the percolation…

Probability · Mathematics 2011-05-24 Bernardo N. B. de Lima , Rémy Sanchis , Roger W. C. Silva

We have generalized the idea of backbend in a nearest-neighbor oriented bond percolation process by considering a backbend sequence $\beta : \mathbb{Z}_+ \to \mathbb{Z}_+ \cup \{\infty\}$, and defining a $\beta$-backbend path from the…

Probability · Mathematics 2021-08-24 Pinaki Mandal , Souvik Roy

We investigate the percolation properties of a planar reinforced network model. In this model, at every time step, every vertex chooses $k \ge 1$ incident edges, whose weight is then increased by 1. The choice of this $k$-tuple occurs…

Probability · Mathematics 2024-07-18 Gideon Amir , Markus Heydenreich , Christian Hirsch