Table of Contents
Fetching ...

Large deviation bounds for the Airy point process

Chenyang Zhong

Abstract

In this paper, we establish the first large deviation bounds for the Airy point process. The proof is based on a novel approach which relies upon the approximation of the Airy point process using the Gaussian unitary ensemble (GUE) up to an exponentially small probability, together with precise estimates for the stochastic Airy operator and edge rigidity for beta ensembles. As a by-product of our estimates for the Airy point process, we significantly improve upon previous results on the lower tail probability of the one-point distribution of the KPZ equation with narrow-wedge initial data and the half-space KPZ equation with Neumann boundary parameter $A=-\frac{1}{2}$ and narrow-wedge initial data in a unified and much shorter manner. Our bounds hold for all sufficiently large time $T$, and for the first time establish sharp super-exponential decay with exponent $3$ for tail depth less than $T^{\frac{2}{3}}$ (with sharp leading prefactors $\frac{1}{12}$ and $\frac{1}{24}$ for tail depth less than $T^{\frac{1}{6}}$).

Large deviation bounds for the Airy point process

Abstract

In this paper, we establish the first large deviation bounds for the Airy point process. The proof is based on a novel approach which relies upon the approximation of the Airy point process using the Gaussian unitary ensemble (GUE) up to an exponentially small probability, together with precise estimates for the stochastic Airy operator and edge rigidity for beta ensembles. As a by-product of our estimates for the Airy point process, we significantly improve upon previous results on the lower tail probability of the one-point distribution of the KPZ equation with narrow-wedge initial data and the half-space KPZ equation with Neumann boundary parameter and narrow-wedge initial data in a unified and much shorter manner. Our bounds hold for all sufficiently large time , and for the first time establish sharp super-exponential decay with exponent for tail depth less than (with sharp leading prefactors and for tail depth less than ).

Paper Structure

This paper contains 47 sections, 39 theorems, 805 equations.

Key Result

Theorem 1.1

Let $I_1$ be given as in the preceding and recall (nukr). We have the following:

Theorems & Definitions (91)

  • Definition 1.1
  • Definition 1.2
  • Theorem 1.1
  • Remark 1.1
  • Remark 1.2
  • Remark 1.3
  • Remark 1.4
  • Definition 1.3
  • Theorem 1.2
  • Remark 1.5
  • ...and 81 more