Search arXivSearch

arXiv · 1606.09228

How flat is flat in random interface growth?

Abstract

Domains of attraction are identified for the universality classes of one-point asymptotic fluctuations for the Kardar-Parisi-Zhang (KPZ) equation with general initial data. The criterion is based on a large deviation rate function for the rescaled initial data, which arises naturally from the Hopf-Cole transformation. This allows us, in particular, to distinguish the domains of attraction of curved, flat, and Brownian initial data, and to identify the boundary between the curved and flat domains of attraction, which turns out to correspond to square root initial data. The distribution of the asymptotic one-point fluctuations is characterized by means of a variational formula written in terms of certain limiting processes (arising as subsequential limits of the spatial fluctuations of KPZ equation with narrow wedge initial data, as shown in [CH16]) which are widely believed to coincide with the Airy$_2$ process. In order to identify these distributions for general initial data, we extend earlier results on continuum statistics of the Airy$_2$ process to probabilities involving the process on the entire line. In particular, this allows us to write an explicit Fredholm determinant formula for the case of square root initial data.

Explore related subjects

Keep this discovery

BibTeXRIS

Jeremy Quastel, Daniel Remenik. 2016-06-29. How flat is flat in random interface growth?. https://doi.org/10.1090/tran/7338

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR