SearcharxivSearch

arXiv · 2211.02795

On the valleys of the stochastic heat equation

Abstract

We consider a generalization of the parabolic Anderson model driven by space-time white noise, also called the stochastic heat equation, on the real line. High peaks of solutions have been extensively studied under the name of intermittency, but less is known about spatial regions between peaks, which may loosely refer to as valleys. We present two results about the valleys of the solution. Our first theorem provides information about the size of valleys and the supremum of the solution over a valley. More precisely, we show that the supremum of the solution over a valley vanishes as $t\to\infty$, and we establish an upper bound of $\exp\{-\text{const}\cdot t^{1/3}\}$ for the rate of decay. We demonstrate also that the length of a valley grows at least as $\exp\{+\text{const}\cdot t^{1/3}\}$ as $t\to\infty$. Our second theorem asserts that the length of the valleys are eventually infinite when the initial data has subgaussian tails.

Explore related subjects

Keep this discovery

BibTeXRIS

Davar Khoshnevisan, Kunwoo Kim, Carl Mueller. 2022-11-05. On the valleys of the stochastic heat equation. https://arxiv.org/abs/2211.02795

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