SearcharxivSearch

arXiv · 1205.6721

Space-time stationary solutions for the Burgers equation

Abstract

We construct space-time stationary solutions of the 1D Burgers equation with random forcing in the absence of periodicity or any other compactness assumptions. More precisely, for the forcing given by a homogeneous Poissonian point field in space-time we prove that there is a unique global solution with any prescribed average velocity. These global solutions serve as one-point random attractors for the infinite-dimensional dynamical system associated to solutions to the Cauchy problem. The probability distribution of the global solutions defines a stationary distribution for the corresponding Markov process. We describe a broad class of initial Cauchy data for which the distribution of the Markov process converges to the above stationary distribution. Our construction of the global solutions is based on a study of the field of action-minimizing curves. We prove that for an arbitrary value of the average velocity, with probability 1 there exists a unique field of action-minimizing curves initiated at all of the Poissonian points. Moreover action-minimizing curves corresponding to different starting points merge with each other in finite time.

Explore related subjects

Keep this discovery

BibTeXRIS

Yuri Bakhtin, Eric Cator, Konstantin Khanin. 2014-11-14. Space-time stationary solutions for the Burgers equation. https://arxiv.org/abs/1205.6721

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