Convergence towards an asymptotic shape in first-passage percolation on cone-like subgraphs of the integer lattice

Abstract

In first-passage percolation on the integer lattice, the Shape Theorem provides precise conditions for convergence of the set of sites reachable within a given time from the origin, once rescaled, to a compact and convex limiting shape. Here, we address convergence towards an asymptotic shape for cone-like subgraphs of the d lattice, where d2. In particular, we identify the asymptotic shapes associated to these graphs as restrictions of the asymptotic shape of the lattice. Apart from providing necessary and sufficient conditions for Lp- and almost sure convergence towards this shape, we investigate also stronger notions such as complete convergence and stability with respect to a dynamically evolving environment.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…