We consider a stationary face-to-face tessellation $X$ of $\mathbb{R}^d$ and introduce several percolation models by colouring some of the faces black in a consistent way. Our main model is cell percolation, where cells are declared black with probability $p$ and white otherwise. We are interested in geometric properties of the union $Z$ of black faces. Under natural integrability assumptions we first express asymptotic mean-values of intrinsic volumes in terms of Palm expectations associated with the faces. In the second part of the paper we study asymptotic covariances of intrinsic volumes of $Z\cap W$, where the observation window $W$ is assumed to be a polytope. Here we need to assume the existence of suitable asymptotic covariances of the face processes of $X$. We check these assumptions in the important special case of a Poisson Voronoi tessellation. In the case of cell percolation on a normal tessellation, especially in the plane, our formulae simplify considerably.
We correct a simple error in Percolation on random Johnson-Mehl tessellations and related models, Probability Theory and Related Fields 140 (2008), 417-468. (See also arXiv:math/0610716)
We make use of the recent proof that the critical probability for percolation on random Voronoi tessellations is 1/2 to prove the corresponding result for random Johnson-Mehl tessellations, as well as for two-dimensional slices of higher dimensional Voronoi tessellations. Surprisingly, the proof is a little simpler for these more complicated models.
We generalize the standard site percolation model on the $d$-dimensional lattice to a model on random tessellations of $\mathbb R^d$. We prove the uniqueness of the infinite cluster by adapting the Burton-Keane argument \cite{burton1989density}, develop two frameworks that imply the non-triviality of the phase transition and show that large classes of random tessellations fit into one of these frameworks. Our focus is on a very general approach that goes well beyond the typical Poisson driven models. The most interesting examples might be Voronoi tessellations induced by determinantal processe…
There are various models of first passage percolation (FPP) in $\mathbb R^d$. We want to start a very general study of this topic. To this end we generalize the first passage percolation model on the lattice $\mathbb Z^d$ to $\mathbb R^d$ and adapt the results of \cite{boivin1990first} to prove a shape theorem for ergodic random pseudometrics on $\mathbb R^d$. A natural application of this result will be the study of FPP on random tessellations where a fluid starts in the zero cell and takes a random time to pass through the boundary of a cell into a neighbouring cell. We find that a tame rand…
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 observe stationary random tessellations $X=\{Ξ_n\}_{n\ge1}$ in $\mathbb{R}^d$ through a convex sampling window $W$ that expands unboundedly and we determine the total $(k-1)$-volume of those $(k-1)$-dimensional manifold processes which are induced on the $k$-facets of $X$ ($1\le k\le d-1$) by their intersections with the $(d-1)$-facets of independent and identically distributed motion-invariant tessellations $X_n$ generated within each cell $Ξ_n$ of $X$. The cases of $X$ being either a Poisson hyperplane tessellation or a random tessellation with weak dependences are treated separately. In …
Position $n$ points uniformly at random in the unit square $S$, and consider the Voronoi tessellation of $S$ corresponding to the set $η$ of points. Toss a fair coin for each cell in the tessellation to determine whether to colour the cell red or blue. Let $H_S$ denote the event that there exists a red horizontal crossing of $S$ in the resulting colouring. In 1999, Benjamini, Kalai and Schramm conjectured that knowing the tessellation, but not the colouring, asymptotically gives no information as to whether the event $H_S$ will occur or not. More precisely, since $H_S$ occurs with probability …
A new and rather broad class of stationary (i.e. stochastically translation invariant) random tessellations of the $d$-dimensional Euclidean space is introduced, which are called shape-driven nested Markov tessellations. Locally, these tessellations are constructed by means of a spatio-temporal random recursive split dynamics governed by a family of Markovian split kernel, generalizing thereby the -- by now classical -- construction of iteration stable random tessellations. By providing an explicit global construction of the tessellations, it is shown that under suitable assumptions on the spl…
We study the weak convergence of $β$- and $β'$-Delaunay tessellations in $\mathbb{R}^{d-1}$ that were introduced in part I of this paper, as $β\to\infty$. The limiting stationary simplicial random tessellation, which is called the Gaussian-Delaunay tessellation, is characterized in terms of a space-time paraboloid hull process in $\mathbb{R}^{d-1}\times\mathbb{R}$. The latter object has previously appeared in the analysis of the number of shocks in the solution of the inviscid Burgers' equation and the description of the local asymptotic geometry of Gaussian random polytopes. In this paper it …
A new class of random spatial tessellations is introduced -- the so-called column tessellations of three-dimensional space. The construction is based on a stationary planar tessellation. Each cell of the spatial tessellation is a prism whose base facet is congruent to a cell of the planar tessellation. Thus intensities, topological and metric mean values of the spatial tessellation can be calculated by suitably chosen parameters of the planar tessellation. A column tessellation is not facet-to-facet.
In this paper two new classes of stationary random simplicial tessellations, the so-called $β$- and $β'$-Delaunay tessellations, are introduced. Their construction is based on a space-time paraboloid hull process and generalizes that of the classical Poisson-Delaunay tessellation. The distribution of volume-power weighted typical cells is explicitly identified, establishing thereby a remarkable connection to the classes of $β$- and $β'$-polytopes. These representations are used to determine principal characteristics of such cells, including volume moments, expected angle sums and cell intensit…
A planar stationary and isotropic STIT tessellation at time $t>0$ is observed in the window $W_ρ={t^{-1}}\sqrt{π\ ρ}\cdot [-\frac{1}{2},\frac{1}{2}]^2$, for $ρ>0$. With each cell of the tessellation, we associate the inradius, which is the radius of the largest disk contained in the cell. Using the Chen-Stein method, we compute the limit distributions of the largest order statistics for the inradii of all cells whose nuclei are contained in $W_ρ$ as $ρ$ goes to infinity.
Stationary Poisson processes of lines in the plane are studied whose directional distributions are concentrated on $k \ge 3$ equally spread directions. The random lines of such processes decompose the plane into a collection of random polygons, which form a so-called Poisson line tessellation. The focus of this paper is to determine the proportion of triangles in such tessellations, or equivalently, the probability that the typical cell is a triangle. As a by-product, a new deviation of Miles' classical result for the isotropic case is obtained by an approximation argument.
The point process of vertices of an iteration infinitely divisible or more specifically of an iteration stable random tessellation in the Euclidean plane is considered. We explicitly determine its covariance measure and its pair-correlation function as well as the cross-covariance measure and the cross-pair-correlation function of the vertex point process and the random length measure in general non-stationary regime, and we specialize it to the stationary and isotropic setting. Exact formulas are given for vertex count variances in compact and convex sampling windows and asymptotic relations …
We study a parametric class of isotropic but not necessarily stationary Poisson hyperplane tessellations in n-dimensional Euclidean space. Our focus is on the volume of the zero cell, i.e. the cell containing the origin. As a main result, we obtain an explicit formula for the variance of the volume of the zero cell in arbitrary dimensions. From this formula we deduce the asymptotic behaviour of the volume of the zero cell as the dimension goes to infinity.
We observe a realization of a stationary generalized weighted Voronoi tessellation of the d-dimensional Euclidean space within a bounded observation window. Given a geometric characteristic of the typical cell, we use the minus-sampling technique to construct an unbiased estimator of the average value of this geometric characteristic. Under mild conditions on the weights of the cells, we establish variance asymptotics and the asymptotic normality of the unbiased estimator as the observation window tends to the whole space. Moreover, the weak consistency is shown for this estimator.
Let $\mathfrak{m}$ be a random tessellation in $\mathbf{R}^d$ observed in a bounded Borel subset $W$ and $f(\cdot)$ be a measurable function defined on the set of convex bodies. To each cell $C$ of $\mathfrak{m}$ we associate a point $z(C)$ which is the nucleus of $C$. Applying $f(\cdot)$ to all the cells of $\mathfrak{m}$, we investigate the order statistics of $f(C)$ over all cells $C\in\mathfrak{m}$ with nucleus in $\mathbf{W}_ρ=ρ^{1/d}W$ when $ρ$ goes to infinity. Under a strong mixing property and a local condition on $\mathfrak{m}$ and $f(\cdot)$, we show a general theorem which reduces …
We consider percolation on the Voronoi tessellation generated by a homogeneous Poisson point process on the hyperbolic plane. We show that the critical probability for the existence of an infinite cluster is asymptotically equal to $πλ/3$ as $λ\to0.$ This answers a question of Benjamini and Schramm.
This paper deals with iteration stable (STIT) tessellations, and, more generally, with a certain class of tessellations that are infinitely divisible with respect to iteration. They form a new, rich and flexible class of spatio-temporal models considered in stochastic geometry. The martingale tools developed in \cite{STP1} are used to study second-order properties of STIT tessellations. Firstly, a general formula for the variance of the total surface area of cell boundaries inside a convex observation window is shown. This general expression is combined with tools from integral geometry to der…
We show that random walk on a stationary random graph with positive anchored expansion and exponential volume growth has positive speed. We also show that two families of random triangulations of the hyperbolic plane, the hyperbolic Poisson Voronoi tessellation and the hyperbolic Poisson Delaunay triangulation, have 1-skeletons with positive anchored expansion. As a consequence, we show that the simple random walks on these graphs have positive speed. We include a section of open problems and conjectures on the topics of stationary geometric random graphs and the hyperbolic Poisson Voronoi tes…
Since the seminal work of Mecke, Nagel and Weiss, the iteration stable (STIT) tessellations have attracted considerable interest in stochastic geometry as a natural and flexible yet analytically tractable model for hierarchical spatial cell-splitting and crack-formation processes. The purpose of this paper is to describe large scale asymptotic geometry of STIT tessellations in $\mathbb{R}^d$ and more generally that of non-stationary iteration infinitely divisible tessellations. We study several aspects of the typical first-order geometry of such tessellations resorting to martingale techniques…
We consider percolation on the Voronoi tessellation generated by a homogeneous Poisson point process on the hyperbolic plane. We show that the critical probability for the existence of an infinite cluster tends to $1/2$ as the intensity of the Poisson process tends to infinity. This confirms a conjecture of Benjamini and Schramm.
We consider planar stationary exponential Last Passage Percolation in the positive quadrant with boundary weights. For $ρ\in (0,1)$ and points $v_N=((1-ρ)^2 N,ρ^2 N)$ going to infinity along the characteristic direction, we establish right tail estimates with the optimal exponent for the exit time of the geodesic, along with optimal exponent estimates for the upper tail moderate deviations for the passage time. For the case $ρ=\frac{1}{2}$ in the stationary model, we establish the lower bound estimate with the optimal exponent for the lower tail of the passage time. Our arguments are based on …
Stationary and isotropic iteration stable random tessellations are considered, which can be constructed by a random process of cell division. The collection of maximal polytopes at a fixed time $t$ within a convex window $W\subset{\Bbb R}^d$ is regarded and formulas for mean values, variances, as well as a characterization of certain covariance measures are proved. The focus is on the case $d\geq 3$, which is different from the planar one, treated separately in \cite{ST2}. Moreover, a multivariate limit theorem for the vector of suitably rescaled intrinsic volumes is established, leading in ea…
We study first passage percolation (FPP) with stationary edge weights on Cayley graphs of finitely generated virtually nilpotent groups. Previous works of Benjamini-Tessera and Cantrell-Furman show that scaling limits of such FPP are given by Carnot-Carathéodory metrics on the associated graded nilpotent Lie group. We show a converse, i.e. that for any Cayley graph of a finitely generated nilpotent group, any Carnot-Carathéodory metric on the associated graded nilpotent Lie group is the scaling limit of some FPP with stationary edge weights on that graph. Moreover, for any Cayley graph of any …
The voter model on $\mathbb{Z}^d$ is a particle system that serves as a rough model for changes of opinions among social agents or, alternatively, competition between biological species occupying space. When $d \geq 3$, the set of (extremal) stationary distributions is a family of measures $μ_α$, for $α$ between 0 and 1. A configuration sampled from $μ_α$ is a strongly correlated field of 0's and 1's on $\mathbb{Z}^d$ in which the density of 1's is $α$. We consider such a configuration as a site percolation model on $\mathbb{Z}^d$. We prove that if $d \geq 5$, the probability of existence of a…
We consider undirected graphs that arise as deterministic functions of stationary point processes such that each point has degree bounded by two. For a large class of point processes and edge-drawing rules, we show that the arising graph has no infinite connected component, almost surely. In particular, this extends our previous result for SINR graphs based on stabilizing Cox point processes and verifies the conjecture of Balister and Bollobás that the bidirectional $k$-nearest neighbor graph of a two-dimensional homogeneous Poisson point process does not percolate for $k=2$.
We consider the typical cell of a stationary Poisson hyperplane tessellation in d-dimensional Euclidean space. It is well known that the expected vertex number of the typical cell is independent of the directional distribution of the hyperplane process. We give sharp bounds for the variance of this vertex number, showing, in particular, that the maximum of the variance is attained if and only if the distribution of the process is rotation invariant with respect to a suitable scalar product. The employed representation of the second moment of the vertex number is a special case of formulas prov…
We consider spatial stochastic models, which can be applied e.g. to telecommunication networks with two hierarchy levels. In particular, we consider two Cox processes concentrated on the edge set of a random tessellation, where the points can describe the locations of low-level and high-level network components, respectively, and the edge set the underlying infrastructure of the network, like road systems, railways, etc. Furthermore, each low-level component is marked with the shortest path along the edge set to the nearest high-level component. We investigate the typical shortest path length …
We study the directed last-passage percolation model on the planar integer lattice with nearest-neighbor steps and general i.i.d. weights on the vertices, outside the class of exactly solvable models. Stationary cocycles are constructed for this percolation model from queueing fixed points. These cocycles serve as boundary conditions for stationary last-passage percolation, define solutions to variational formulas that characterize limit shapes, and yield new results for Busemann functions, geodesics and the competition interface.
We study moderate deviations in the exponential corner growth model, both in the bulk setting and the increment-stationary setting. The main results are sharp right-tail bounds on the last-passage time and the exit point of the increment-stationary process. The arguments utilize calculations with the stationary version and a moment generating function identity due to E. Rains, for which we give a short probabilistic proof. As applications of the deviation bounds, we derive upper bounds on the speed of distributional convergence in the Busemann function and competition interface limits.
We study the directed last-passage percolation model on the planar square lattice with nearest-neighbor steps and general i.i.d. weights on the vertices, outside of the class of exactly solvable models. Stationary cocycles are constructed for this percolation model from queueing fixed points. These cocycles serve as boundary conditions for stationary last-passage percolation, solve variational formulas that characterize limit shapes, and yield existence of Busemann functions in directions where the shape has some regularity. In a sequel to this paper the cocycles will be used to prove results …
With any max-stable random process $η$ on $\mathcal{X}=\mathbb{Z}^d$ or $\mathbb{R}^d$, we associate a random tessellation of the parameter space $\mathcal{X}$. The construction relies on the Poisson point process representation of the max-stable process $η$ which is seen as the pointwise maximum of a random collection of functions $Φ=\{ϕ\_i, i\geq 1\}$. The tessellation is constructed as follows: two points $x,y\in \mathcal{X}$ are in the same cell if and only if there exists a function $ϕ\inΦ$ that realizes the maximum $η$ at both points $x$ and $y$, i.e. $ϕ(x)=η(x)$ and $ϕ(y)=η(y)$. We char…
We study percolation in the following random environment: let $Z$ be a Poisson process of constant intensity in the plane, and form the Voronoi tessellation of the plane with respect to $Z$. Colour each Voronoi cell black with probability $p$, independently of the other cells. We show that the critical probability is 1/2. More precisely, if $p>1/2$ then the union of the black cells contains an infinite component with probability 1, while if $p<1/2$ then the distribution of the size of the component of black cells containing a given point decays exponentially. These results are analogous to Kes…
We study the stationary distribution of the (spread-out) $d$-dimensional contact process from the point of view of site percolation. In this process, vertices of $\mathbb{Z}^d$ can be healthy (state 0) or infected (state 1). With rate one infected sites recover, and with rate $λ$ they transmit the infection to some other vertex chosen uniformly within a ball of radius $R$. The classical phase transition result for this process states that there is a critical value $λ_c(R)$ such that the process has a non-trivial stationary distribution if and only if $λ> λ_c(R)$. In configurations sampled from…
We study the signal-to-interference ratio (SINR) percolation model for a stationary Cox point process in two or higher dimensions, in case of a bounded and integrable path-loss function. We show that if this function has compact support or if the stationary intensity measure evaluated at a unit box has some exponential moments, then the SINR graph has an infinite connected component in case the spatial density of points is large enough and the interferences are sufficiently reduced (without vanishing). This holds under suitable stabilization and connectivity assumptions on the intensity measur…
We show non-existence of non-trivial bi-infinite geodesics in the solvable last-passage percolation model with i.i.d. geometric weights. This gives the first example of a model with discrete weights where non-existence of non-trivial bi-infinite geodesics has been proven. Our proofs rely on the structure of the increment-stationary versions of the model, following the approach recently introduced by Balázs, Busani, and Seppäläinen. Most of our results work for a general weights distribution and we identify the two properties of the stationary distributions which would need to be shown in order…
We determine the asymptotic speed of the first-passage percolation process on some ladder-like graphs (or width-2 stretches) when the times associated with different edges are independent and exponentially distributed but not necessarily all with the same mean. The method uses a particular Markov chain associated with the first-passage percolation process and properties of its stationary distribution.
Percolation on the stationary distributions of the voter model with stirring
Bernoulli Institute, University of Groningen（格罗宁根大学伯努利研究所）；Groningen Cognitive System and Materials Center, University of Groningen（格罗宁根大学认知系统与材料中心）；Institute of Mathematics, Statistics and Computer Science, University of São Paulo, Brazil（圣保罗大学数学、统计与计算机科学研究所）；CNRS and Sorbonne Université, Paris, France（法国国家科学研究中心与索邦大学）；Department of Statistics, University of Warwick（华威大学统计学系）
We consider a first-passage percolation model on a Delaunay triangulation of the plane. In this model each edge is independently equipped with a nonnegative random variable, with distribution function F, which is interpreted as the time it takes to traverse the edge. Vahidi-Asl and Wierman have shown that, under a suitable moment condition on F, the minimum time taken to reach a point x from the origin 0 is asymptotically μ(F)|x|, where μ(F) is a nonnegative finite constant. However the exact value of the time constant μ(F) still a fundamental problem in percolation theory. Here we prove that …
The zero cell of a parametric class of random hyperplane tessellations depending on a distance exponent and an intensity parameter is investigated, as the space dimension tends to infinity. The model includes the zero cell of stationary and isotropic Poisson hyperplane tessellations as well as the typical cell of a stationary Poisson Voronoi tessellation as special cases. It is shown that asymptotically in the space dimension, with overwhelming probability these cells satisfy the hyperplane conjecture, if the distance exponent and the intensity parameter are suitably chosen dimension-dependent…
For cell-division processes in a window, Cowan introduced four selection rules and two division rules each of which stands for one cell-division model. One of these is the area-weighted in-cell model. In this model, each cell is selected for division with a probability that corresponds to the ratio between its area and the area of the whole window. This selected cell is then divided by throwing a (uniformly distributed) point into the cell and drawing a line segment through the point under a random angle with the segment ending at the cell's boundary. For the STIT model which uses both a diffe…
Let $Z$ be the typical cell of a stationary Poisson hyperplane tessellation in $\mathbb{R}^d$. The distribution of the number of facets $f(Z)$ of the typical cell is investigated. It is shown, that under a well-spread condition on the directional distribution, the quantity $n^{\frac{2}{d-1}}\sqrt[n]{\mathbb{P}(f(Z)=n)}$ is bounded from above and from below. When $f(Z)$ is large, the isoperimetric ratio of $Z$ is bounded away from zero with high probability. These results rely on one hand on the Complementary Theorem which provides a precise decomposition of the distribution of $Z$ and on the o…
A generalized version of a well-known problem of D. G. Kendall states that the zero cell of a stationary Poisson hyperplane tessellation in ${\mathbb{R}}^d$, under the condition that it has large volume, approximates with high probability a certain definite shape, which is determined by the directional distribution of the underlying hyperplane process. This result is extended here to typical $k$-faces of the tessellation, for $k\in\{2,...,d-1\}$. This requires the additional condition that the direction of the face be in a sufficiently small neighbourhood of a given direction.
In this paper we study stationary last passage percolation (LPP) in half-space geometry. We determine the limiting distribution of the last passage time in a critical window close to the origin. The result is a new two-parameter family of distributions: one parameter for the strength of the diagonal bounding the half-space (strength of the source at the origin in the equivalent TASEP language) and the other for the distance of the point of observation from the origin. It should be compared with the one-parameter family giving the Baik--Rains distributions for full-space geometry. We finally sh…
Motivated by an application in wireless telecommunication networks, we consider a two-type continuum-percolation problem involving a homogeneous Poisson point process of users and a stationary and ergodic point process of base stations. Starting from a randomly chosen point of the Poisson point process, we investigate distribution of the minimum number of hops that are needed to reach some point of the second point process. In the supercritical regime of continuum percolation, we use the close relationship between Euclidean and chemical distance to identify the distributional limit of the resc…
We consider time correlation for KPZ growth in 1+1 dimensions in a neighborhood of a characteristics. We prove convergence of the covariance with droplet, flat and stationary initial profile. In particular, this provides a rigorous proof of the exact formula of the covariance for the stationary case obtained in [SIGMA 12 (2016), 074]. Furthermore, we prove the universality of the first order correction when the two observation times are close and provide a rigorous bound of the error term. This result holds also for random initial profiles which are not necessarily stationary.
Let f be a stationary isotropic non-degenerate Gaussian field on R^2. Assume that f = q * W where q is both C^2 and L^2 and W is the L^2 white noise on R^2. We extend a result by Stephen Muirhead and Hugo Vanneuville by showing that, assuming that q * q is pointwise non-negative and has fast enough decay, the set {f > -l} percolates with probability one when l > 0 and with probability zero if l < 0 or l = 0. We also prove exponential decay of crossing probabilities and uniqueness of the unbounded cluster. To this end, we study a Gaussian field g defined on the torus and establish a superconcen…
We use a Voronoi-type tessellation based on a compound Poisson point process to construct a polynomially mixing stationary random smooth planar vector field with bounded nonnegative components such that, with probability one, none of the associated integral curves possess an asymptotic direction.
