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

Abstract

First-passage percolation is a random growth model defined on Zd using i.i.d. nonnegative weights (τ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 ∈ Zd : T(0,x) ≤ t\. It is known that for all such τe, the number of vertices (volume) of B(t) is at least order td, and under mild conditions on τ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 τe is not deterministic, then a.s., for all large t, B(t) has at least ctd-1 many holes, and the maximal volume of any hole is at least c t. Conditionally on the (unproved) uniform curvature assumption, we prove that a.s., for all large t, the number of holes is at most ( t)C td-1, and for d=2, no hole in B(t) has volume larger than ( t)C. Without curvature, we show that no hole has volume larger than Ct t.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…