SearcharxivSearch

arXiv · 2508.11859

Sharp upper bounds on hitting probabilities for the solution to the stochastic heat equation on the line

Abstract

For Gaussian random fields with values in $\mathbb{R}^d$, sharp upper and lower bounds on the probability of hitting a fixed set have been available for many years. These apply in particular to the solutions of systems of linear SPDEs. For non-Gaussian random fields, the available bounds are less sharp. For nonlinear systems of stochastic heat equations, a sharp lower bound was obtained in a previous paper by two of the authors. Here, we obtain the corresponding sharp upper bound. The proof requires a bound on the joint probability density function of a two-dimensional random vector whose components are the solution to the {\em nonlinear} stochastic heat equation and the supremum over a small rectangle of the solution to the {\em linear} stochastic heat equation, in terms of the size of the rectangle. This bound makes use of a formula that expresses the density of a {\em locally nondegenerate} random vector as an iterated Skorohod integral. The main effort is to estimate, using Malliavin calculus, each of the terms that arise from this formula.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Robert C. Dalang, David Nualart, Fei Pu. 2025-08-16. Sharp upper bounds on hitting probabilities for the solution to the stochastic heat equation on the line. https://arxiv.org/abs/2508.11859

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