On the number and size of holes in the growing ball of first-passage percolation

preprint2022arXivOpen access

Abstract

First-passage percolation is a random growth model defined on Zd\mathbb{Z}^d using i.i.d. nonnegative weights (τe)(τ_e) on the edges. Letting T(x,y)T(x,y) be the distance between vertices xx and yy induced by the weights, we study the random ball of radius tt centered at the origin, B(t)={x∈Zd:T(0,x)≤t}B(t) = \{x \in \mathbb{Z}^d : T(0,x) \leq t\}. It is known that for all such τeτ_e, the number of vertices (volume) of B(t)B(t) is at least order tdt^d, and under mild conditions on τeτ_e, this volume grows like a deterministic constant times tdt^d. Defining a hole in B(t)B(t) to be a bounded component of the complement B(t)cB(t)^c, we prove that if τeτ_e is not deterministic, then a.s., for all large tt, B(t)B(t) has at least ctd−1ct^{d-1} many holes, and the maximal volume of any hole is at least clog⁡tc\log t. Conditionally on the (unproved) uniform curvature assumption, we prove that a.s., for all large tt, the number of holes is at most (log⁡t)Ctd−1(\log t)^C t^{d-1}, and for d=2d=2, no hole in B(t)B(t) has volume larger than (log⁡t)C(\log t)^C. Without curvature, we show that no hole has volume larger than Ctlog⁡tCt \log t.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.