2017
DOI: 10.1214/15-aihp719
|View full text |Cite
|
Sign up to set email alerts
|

On comparison principle and strict positivity of solutions to the nonlinear stochastic fractional heat equations

Abstract: In this paper, we prove a sample-path comparison principle for the nonlinear stochastic fractional heat equation on R with measure-valued initial data. We give quantitative estimates about how close to zero the solution can be. These results extend Mueller's comparison principle on the stochastic heat equation to allow more general initial data such as the (Dirac) delta measure and measures with heavier tails than linear exponential growth at ±∞. These results generalize a recent work by Moreno Flores [25], wh… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
61
0

Year Published

2019
2019
2020
2020

Publication Types

Select...
6

Relationship

5
1

Authors

Journals

citations
Cited by 36 publications
(61 citation statements)
references
References 34 publications
0
61
0
Order By: Relevance
“…Similar small-ball probabilities in various settings can be found in [8,9,13,20]. These nonnegativity statements can be translated into comparison statements by considering v = u 1 − u 2 .…”
Section: Introductionmentioning
confidence: 56%
See 3 more Smart Citations
“…Similar small-ball probabilities in various settings can be found in [8,9,13,20]. These nonnegativity statements can be translated into comparison statements by considering v = u 1 − u 2 .…”
Section: Introductionmentioning
confidence: 56%
“…Step 1: Let u ǫ,1 (t, x) and u ǫ,2 (t, x) be the solutions to (7.6) with initial data µ 1 and µ 2 , respectively. Following exactly the same lines as those in Step 2 of the proof in [8], we can prove that v ǫ (t, x) := u ǫ,2 (t, x) − u ǫ,1 (t, x) satisfies P v ǫ (t, x) ≥ 0, for every t > 0 and x ∈ R d = 1 . (7.8)…”
Section: Weak Comparison Principle (Proof Of Theorem 11)mentioning
confidence: 87%
See 2 more Smart Citations
“…We may apply the strong Markov property of u, with respect to F , at the stopping time T n in order to see that for all integers n 0, 1] solves (1.8) starting from the random initial profile v (n) 0 (x) := v (n) (0 , x) = u(T n , x ; λ). By the very definition of the stopping time T n , and since T n is finite a.s., v (n) 0 (x) = u(T n , x ; λ) e −1 inf y∈T u(T n−1 , y ; λ) · · · e −n inf y∈T u 0 (y) =: e −n u 0 , a.s. for every x ∈ T, and with identity for some x ∈ T a.s. Because u 0 > 0 [see (1.2)], it follows from a comparison theorem [3,21,25] that v (n) (t , x) w (n) (t , x) for all t 0 and x ∈ T a.s., where w (n) solves (1.8) [for a different Brownian sheet] starting from w (n) 0 (x) := w (n) (0 , x) = e −n u 0 . In particular, for all integers n 0 and reals τ ∈ (0 , 1),…”
Section: Proof Of Theorem 13mentioning
confidence: 99%