pith. sign in

arxiv: 1610.01828 · v1 · pith:M5DRTD45new · submitted 2016-10-06 · 🧮 math.PR

A law of the iterated logarithm for directed last passage percolation

classification 🧮 math.PR
keywords iteratedlogarithmdirectedlastnormalizationpassagepercolationbounds
0
0 comments X
read the original abstract

A law of the iterated logarithm is established for the last passage times of directed percolation on rectangles in the plane over exponential or geometric independent random variables, rescaled to converge to the Tracy-Widom distribution. The normalization is of loglog type, in contrast with the log normalization for the largest eigenvalue of a GUE matrix recently put forward by E. Paquette and O. Zeitouni. The proof relies on sharp tail bounds and superadditivity, close to the standard law of the iterated logarithm. A weaker result for the liminf is also discussed.

This paper has not been read by Pith yet.

discussion (0)

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