Large deviation principle at speed n for the random metric in first-passage percolation
Abstract
Consider standard first-passage percolation on Zd. We study the lower-tail large deviations of the rescaled random metric Tn restricted to a box. If all exponential moments are finite, we prove that Tn follows the large deviation principle at speed n with a rate function J, in a suitable space of metrics. Moreover, we give three expressions for J(D). The first two involve the metric derivative with respect to D of Lipschitz paths and the lower-tail rate function for the point-point passage time. The third is an integral against the 1-dimensional Hausdorff measure of a local cost. Under a much weaker moment assumption, we give an estimate for the probability of events of the type \ Tn D \.
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.