SearcharxivSearch

arXiv · 2104.07492

The Gaussian Structure of the Singular Stochastic Burgers Equation

Abstract

We consider the stochastically forced Burgers equation with an emphasis on spatially rough driving noise. We show that the law of the process at a fixed time $t$, conditioned on no explosions, is absolutely continuous with respect to the stochastic heat equation obtained by removing the nonlinearity from the equation. This establishes a form of ellipticity in this infinite dimensional setting. The results follow from a recasting of the Girsanov Theorem to handle less spatially regular solutions while only proving absolute continuity at a fixed time and not on path-space. The results are proven by decomposing the solution into the sum of auxiliary processes which are then shown to be absolutely continuous in law to a stochastic heat equation. The number of levels in this decomposition diverges to infinite as we move to the stochastically forced Burgers equation associated to the KPZ equation, which we conjecture is just beyond the validity of our results (and certainly the current proof). The analysis provides insights into the structure of the solution as we approach the regularity of KPZ. A number of techniques from singular SPDEs are employed as we are beyond the regime of classical solutions for much of the paper.

Explore related subjects

Keep this discovery

BibTeXRIS

Jonathan C. Mattingly, Marco Romito, Langxuan Su. 2021-04-15. The Gaussian Structure of the Singular Stochastic Burgers Equation. https://arxiv.org/abs/2104.07492

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