Given $ω\ge 1$, let $Z^2_{(ω)}$ be the graph with vertex set $Z^2$ in which two vertices are joined if they agree in one coordinate and differ by at most $ω$ in the other. (Thus $Z^2_{(1)}$ is precisely $Z^2$.) Let $p_c(ω)$ be the critical probability for site percolation in $Z^2_{(ω)}$. Extending recent results of Frieze, Kleinberg, Ravi and Debany, we show that $\lim_{ω\to\infty} ω\pc(ω)=\log(3/2)$. We also prove analogues of this result on the $n$-by-$n$ grid and in higher dimensions, the latter involving interesting connections to Gilbert's continuum percolation model. To prove our results, we explore the component of the origin in a certain non-standard way, and show that this exploration is well approximated by a certain branching random walk.
In this work, we study a new model for continuum line-of-sight percolation in a random environment driven by the Poisson-Voronoi tessellation in the $d$-dimensional Euclidean space. The edges (one-dimensional facets, or simply 1-facets) of this tessellation are the support of a Cox point process, while the vertices (zero-dimensional facets or simply 0-facets) are the support of a Bernoulli point process. Taking the superposition $Z$ of these two processes, two points of $Z$ are linked by an edge if and only if they are sufficiently close and located on the same edge (1-facet) of the supporting…
We study a new geometric bootstrap percolation model, line percolation, on the $d$-dimensional integer grid $[n]^d$. In line percolation with infection parameter $r$, infection spreads from a subset $A\subset [n]^d$ of initially infected lattice points as follows: if there exists an axis-parallel line $L$ with $r$ or more infected lattice points on it, then every lattice point of $[n]^d$ on $L$ gets infected, and we repeat this until the infection can no longer spread. The elements of the set $A$ are usually chosen independently, with some density $p$, and the main question is to determine $p_…
We consider Bernoulli bond percolation on the product graph of a regular tree and a line. We show that the triangle condition does not hold at the uniqueness threshold.
We prove the absence of percolation in a directed Poisson-based random geometric graph with out-degree $1$. This graph is an anisotropic variant of a line-segment based lilypond model obtained from an asymmetric growth protocol, which has been proposed by Daley and Last. In order to exclude backward percolation, one may proceed as in the lilypond model of growing disks and apply the mass-transport principle. Concerning the proof of the absence of forward percolation, we present a novel argument that is based on the method of sprinkling.
A new Berry-Esseen bound for non-linear functionals of non-symmetric and non-homogeneous infinite Rademacher sequences is established. It is based on a discrete version of the Malliavin-Stein method and an analysis of the discrete Ornstein-Uhlenbeck semigroup. The result is applied to sub-graph counts and to the number of vertices having a prescribed degree in the Erdős-Renyi random graph. A further application deals with a percolation problem on trees.
We consider vertex percolation on pseudo-random $d-$regular graphs. The previous study by the second author established the existence of phase transition from small components to a linear (in $\frac{n}{d}$) sized component, at $p=\frac{1}{d}$. In the supercritical regime, our main result recovers the sharp asymptotic of the size of the largest component, and shows that all other components are typically much smaller. Furthermore, we consider other typical properties of the largest component such as the number of edges, existence of a long cycle and expansion. In the subcritical regime, we stre…
We consider an interacting particle system on the lattice involving pushing and blocking interactions, called PushASEP, in the presence of a wall at the origin. We show that the invariant measure of this system is equal in distribution to a vector of point-to-line last passage percolation times in a random geometrically distributed environment. The largest co-ordinates in both of these vectors are equal in distribution to the all-time supremum of a non-colliding random walk.
It is well known that there are two regimes in a standard one-dimensional Boolean percolation model: either the entire space is covered a.s., or the covered volume fraction is strictly less than one. The aim of this work is to demonstrate that there is a third possibility in a Boolean model with totally asymmetric grains on a half-line: a.s. there is no unbounded component, but the covered volume fraction is one. An explicit condition is given characterizing the existence of an unbounded occupied component.
We prove a Russo-Seymour-Welsch percolation theorem for nodal domains and nodal lines associated to a natural infinite dimensional space of real analytic functions on the real plane. More precisely, let $U$ be a smooth connected bounded open set in $\mathbb R^2$ and $γ, γ'$ two disjoint arcs of positive length in the boundary of $U$. We prove that there exists a positive constant $c$, such that for any positive scale $s$, with probability at least $c$ there exists a connected component of $\{x\in \bar U, \, f(sx) \textgreater{} 0\} $ intersecting both $γ$ and $γ'$, where $f$ is a random analyt…
This paper proves an equality in law between the invariant measure of a reflected system of Brownian motions and a vector of point-to-line last passage percolation times in a discrete random environment. A consequence describes the distribution of the all-time supremum of Dyson Brownian motion with drift. A finite temperature version relates the point-to-line partition functions of two directed polymers, with an inverse-gamma and a Brownian environment, and generalises Dufresne's identity. Our proof introduces an interacting system of Brownian motions with an invariant measure given by a field…
Critical oriented percolation enhanced along random supercritical horizontal lines
Institut Polytechnique de Paris, Université Paris-Saclay, ENSAE Paris（巴黎理工学院，巴黎萨克雷大学，巴黎国立经济统计学院）；Instituto de Matemática, Universidade Federal do Rio de Janeiro（里约热内卢联邦大学数学研究所）
On the lattice $\widetilde{\mathbb Z}^2_+:={(x,y)\in \mathbb Z \times \mathbb Z_+\colon x+y \text{is even}}$ we consider the following oriented (northwest-northeast) site percolation: the lines $H_i:={(x,y)\in \widetilde {\mathbb Z}^2_+ \colon y=i}$ are first declared to be bad or good with probabilities $\de$ and $1-\de$ respectively, independently of each other. Given the configuration of lines, sites on good lines are open with probability $p_{_G}>p_c$, the critical probability for the standard oriented site percolation on $\mathbb Z_+ \times \mathbb Z_+$, and sites on bad lines are open wi…
The aim of this article is to study the forest composed by point-to-line geodesics in the last-passage percolation model with exponential weights. We will show that the location of the root can be described in terms of the maxima of a random walk, whose distribution will depend on the geometry of the substrate (line). For flat substrates, we will get power law behaviour of the height function, study its scaling limit, and describe it in terms of variational problems involving the Airy process.
We show that there exists a connected graph G with subexponential volume growth such that critical percolation on the product of G with the line has infinitely many infinite clusters. We also give some conditions under which this cannot occur.
We study critical percolation on a regular planar lattice. Let $E_G(n)$ be the expected number of open clusters intersecting or hitting the line segment $[0,n]$. (For the subscript $G$ we either take $\mathbb{H}$, when we restrict to the upper halfplane, or $\mathbb{C}$, when we consider the full lattice). Cardy (2001) (see also Yu, Saleur and Haas (2008)) derived heuristically that $E_{\mathbb{H}}(n) = An + \frac{\sqrt{3}}{4π}\log(n) + o(\log(n))$, where $A$ is some constant. Recently Kovács, Iglói and Cardy (2012) derived heuristically (as a special case of a more general formula) that a sim…
We consider directed last-passage percolation on the random graph G = (V,E) where V = Z and each edge (i,j), for i < j, is present in E independently with some probability 0 < p <= 1. To every present edge (i,j) we attach i.i.d. random weights v_{i,j} > 0. We are interested in the behaviour of w_{0,n}, which is the maximum weight of all directed paths from 0 to n, as n tends to infinity. We see two very different types of behaviour, depending on whether E[v_{i,j}^2] is finite or infinite. In the case where E[v_{i,j}^2] is finite we show that the process has a certain regenerative structure, an…
We introduce a percolation model on $\mathbb{Z}^d$, $d \geq 3$, in which the discrete lines of vertices that are parallel to the coordinate axis are entirely removed at random and independently of each other. In this way a vertex belongs to the vacant set $\mathcal{V}$ if and only if none of the $d$ lines to which it belongs, is removed. We show the existence of a phase transition for $\mathcal{V}$ as the probability of removing the lines is varied. We also establish that, in the certain region of parameters space where $\mathcal{V}$ contains an infinite component, the truncated connectivity f…
In this note we give a(nother) combinatorial proof of an old result of Baik--Rains: that for appropriately considered independent geometric weights, the generating series for last passage percolation polymers in a $2n \times n \times n$ quarter square (point-to-half-line-reflected geometry) splits as the product of two simpler generating series---that for last passage percolation polymers in a point-to-line geometry and that for last passage percolation in a point-to-point-reflected (half-space) geometry, the latter both in an $n \times n \times n$ triangle. As a corollary, for iid geometric r…
The existence (or not) of infinite clusters is explored for two stochastic models of intersecting line segments in $d \ge 2$ dimensions. Salient features of the phase diagram are established in each case. The models are based on site percolation on ${\mathbb Z}^d$ with parameter $p\in (0,1]$. For each occupied site $v$, and for each of the $2d$ possible coordinate directions, declare the entire line segment from $v$ to the next occupied site in the given direction to be either blue or not blue according to a given stochastic rule. In the one-choice model, each occupied site declares one of its…
We extend previous work of max-linear models on finite directed acyclic graphs to infinite graphs as well as random graphs, and investigate their relations to classical percolation theory, more particularly the impact of Bernoulli bond percolation on such models. We show that the critical probability of percolation on the oriented square lattice graph $\mathbb{Z}^2$ describes a phase transition in the obtained model. Focus is on the dependence introduced by this graph into the max-linear model. We discuss natural applications in communication networks, in particular, concerning the propagation…
We consider critical oriented Bernoulli percolation on the square lattice $\mathbb{Z}^2$. We prove a Russo-Seymour-Welsh type result which allows us to derive several new results concerning the critical behavior: - We establish that the probability that the origin is connected to distance $n$ decays polynomially fast in $n$. - We prove that the critical cluster of the origin conditioned to survive to distance $n$ has a typical width $w_n$ satisfying $εn^{2/5} < w_n < n^{1-ε}$ for some $ε> 0$. The sub-linear polynomial fluctuations contrast with the supercritical regime where $w_n$ is known to …
For a model of a driven interface in an elastic medium with random obstacles we prove existence of a stationary positive supersolution at non-vanishing driving force. This shows the emergence of a rate independent hysteresis through the interaction of the interface with the obstacles, despite a linear (force=velocity) microscopic kinetic relation. We also prove a percolation result, namely the possibility to embed the graph of an only logarithmically growing function in a next-nearest neighbor site-percolation cluster at a non-trivial percolation threshold.
We consider the Poisson Boolean model of continuum percolation on a homogeneous Riemannian manifold $M$. Let $lambda$ be intensity of the Poisson process in the model and let $lambda_u$ be the infimum of the set of intensities that a.s. produce a unique unbounded component. We show that above $λ_u$ there is a.s. a unique unbounded component. We also study what happens at $λ_u$ for some spaces. In particular, if $M$ is the product of the hyperbolic disc and the real line, then at $λ_u$ there is a.s. not a unique unbounded component. The results are inspired by results for Bernoulli bond percola…
Accessibility percolation is a new type of percolation problem inspired by evolutionary biology. To each vertex of a graph a random number is assigned and a path through the graph is called accessible if all numbers along the path are in ascending order. For the case when the random variables are independent and identically distributed, we derive an asymptotically exact expression for the probability that there is at least one accessible path from the root to the leaves in an $n$-tree. This probability tends to 1 (0) if the branching number is increased with the height of the tree faster (slow…
We study the following problem for critical site percolation on the triangular lattice. Let A and B be sites on a horizontal line e separated by distance n. Consider, in the half-plane above e, the lowest occupied crossing R from the half-line left of A to the half-line right of B. We show that the probability that R has a site at distance smaller than m from AB is of order (log (n/m))^{-1}, uniformly in 1 <= m < n/2. Much of our analysis can be carried out for other two-dimensional lattices as well.
The Airy line ensemble is a positive-integer indexed system of random continuous curves whose finite dimensional distributions are given by the multi-line Airy process. It is a natural object in the KPZ universality class: for example, its highest curve, the Airy$_2$ process, describes after the subtraction of a parabola the limiting law of the scaled energy of a geodesic running from the origin to a variable point on an anti-diagonal line in such problems as Poissonian last passage percolation. The ensemble of curves resulting from the Airy line ensemble after the subtraction of the same para…
In this paper we continue our earlier work about topological first passage percolation and answer certain questions asked in our previous paper. Notably, we prove that apart from trivialities, in the generic configuration there exists exactly one geodesic ray, in the sense that we consider two geodesic rays distinct if they only share a finite number of edges. Moreover, we show that in the generic configuration any not too small and not too large convex set arises as the limit of a sequence $\frac{B(t_n)}{t_n}$ for some $(t_n)\to\infty$. Finally, we define topological Hilbert first passage per…
We address the question of how a localized microscopic defect, especially if it is small with respect to certain dynamic parameters, affects the macroscopic behavior of a system. In particular we consider two classical exactly solvable models: Ulam's problem of the maximal increasing sequence and the totally asymmetric simple exclusion process. For the first model, using its representation as a Poissonian version of directed last passage percolation on $\mathbb R^2$, we introduce the defect by placing a positive density of extra points along the diagonal line. For the latter, the defect is pro…
