Maximal edge-traversal time in First Passage Percolation
Abstract
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.
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.