We prove several facts concerning Lipschitz percolation, including the following. The critical probability p_L for the existence of an open Lipschitz surface in site percolation on Z^d with d\ge 2 satisfies the improved bound p_L \le 1-1/[8(d-1)]. Whenever p > p_L, the height of the lowest Lipschitz surface above the origin has an exponentially decaying tail. The lowest surface is dominated stochastically by the boundary of a union of certain independent, identically distributed random subsets of Z^d. As a consequence, for p sufficiently close to 1, the connected regions of Z^{d-1} above which the surface has height 2 or more exhibit stretched-exponential tail behaviour.
We prove the existence of a (random) Lipschitz function $F : \Z^{d-1}\to\Z^+$ such that, for every $x \in \Z^{d-1}$, the site $(x,F(x))$ is open in a site percolation process on $\Z^{d}$. The Lipschitz constant may be taken to be 1 when the parameter $p$ of the percolation model is sufficiently close to 1.
We consider Lipschitz percolation in $d+1$ dimensions above planes tilted by an angle $γ$ along one or several coordinate axes. In particular, we are interested in the asymptotics of the critical probability as $d \to \infty$ as well as $γ\to π/4.$ Our principal results show that the convergence of the critical probability to 1 is polynomial as $d\to \infty$ and $γ\to π/4.$ In addition, we identify the correct order of this polynomial convergence and in $d=1$ we also obtain the correct prefactor.
We consider an i.i.d. supercritical bond percolation on $\mathbb{Z}^d$, every edge is open with a probability $p > p_c (d)$, where $p_c (d)$ denotes the critical parameter for this percolation. We know that there exists almost surely a unique infinite open cluster $C_p$ [7]. We are interested in the regularity properties in p of the anchored isoperimetric profile of the infinite cluster $C_p$. For $d\ge2$, we prove that the anchored isoperimetric profile defined in [4] is Lipschitz continuous on all intervals $[p_0 , p_1 ] \subset (p_c (d), 1)$.
We consider the standard model of i.i.d. first passage percolation on $\mathbb{Z}^d$ given a distribution $G$ on $[0,+\infty]$ ($+\infty$ is allowed). When $G([0,+\infty]) < p_c(d)$, it is known that the time constant $μ_G$ exists. We are interested in the regularity properties of the map $G\mapstoμ_G$. We first study the specific case of distributions of the form $G_p=pδ_1+(1-p)δ_\infty$ for $p>p_c(d)$. In this case, the travel time between two points is equal to the length of the shortest path between the two points in a bond percolation of parameter $p$. We show that the function $p\mapsto …
There exists a Lipschitz embedding of a d-dimensional comb graph (consisting of infinitely many parallel copies of Z^{d-1} joined by a perpendicular copy) into the open set of site percolation on Z^d, whenever the parameter p is close enough to 1 or the Lipschitz constant is sufficiently large. This is proved using several new results and techniques involving stochastic domination, in contexts that include a process of independent overlapping intervals on Z, and first-passage percolation on general graphs.
Consider the graph induced by $\mathbb{Z}^d$, equipped with uniformly elliptic random conductances. At time $0$, place a Poisson point process of particles on $\mathbb{Z}^d$ and let them perform independent simple random walks. Tessellate the graph into cubes indexed by $i\in\mathbb{Z}^d$ and tessellate time into intervals indexed by $τ$. Given a local event $E(i,τ)$ that depends only on the particles inside the space time region given by the cube $i$ and the time interval $τ$, we prove the existence of a Lipschitz connected surface of cells $(i,τ)$ that separates the origin from infinity on w…
Does there exist a Lipschitz injection of $\mathbb{Z}^d$ into the open set of a site percolation process on $\mathbb{Z}^D$, if the percolation parameter p is sufficiently close to 1? We prove a negative answer when d=D and also when $d\geq2$ if the Lipschitz constant M is required to be 1. Earlier work of Dirr, Dondl, Grimmett, Holroyd and Scheutzow yields a positive answer for d<D and M=2. As a result, the above question is answered for all d, D and M. Our proof in the case d=D uses Tucker's lemma from topological combinatorics, together with the aforementioned result for d<D. One application…
We consider a critical Bernoulli site percolation on the uniform infinite planar triangulation. We study the tail distributions of the peeling time, perimeter, and volume of the hull of a critical cluster. The exponents obtained here differs by a factor 2 from those computed previously by Angel and Curien (2015) in the case of critical site percolation on the uniform infinite half-plane triangulation.
We analyze the geometry of domain Markov half planar triangulations. In \cite{AR13} it is shown that there exists a one-parameter family of measures supported on half planar triangulations satisfying translation invariance and domain Markov property. We study the geometry of these maps and show that they exhibit a sharp phase-transition in view of their geometry at $α= 2/3$. For $α<2/3$, the maps form a tree-like stricture with infinitely many small cut-sets. For $α> 2/3$, we obtain maps of hyperbolic nature with exponential growth and anchored expansion. Some results about the geometry of per…
We analyze the geometrical structure of the passage times in the last passage percolation model. Viewing the passage time as a piecewise linear function of the weights we determine the domains of the various pieces, which are the subsets of the weight space that make a given path the longest one. We focus on the case when all weights are assumed to be positive, and as a result each domain is a pointed polyhedral cone. We determine the extreme rays, facets, and two-dimensional faces of each cone, and also review a well-known simplicial decomposition of the maximal cones via the so-called order …
In the last two decades there was a lot of progress in understanding the geometry of smooth Gaussian fields. This survey aims to cover one particular line of research: the large scale behaviour of level and excursion sets and their (conjectured) connection to the percolation theory.
A well studied family of random fractals called fractal percolation is discussed. We focus on the projections of fractal percolation on the plane. Our goal is to present stronger versions of the classical Marstrand theorem, valid for almost every realization of fractal percolation. The extensions go in three directions: {itemize} the statements work for all directions, not almost all, the statements are true for more general projections, for example radial projections onto a circle, in the case $\dim_H >1$, each projection has not only positive Lebesgue measure but also has nonempty interior. …
We study a model of an i.i.d.~random environment in general dimensions $d\ge 2$, where each site is equipped with one of two environments. The model comes with a parameter $p$ which governs the frequency of the first environment, and for each dimension $d$ there is a critical parameter $p_c(d)$ at which there is a phase transition for the geometry of a particular connected cluster (the cluster is infinite for all $p$). We use the celebrated methodology of enhancements in this novel setting to prove that $p_c(d)$ is strictly monotone in $d$ for this model. To do so we study the discrete geometr…
We analyze the geometry of scaling limits of near-critical 2D percolation, i.e., for $p=p_c+λδ^{1/ν}$, with $ν=4/3$, as the lattice spacing $δ\to 0$. Our proposed framework extends previous analyses for $p=p_c$, based on $SLE_6$. It combines the continuum nonsimple loop process describing the full scaling limit at criticality with a Poissonian process for marking double (touching) points of that (critical) loop process. The double points are exactly the continuum limits of "macroscopically pivotal" lattice sites and the marked ones are those that actually change state as $λ$ varies. This struc…
On a geometric model for complex networks (introduced by Krioukov et al.) we investigate the bootstrap percolation process. This model consists of random geometric graphs on the hyperbolic plane having $N$ vertices, a dependent version of the Chung-Lu model. The process starts with infection rate $p=p(N)$. Each uninfected vertex with at least $\mathbf{r}\geq 1$ infected neighbors becomes infected, remaining so forever. We identify a function $p_c(N)=o(1)$ such that a.a.s.\ when $p\gg p_c(N)$ the infection spreads to a positive fraction of vertices, whereas when $p\ll p_c(N)$ the process cannot…
This paper focuses on the problem of modeling for small world effect on complex networks. Let's consider the supercritical Poisson continuous percolation on $d$-dimensional torus $T^d_n$ with volume $n^d$. By adding "long edges (short cuts)" randomly to the largest percolation cluster, we obtain a random graph $\mathscr G_n$. In the present paper, we first prove that the diameter of $\mathscr G_n$ grows at most polynomially fast in $\ln n$ and we call it the Poisson Geometry Small World. Secondly, we prove that the random walk on $\mathscr G_n$ possesses the rapid mixing property, namely, the …
This is a (long) survey about applications of percolation theory in equilibrium statistical mechanics. The chapters are as follows: 1. Introduction 2. Equilibrium phases 3. Some models 4. Coupling and stochastic domination 5. Percolation 6. Random-cluster representations 7. Uniqueness and exponential mixing from non-percolation 8. Phase transition and percolation 9. Random interactions 10. Continuum models
Geometric inhomogeneous random graphs (GIRGs) are a model for scale-free networks with underlying geometry. We study bootstrap percolation on these graphs, which is a process modelling the spread of an infection of vertices starting within a (small) local region. We show that the process exhibits a phase transition in terms of the initial infection rate in this region. We determine the speed of the process in the supercritical case, up to lower order terms, and show that its evolution is fundamentally influenced by the underlying geometry. For vertices with given position and expected degree, …
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…
In this note we study the geometry of the largest component C_1 of critical percolation on a finite graph G which satisfies the finite triangle condition, defined by Borgs et al. There it is shown that this component is of size n^{2/3}, and here we show that its diameter is n^{1/3} and that the simple random walk takes n steps to mix on it. Our results apply to critical percolation on several high-dimensional finite graphs such as the finite torus Z_n^d (with d large and n tending to infinity) and the Hamming cube {0,1}^n.
The energy and geometry of maximizing paths in integrable last passage percolation models are governed by the characteristic KPZ scaling exponents of one-third and two-thirds. When represented in scaled coordinates that respect these exponents, this random field of paths may be viewed as a complex energy landscape. We investigate the structure of valleys and connecting pathways in this landscape. The routed weight profile $\mathbb{R} \to \mathbb{R}$ associates to $x \in \mathbb{R}$ the maximum scaled energy obtainable by a path whose scaled journey from $(0,0)$ to $(0,1)$ passes through the po…
