First-passage percolation is a random growth model defined using i.i.d. edge-weights $(t_e)$ on the nearest-neighbor edges of $\mathbb{Z}^d$. An initial infection occupies the origin and spreads along the edges, taking time $t_e$ to cross the edge $e$. In this paper, we study the size of the boundary of the infected ("wet") region at time $t$, $B(t)$. It is known that $B(t)$ grows linearly, so its boundary $\partial B(t)$ has size between $ct^{d-1}$ and $Ct^d$. Under a weak moment condition on the weights, we show that for most times, $\partial B(t)$ has size of order $t^{d-1}$ (smooth). On the other hand, for heavy-tailed distributions, $B(t)$ contains many small holes, and consequently we show that $\partial B(t)$ has size of order $t^{d-1+α}$ for some $α>0$ depending on the distribution. In all cases, we show that the exterior boundary of $B(t)$ (edges touching the unbounded component of the complement of $B(t)$) is smooth for most times. Under the unproven assumption of uniformly positive curvature on the limit shape for $B(t)$, we show the inequality $\#\partial B(t) \leq (\log t)^C t^{d-1}$ for all large $t.$
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 the existence of an infinite cluster may be direction-dependent. Then, we prove that the phase transition in a given direction is sharp, and study the links between percolation and first-passage percolation on these oriented graphs.
The non-random fluctuation is one of the central objects in first passage percolation. It was proved in [Shuta Nakajima. Divergence of non-random fluctuation in First Passage Percolation. {\em Electron. Commun. Probab.} 24 (65), 1-13. 2019.] that for a particular asymptotic direction, it diverges in a lattice first passage percolation with an explicit lower bound. In this paper, we discuss the non-random fluctuation in Euclidean first passage percolations and show that it diverges in dimension $d\geq 2$ in this model also. Compared with the result in \cite{N19}, the present result is proved fo…
In this paper, we study the maximal edge-traversal time (simply we call maximal weight hereafter) on the optimal paths in the first passage percolation for several edge distributions, including the Pareto and Weibull distributions. It is known to be unbounded when the edge distribution has unbounded support [J. van den Berg and H. Kesten. Inequalities for the time constant in first-passage percolation. Ann. Appl. Probab. 56-80, 1993]. We determine the order of the growth up to a multiplicative constant.
On properties of optimal paths in first passage percolation
本文研究了$\Z^d$上首段渗流最优路径的若干性质,证明了:(1)当分布中含有原子时,最优路径的个数呈指数增长性;(2)最优路径的交、并均值在距离上是线性的.为了证明,我们使用了[J. van den Berg和H.凯斯滕首次通过渗流中时间常数的不等式。应用概率分析56-80,1993],具有适当的适应性。
This paper studies the first passage percolation (FPP) model: each edge in the cubic lattice is assigned a random passage time, and consideration is given to the behavior of the percolation region $B(t)$, which consists of those vertices that can be reached from the origin within a time $t > 0$. Cox and Durrett showed the shape theorem for the percolation region, saying that the normalized region $B(t)/t$ converges to some limit shape $\mathcal{B}$. This paper introduces a general FPP model defined on crystal lattices, and shows the monotonicity of the limit shapes under covering maps, thereby…
A universality property for last-passage percolation paths close to the axis
在$Z_+^2$中考虑最后一次通过定向渗流模型,其中i.i.d.其公共分布具有有限$(2+p)$阶矩的权重。我们研究了从原点到点$\big(n,n^{\lfloor a \rfloor}\big)$的通过时间的涨落。我们发现,对于合适的$a$(取决于$p$),这个数量,适当缩放,收敛分布为$n\to\infty$的Tracy-Widom分布,无论潜在的权重分布。该论点使用耦合到布朗定向渗流问题和Komlós,Major和Tusnády的强近似。
In first-passage percolation, one places nonnegative i.i.d. random variables (T (e)) on the edges of Z d. A geodesic is an optimal path for the passage times T (e). Consider a local property of the time environment. We call it a pattern. We investigate the number of times a geodesic crosses a translate of this pattern. Under mild conditions, we show that, apart from an event with exponentially small probability, this number is linear in the distance between the extremities of the geodesic.
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.