On the number and size of holes in the growing ball of first-passage percolation (2205.09733v1)
Abstract: First-passage percolation is a random growth model defined on $\mathbb{Z}d$ using i.i.d. nonnegative weights $(\tau_e)$ on the edges. Letting $T(x,y)$ be the distance between vertices $x$ and $y$ induced by the weights, we study the random ball of radius $t$ centered at the origin, $B(t) = {x \in \mathbb{Z}d : T(0,x) \leq t}$. It is known that for all such $\tau_e$, the number of vertices (volume) of $B(t)$ is at least order $td$, and under mild conditions on $\tau_e$, this volume grows like a deterministic constant times $td$. Defining a hole in $B(t)$ to be a bounded component of the complement $B(t)c$, we prove that if $\tau_e$ is not deterministic, then a.s., for all large $t$, $B(t)$ has at least $ct{d-1}$ many holes, and the maximal volume of any hole is at least $c\log t$. Conditionally on the (unproved) uniform curvature assumption, we prove that a.s., for all large $t$, the number of holes is at most $(\log t)C t{d-1}$, and for $d=2$, no hole in $B(t)$ has volume larger than $(\log t)C$. Without curvature, we show that no hole has volume larger than $Ct \log t$.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.