Search arXivSearch

arXiv · 2211.06779

Ergodicity and synchronization of the Kardar-Parisi-Zhang equation

Abstract

The Kardar-Parisi-Zhang (KPZ) equation on the real line is well-known to admit Brownian motion with a linear drift as a stationary distribution (modulo additive constants). We show that these solutions are attractive, a result known as a one force--one solution (1F1S) principle or synchronization: the solution to the KPZ equation started in the distant past from an initial condition with a given slope will converge almost surely to a Brownian motion with that drift, which shows in particular that these invariant measures are totally ergodic. Our proof constructs the Busemann process for the equation, which gives the natural jointly stationary coupling of all of these stationary solutions. Synchronization then holds simultaneously (on a single full probability event) for all but an at most countable random set of asymptotic slopes. This set of exceptional slopes of instability for which synchronization fails is either almost surely empty or almost surely dense. Along the way, we prove a shape theorem which implies almost sure stochastic homogenization of the KPZ equation, for which the Busemann process gives the process of correctors. We also show that the forward and backward point-to-point and point-to-line continuum polymers converge to semi-infinite continuum polymers whose transitions are Doob transforms via Busemann functions of the transitions of the finite length polymers.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Christopher Janjigian, Firas Rassoul-Agha, Timo Seppäläinen. 2022-11-13. Ergodicity and synchronization of the Kardar-Parisi-Zhang equation. https://arxiv.org/abs/2211.06779

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

KEEP EXPLORING

Related papers

Generalized Edgeworth expansions for integer-valued additive functionals of uniformly elliptic Markov chains

We obtain asymptotic expansions for probabilities $\bbP(S_N=k)$ of partial sums of uniformly bounded integer-valued functionals $\DS S_N=\sum_{n=1}^N f_n(X_n)$ of uniformly elliptic inhomogeneous Markov chains. The expansions involve products of polynomials and trigonometric polynomials, and they hold without additional assumptions. As an application of the explicit formulas of the trigonometric polynomials, we relate existence of the standard Edgeworth expansions of order $r$ to the rate of equidistributions of $S_N$ modulo $m$ for small positive integers $m.$

math.PR

Permutations from Random Walk

Xavier and Yushi run a "random race" as follows. An atomless probability distribution $μ$ on the real line is chosen. The runners begin at zero. At time $i$ Xavier draws $\mathbf{X}_i$ from $μ$ and advances that distance, while Yushi advances by an independent drawing $\mathbf{Y}_i$. After $n$ such moves, what is the probability that Yushi led all the way? That the answer (namely, $4^{-n}\binom{2n}{n}$) is independent of $μ$ follows from a classical theorem of Darling, stating that for symmetric atomless increments, the distribution of each individual rank in the permutation obtained by ranking the partial sums is independent of the step law. We give a self-contained proof and extend the result to the permutations generated by partial sums of uniformly random signed permutations of any fixed, finite, generic set of reals. For atomless increments with mean zero and finite variance, without assuming symmetry, we show that random-walk permutations approach a random object that we call the "Wiener permuton," whose expected pattern densities equal the probabilities of the corresponding permutations generated by finite random walks with centered Laplace increments. Finally, we exhibit an infinite family of constructions whose limiting permutons interpolate between the Wiener permuton and the recursive separable permuton; each has the same intensity permuton, providing a single two-dimensional extension of the classical arcsine law for all of them.

math.PR

On the uniqueness of quasi-stationary distributions for population models with spatial structure

Subcritical population processes are attracted to extinction and do not have non-trivial stationary distributions, which prompts the study of quasi-stationary distributions (QSDs) instead. In contrast to what generally happens for stationary distributions, QSDs may not be unique, even under irreducibility conditions. The general conditions for uniqueness of QSDs are not always easy to check. For the branching process, besides the quasi-limiting distribution there are many other QSDs. In this paper, we investigate whether adding little extra information to the continuous-time branching process is enough to obtain uniqueness. We consider the branching process with genealogy and branching random walks, and show that they have a unique QSD.

math.PR