Pith. sign in

REVIEW

Large deviation principle at speed n for the random metric in first-passage percolation

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2412.03320 v1 pith:OIGHZXKT submitted 2024-12-04 math.PR

Large deviation principle at speed $n$ for the random metric in first-passage percolation

classification math.PR
keywords largemathbfmetricwidehatdeviationfirst-passagefunctiongive
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
abstract

Consider standard first-passage percolation on $\mathbb Z^d$. We study the lower-tail large deviations of the rescaled random metric $\widehat{\mathbf T}_n$ restricted to a box. If all exponential moments are finite, we prove that $\widehat{\mathbf T}_n$ 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 $\{\widehat{\mathbf T}_n \le D \}$.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.