SearcharxivSearch

arXiv · 1407.6977

Height fluctuations for the stationary KPZ equation

Abstract

We compute the one-point probability distribution for the stationary KPZ equation (i.e. initial data H(0,X)=B(X), for B(X) a two-sided standard Brownian motion) and show that as time T goes to infinity, the fluctuations of the height function H(T,X) grow like T^{1/3} and converge to those previously encountered in the study of the stationary totally asymmetric simple exclusion process, polynuclear growth model and last passage percolation. The starting point for this work is our derivation of a Fredholm determinant formula for Macdonald processes which degenerates to a corresponding formula for Whittaker processes. We relate this to a polymer model which mixes the semi-discrete and log-gamma random polymers. A special case of this model has a limit to the KPZ equation with initial data given by a two-sided Brownian motion with drift beta to the left of the origin and b to the right of the origin. The Fredholm determinant has a limit for beta>b, and the case where beta=b (corresponding to the stationary initial data) follows from an analytic continuation argument.

Explore related subjects

Keep this discovery

BibTeXRIS

Alexei Borodin, Ivan Corwin, Patrik L. Ferrari, Bálint Vető. 2014-07-25. Height fluctuations for the stationary KPZ equation. https://arxiv.org/abs/1407.6977

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