PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
September 24, 20250 citationsOpen Access

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

View Full Paper
RDRobert C. DalangDNDavid NualartFPFei Pu

Key Points

  • The study establishes a sharp upper bound for hitting probabilities of solutions to the stochastic heat equation.
  • Malliavin calculus is employed to estimate terms from the probability density function, improving the results for nonlinear systems.
  • This builds upon a previous lower bound found for the same type of stochastic heat equations.
  • Insights gained may enhance theoretical frameworks surrounding stochastic partial differential equations (SPDEs) and their solutions.

Abstract

For Gaussian random fields with values in Rᵈ, 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 nonlinear stochastic heat equation and the supremum over a small rectangle of the solution to the 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 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.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Dalang et al. (2025) studied this question.

synapsesocial.com/papers/68d6e16f8b2b6861e4c401c2https://doi.org/10.48550/arxiv.2508.11859
Ask AI
Helpful
Bookmark
Share
View Full Paper