skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Title: KPZ equation with a small noise, deep upper tail and limit shape
In this paper, we consider the KPZ equation under the weak noise scaling. That is, we introduce a small parameter \sqrt{\varepsilon} in front of the noise and let \varepsilon \to 0. We prove that the one-point large deviation rate function has a \frac{3}{2} power law in the deep upper tail. Furthermore, by forcing the value of the KPZ equation at a point to be very large, we prove a limit shape of the KPZ equation as \varepsilon \to 0. This confirms the physics prediction in Kolokolov and Korshunov (2007), Kolokolov and Korshunov (2009), Meerson, Katzav, and Vilenkin (2016), Kamenev, Meerson, and Sasorov (2016), and Le Doussal, Majumdar, Rosso, and Schehr (2016).  more » « less
Award ID(s):
2243112
PAR ID:
10608021
Author(s) / Creator(s):
; ;
Publisher / Repository:
Springer Nature
Date Published:
Journal Name:
Probability Theory and Related Fields
Volume:
185
Issue:
3-4
ISSN:
0178-8051
Page Range / eLocation ID:
885 to 920
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. We establish the Freidlin–Wentzell Large Deviation Principle (LDP) for the Stochastic Heat Equation with multiplicative noise in one spatial dimension. That is, we introduce a small parameter ε√ to the noise, and establish an LDP for the trajectory of the solution. Such a Freidlin–Wentzell LDP gives the short-time, one-point LDP for the KPZ equation in terms of a variational problem. Analyzing this variational problem under the narrow wedge initial data, we prove a quadratic law for the near-center tail and a 52 law for the deep lower tail. These power laws confirm existing physics predictions (Kolokolov and Korshunov in Phys Rev B 75(14):140201, 2007, Phys Rev E 80(3):031107, 2009; Meerson et al. in Phys Rev Lett 116(7):070601, 2016; Le Doussal et al. in Phys Rev Lett 117(7):070403, 2016; Kamenev et al. in Phys Rev E 94(3):032108, 2016). 
    more » « less
  2. We consider the n-point, fixed-time large deviations of the KPZ equation with the narrow wedge initial condition. The scope consists of concave-configured, upper-tail deviations and a wide range of scaling regimes that allows time to be short, unit-order, and long. We prove the n-point large deviation principle and characterize, with proof, the corresponding spacetime limit shape. Our proof is based on the results—from the companion paper (Tsai in High moments of the SHE in the clustering regimes, 2023)—on moments of the stochastic heat equation and utilizes ideas coming from a tree decomposition. Behind our proof lies the phenomenon where the major contribution of the noise concentrates around certain corridors in spacetime, and we explicitly describe the corridors. 
    more » « less
  3. We analyze the high moments of the Stochastic Heat Equation (SHE) via a transformation to the attractive Brownian Particles (BPs), which are Brownian motions interacting via pairwise attractive drift. In those scaling regimes where the particles tend to cluster, we prove a Large Deviation Principle (LDP) for the empirical measure of the attractive BPs. Under the delta(-like) initial condition, we characterize the unique minimizer of the rate function and relate the minimizer to the spacetime limit shapes of the Kardar–Parisi–Zhang (KPZ) equation in the upper tails. The results of this paper are used in the companion paper [75] to prove an n-point, upper-tail LDP for the KPZ equation and to characterize the corresponding spacetime limit shape. 
    more » « less
  4. Abstract We consider the directed mean curvature flow on the plane in a weak Gaussian random environment. We prove that, when started from a sufficiently flat initial condition, a rescaled and recentred solution converges to the Cole–Hopf solution of the KPZ equation. This result follows from the analysis of a more general system of nonlinear SPDEs driven by inhomogeneous noises, using the theory of regularity structures. However, due to inhomogeneity of the noise, the “black box” result developed in the series of works cannot be applied directly and requires significant extension to infinite‐dimensional regularity structures. Analysis of this general system of SPDEs gives two more interesting results. First, we prove that the solution of the quenched KPZ equation with a very strong force also converges to the Cole–Hopf solution of the KPZ equation. Second, we show that a properly rescaled and renormalised quenched Edwards–Wilkinson model in any dimension converges to the stochastic heat equation. 
    more » « less
  5. Abstract We introduce $$\varepsilon $$ -approximate versions of the notion of a Euclidean vector bundle for $$\varepsilon \geq 0$$ , which recover the classical notion of a Euclidean vector bundle when $$\varepsilon = 0$$ . In particular, we study Čech cochains with coefficients in the orthogonal group that satisfy an approximate cocycle condition. We show that $$\varepsilon $$ -approximate vector bundles can be used to represent classical vector bundles when $$\varepsilon> 0$$ is sufficiently small. We also introduce distances between approximate vector bundles and use them to prove that sufficiently similar approximate vector bundles represent the same classical vector bundle. This gives a way of specifying vector bundles over finite simplicial complexes using a finite amount of data and also allows for some tolerance to noise when working with vector bundles in an applied setting. As an example, we prove a reconstruction theorem for vector bundles from finite samples. We give algorithms for the effective computation of low-dimensional characteristic classes of vector bundles directly from discrete and approximate representations and illustrate the usage of these algorithms with computational examples. 
    more » « less