SearcharxivSearch

arXiv · 1210.0017

A stochastic Burgers equation from a class of microscopic interactions

Abstract

We consider a class of nearest-neighbor weakly asymmetric mass conservative particle systems evolving on $\mathbb{Z}$, which includes zero-range and types of exclusion processes, starting from a perturbation of a stationary state. When the weak asymmetry is of order $O(n^{-γ})$ for $1/2<γ\leq1$, we show that the scaling limit of the fluctuation field, as seen across process characteristics, is a generalized Ornstein-Uhlenbeck process. However, at the critical weak asymmetry when $γ=1/2$, we show that all limit points satisfy a martingale formulation which may be interpreted in terms of a stochastic Burgers equation derived from taking the gradient of the KPZ equation. The proofs make use of a sharp "Boltzmann-Gibbs" estimate which improves on earlier bounds.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Patrícia Gonçalves, Milton Jara, Sunder Sethuraman. 2015-01-16. A stochastic Burgers equation from a class of microscopic interactions. https://doi.org/10.1214/13-aop878

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