Next Article in Journal
Spatial Network Analysis of Coupling Coordination between Digital Financial Inclusion and Common Prosperity in the Yangtze River Delta Urban Agglomeration
Previous Article in Journal
Inter-Channel Correlation Modeling and Improved Skewed Histogram Shifting for Reversible Data Hiding in Color Images
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Asymptotic Behavior of Stochastic Reaction–Diffusion Equations

China Aerodynamics Research and Development Center, No. 6, South Section, Second Ring Road, Mianyang 621000, China
*
Author to whom correspondence should be addressed.
Mathematics 2024, 12(9), 1284; https://doi.org/10.3390/math12091284
Submission received: 8 April 2024 / Revised: 21 April 2024 / Accepted: 22 April 2024 / Published: 24 April 2024
(This article belongs to the Special Issue Dynamics of Predator-Prey and Infectious Disease Models)

Abstract

:
In this paper, we concentrate on the propagation dynamics of stochastic reaction–diffusion equations, including the existence of travelling wave solution and asymptotic wave speed. Based on the stochastic Feynman–Kac formula and comparison principle, the boundedness of the solution of stochastic reaction–diffusion equations can be obtained so that we can construct a sup-solution and a sub-solution to estimate the upper bound and the lower bound of wave speed.

1. Introduction

In the current paper, we focus on stochastic reaction–diffusion equations driven by Gaussian noise
d u = [ Δ u + u c 1 ( u , v ) ] d t + ϵ u d W t , d v = [ Δ v + v c 2 ( u , v ) ] d t + ϵ v d W t , u ( 0 , x ) = u 0 ( x ) , v ( 0 , x ) = v 0 ( x ) ,
where u 0 and v 0 as initial data are both Heaviside functions. In this paper, it always holds that
(H1)
0 < c 1 ( u , v ) v < a , 0 < c 2 ( u , v ) u < a ;
(H2)
c 1 ( u , v ) is decreasing for u, c 1 ( u , 0 ) c 1 ( 0 , 0 ) , and c 1 ( u , 0 ) < 0 for u > 1 a ; c 2 ( u , v ) is decreasing for v, c 2 ( 0 , v ) c 2 ( 0 , 0 ) , and c 2 ( 0 , v ) < 0 for v > 1 a ;
(H3)
There exists α β > a for any ξ 0 , u 0 and v 0 ; it holds that β ξ c 1 ( u , v ) c 1 ( u + ξ , v ) α ξ , β ξ c 2 ( u , v ) c 2 ( u , v + ξ ) α ξ ;
(H4)
c i ( 0 , 0 ) > 2 ϵ 2 , i = 1 , 2 .
In general, (H1) and (H2) imply that System (1) is cooperative, so its corresponding dynamical system is monotonic and a comparison method can be used in this system. (H4) ensures the noise is moderate, otherwise the solution of Equation (1) tends to zero as t .
Under conditions (H1)–(H4), System (1) poses an only positive stable equilibrium denoted by ( p 1 , p 2 ) . If c 1 ( u , v ) = c 1 ( u , 0 ) , c 2 ( u , v ) = c 2 ( 0 , v ) , Zhao and Øksendal [1] investigated the pathwise property and ergodicity of a stochastic reaction–diffusion equation in a scalar scale under conditions (H2)–(H4),
d u ( t , x ) = [ D 2 u x x ( t , x ) + c ( u ( t , x ) ) u ( t , x ) ) d t + k ( t ) u ( t , x ) d W t , u ( 0 , x ) = u 0 ( x ) .
Inspired by Benth and Gjessing [2], they successfully obtained the stochastic Feynman–Kac formula by constructing exponential martingale and revealed that the existence of a travelling wave solution and its asymptotic wave speed depend on the strength of noise. In detail, if lim inf t 0 t k 2 ( s ) d s > c 0 = c ( 0 ) and the noise is strong, the solution to Equation (2) almost surely tends to zero. If 0 t k 2 ( s ) d s < and the noise is weak, the travelling wave solution of Equation (2) converges to the travelling wave solution of deterministic reaction–diffusion equation. Moreover, if k = lim t 0 t k 2 ( s ) d s exist and the noise is moderate, the wavefront marker is x = D ( 2 c 0 2 k ) t .
If ϵ = 0 , Freidlin [3] studied the asymptotic behavior of the Cauchy problem under conditions (H1)–(H3),
u t = D 1 2 2 u x 2 + c 11 ( u , v ) u ( t , x ) + c 12 v ( t , x ) , v t = D 2 2 2 v x 2 + c 21 ( u , v ) v ( t , x ) + c 22 u ( t , x ) , u ( 0 , x ) = g 1 ( x ) , v ( 0 , x ) = g 2 ( x ) .
Until now, many papers have been concerned with stochastic travelling wave solutions in the scalar equation. Zhao [4] studied the wave speed of a stochastic KPP equation driven by white noise. Huang and Wang [5,6,7,8,9] investigated the asymptotic behavior of a stochastic reaction–diffusion equation driven by various noises. Indeed, a way to deal with the coupling terms is the crux in the research of travelling wave solution of stochastic reaction–diffusion equations. In this paper, with monotonic random dynamical system theory and comparison principle, the boundedness of solution to Equation (1) is obtained and used to construct a sup-solution and a sub-solution under conditions (H1)–(H4). Hence, via the SCP (Support Compactness Propagation) property proposed by Shiga [10] and two sufficient conditions proposed by Tribe [11], the existence of a travelling wave solution can be obtained. Again, with the boundedness of solution, we can estimate the upper bound and the lower bound of wave speed by a sup-solution and a sub-solution, respectively.
Throughout this paper, we set Ω as the space of temper distributions, F as the σ -algebra on Ω , and ( Ω , F , P ) as the white noise probability space. We denote by E the expectation with respect to P . We denote by ϕ λ ( x ) = e x p ( λ | x | ) . Here are some notations:
  • D [ 0 , ) = { ϕ : R [ 0 , ) , ϕ is   right   continuous   and   decreasing , ϕ = lim x ϕ ( x ) exists } ;
  • D [ 0 , 1 ] = { ϕ : R [ 0 , 1 ] , ϕ is   right   continuous   and   decreasing } ;
  • D = { ϕ D [ 0 , 1 ] : ϕ ( ) = 1 , ϕ ( ) = 0 } ;
  • C + = f | f : R [ 0 , ) and f is continuous;
  • | | f | | λ = sup x R ( | f ( x ) ϕ λ ( x ) | ) ;
  • C λ + = f C + | f is continuous, and | f ( x ) ϕ λ ( x ) | 0 as x ± ;
  • C t e m + = λ > 0 C λ + ;
  • C C [ 0 , 1 ] + = { f | f : R [ 0 , 1 ] } is the space of nonnegative functions with compact support;
  • Φ = f : | | f | | λ < for some λ < 0 is the space of functions with exponential decay;
  • R 0 ( t ) = sup { x R : u ( t , x ) > 0 } is the wavefront marker.
Lemma 1 
([11]). A set K C λ + is called relatively compact if and only if
(a) 
K is equicontinuous on a compact set;
(b) 
lim R sup f K sup | x | R | f ( x ) e λ | x | | = 0 .
Lemma 2 
([11]). K C t e m + is (relatively) compact if and only if it is (relatively) compact in C λ + for all λ > 0 .
Lemma 3 
([11] (Kolmogorov tightness criterion)). For C < , δ > 0 , μ < λ , γ > 0 , we define
K ( C , δ , γ , μ ) = { f : | f ( x ) f ( x ) | C | x x | γ e μ | x | f o r a l l | x x | δ } ,
then, with the above conditions, we know that K ( C , δ , γ , μ ) { f : R f ( x ) ϕ 1 d x a } is compact in C λ + , where a is a constant.
(1) 
If { X n ( · ) } are C λ -valued processes, with { R X n ϕ 1 d x } tight and there are C 0 < , p > 0 , γ > 1 , μ < λ such that for all n 1 , | x y | 1 ,
E ( | X n ( x ) X n ( y ) | p ) C 0 | x y | γ e μ p | x | ,
then { X n } are tight.
(2) 
Similarly, if { X n } are C ( [ 0 , T ] , C λ + ) -valued processes, with { R X n ( 0 ) ϕ 1 d x } tight, and there are C 0 < , p > 0 , γ > 2 , μ < λ such that for all n 1 , | x y | 1 , | t t | 1 , t , t [ 0 , T ] ,
E ( | X n ( x , t ) X n ( y , t ) | p ) C 0 ( | x y | γ + | t t | γ ) e μ p | x | ,
then { X n } are tight.

2. Asymptotic Behavior of a Travelling Wave Solution

At the beginning of our work, we offer the definition of stochastic travelling wave solution in law. D [ 0 , ) values are equipped with the L l o c 1 ( R ) metric, D [ 0 , 1 ] and D are measurable subsets of D [ 0 , ) , and the three spaces are all Polish spaces and are compact. We consider a stochastic reaction–diffusion equation with a Heaviside function as follows:
d u = [ Δ u + f ( u ) ] d t + ϵ u d W t , u ( 0 , x ) = u 0 ( x ) .
Definition 1. 
A stochastic travelling wave solution is a solution to u = ( u ( t ) : t 0 ) to Equation (4) with values in D and for which the centered process ( u ˜ = u ( t , · + R 0 ( t ) ) : t 0 ) is a stationary process with respect to time, and the law of a stochastic travelling wave solution is the law of u ˜ ( 0 ) on D .
We denote by Y = ( u , v ) T and F ( Y ) = ( F 1 ( Y ) , F 2 ( Y ) ) = ( u c 1 ( u , v ) , v c 2 ( u , v ) ) T ; then, Equation (1) can be rewritten as
d Y = [ Δ Y + F ( Y ) ] d t + ϵ Y d W t , Y ( 0 , x ) = ( u 0 ( x ) , v 0 ( x ) ) T .
Lemma 4. 
For any Heaviside functions u 0 and v 0 as initial data, for, a . e . , ω Ω , there exists a unique solution to Equation (5) in law with the form
Y ( t , x ) = R G ( t , x , y ) Y 0 d y + 0 t R G ( t s , x , y ) F ( Y ) d s d y + ϵ 0 t R G ( t s , x , y ) Y d W s d y ,
where G ( t , x , y ) is the Green function.
Proof. 
We denote by Y n = ( u n , v n ) T , since c 1 ( u , v ) and c 2 ( u , v ) are Lipschitz continuous, perform some truncations and let F n ( Y n ) = ( ( u n n ) c 1 ( u n n , v n n ) , ( v n n ) c 2 ( u n n , v n n ) ) ; then, F n ( Y n ) is Lipschitz continuous. Hereto, the truncated Equation (7) can be constructed:
d Y n = [ Δ Y n + F n ( Y n ) ] d t + ϵ Y n d W t , Y n ( 0 , x ) = Y 0 n ( x ) ,
where Y 0 n ( x ) C t e m + , and Y 0 n ( x ) Y 0 ( x ) as n + . We refer to [12]. There exists a unique solution Y n ( t , x ) to Equation (7) in law and Y n ( t , x ) C t e m + . According to the Kolmogorov tightness criterion, we can show that for, a.e., ω Ω there is a unique solution Y ( t , x ) to Equation (5) such that Y n ( t , x ) converges to Y ( t , x ) as n . □
Lemma 5 
([12]). All solutions to (5) with initial date Y 0 have the same law which is denoted by Q Y 0 , c 1 u , c 1 v , c 2 u , c 2 v , and map ( Y 0 , c 1 u , c 1 v , c 2 u , c 2 v ) Q Y 0 , c 1 u , c 1 v , c 2 u , c 2 v is continuous. For any Heaviside function Y 0 , law Q Y 0 , c 1 u , c 1 v , c 2 u , c 2 v forms a strong Markov family.
Next, we perform several estimations about Y ( t , x ) which play an important role in constructing travelling wave solution and estimating its asymptotic wave speed.
Theorem 1. 
For any Heaviside functions u 0 and v 0 as initial data, if (H1)–(H4) hold, for any t > 0 fixed and, a . e . , ω Ω , it is true that
E [ u ( t , x ) + v ( t , x ) ] C ( ϵ , t ) , x R ,
where C ( ϵ , t ) = E [ exp ( sup 0 r t r t ϵ d W s ) ] is a constant.
Proof. 
We consider Equation (1):
d u = [ Δ u + u c 1 ( u , v ) ] d t + ϵ u d W t , d v = [ Δ v + v c 2 ( u , v ) ] d t + ϵ v d W t , u ( 0 , x ) = u 0 ( x ) , v ( 0 , x ) = v 0 ( x ) .
We denote by ϕ ( t , x ) = u ( t , x ) + v ( t , x ) ; we have
d ϕ = [ Δ ϕ + u c 1 ( u , v ) + v c 2 ( u , v ) ] d t + ϵ ϕ d W t , ϕ ( 0 , x ) = ϕ 0 = u 0 + v 0 .
We let c 0 = max i = 1 , 2 { c i ( 0 , 0 ) } ; with (H1) and (H3), we know that there exists β > a > 0 such that
| c 1 ( u , v ) | c 0 + β | u | + a | v | , c 2 ( u , v ) c 0 + β | v | + a | u | ,
combination with (H2) and (11) gives
c 1 ( u , v ) c 0 β u + a v , c 2 ( u , v ) c 0 β v + a u .
Frequently, it can be determined that
u c 1 ( u , v ) + v c 2 ( u , v ) u ( c 0 β u + a v ) + v ( c 0 β v + a u ) c 0 ( u + v ) β ( u 2 + v 2 ) + 2 a u v c 0 ( u + v ) β a 2 ( u + v ) 2 = ( u + v ) ( c 0 β a 2 ( u + v ) ) .
We denote c 3 ( x ) = c 0 β a 2 x ; c 3 ( x ) is decreasing for x [ 0 , + ) , and c 3 ( x ) < 0 for x > 2 c 0 β a . We let ψ ( t , x ) be the solution to Equation (13):
d ψ = [ Δ ψ + ψ ( c 0 β a 2 ψ ) ] d t + ϵ ψ d W t , ψ 0 = u 0 + v 0 .
According to monotone random dynamical systems theory [13] and its corresponding comparison principle [14], it can be determined that u ( t , x ) ψ ( t , x ) a . s . and v ( t , x ) ψ ( t , x ) a . s . We let ζ ( t , x ) be the solution to the following equation:
d ζ = [ Δ ζ + ζ ( c 0 β a 2 ζ ) ] d t ϵ 2 2 ζ , ζ 0 = ψ 0 .
We refer to [12] and use a stochastic Feynman–Kac formula. We have
exp ( inf 0 r t r t ϵ d W s ) ζ ( t , x ) ψ ( t , x ) exp ( sup 0 r t r t ϵ d W s ) ζ ( t , x ) a . s .
For any fixed t > 0 , for any σ > 0 , multiplying G ( t s + σ , x y ) in (14) and integrating over R, it can be determined that
s R ζ ( s , y ) G ( t s + σ , x y ) d y = ( c 0 ϵ 2 2 ) R ζ ( s , y ) G ( t s + σ , x y ) d y β a 2 R ζ 2 ( s , y ) G ( t s + σ , x y ) d y ( c 0 ϵ 2 2 ) R ζ ( s , y ) G ( t s + σ , x y ) d y β a 2 ( R ζ ( s , y ) G ( t s + σ , x y ) d y ) 2 .
We let φ ( s ) = R ζ ( s , y ) G ( t s + σ , x y ) d y ; then, we have
d φ ( s ) d s ( c 0 ϵ 2 2 ) φ ( s ) β a 2 φ 2 ( s ) , φ 0 = R ζ 0 G ( t + σ , x y ) d y .
It can be deduced that
φ ( s ) φ 0 + 2 c 0 β a ϵ 2 β a .
Furthermore, we have
R ζ ( t , y ) G ( σ , x y ) d y R ζ 0 G ( t + σ , x y ) d y + 2 c 0 β a ϵ 2 β a .
Then, we let σ 0 , and we have
ζ ( t , x ) R ζ 0 G ( t + , x y ) d y + 2 c 0 β a ϵ 2 β a .
Therefore, we perform combination with (15) and obtain
u ( t , x ) + v ( t , x ) ψ ( t , x ) exp ( sup 0 r t r t ϵ d W s ) × ( R ψ 0 G ( t , x y ) d y + 2 c 0 β a ϵ 2 β a ) a . s .
Moreover, since the initial data u 0 and v 0 are both Heaviside functions, we take the expectation and obtain
E [ u ( t , x ) + v ( t , x ) ] C ( ϵ , t ) ( u 0 + v 0 + 2 c 0 β a ϵ 2 β a ) ,
where C ( ϵ , t ) = E [ exp ( sup 0 r t r t ϵ d W s ) ] . □
Theorem 2. 
For any Heaviside functions u 0 and v 0 as initial data, if (H1)–(H4) hold, for, a . e . , ω Ω , any T > 0 fixed, it it true that
E sup 0 t T [ | u ( t ) | 2 + | v ( t ) | 2 ] E [ | u 0 | 2 + | v 0 | 2 ] e t + K ( ϵ ) ( 1 e t ) ,
where K ( ϵ ) > 0 is constant.
Proof. 
We let V ( t ) = | u ( t ) | 2 + | v ( t ) | 2 using the Itô formula, and we obtain
d V ( t ) = 2 u , Δ u d t + 2 v , Δ v d t + 2 u , c 1 ( u , v ) d t + 2 v , c 2 ( u , v ) d t + ϵ 2 [ u 2 + v 2 ] d t + 2 ϵ [ u 2 + v 2 ] d W t .
Then, integrating both sides in [ 0 , t ] and taking the expectation implies
E [ V ( t ) ] = E [ | u 0 | 2 + | v 0 | 2 ] + 2 E 0 t u , Δ u d s + 2 E 0 t v , Δ v d s + ϵ 2 E 0 t ( u 2 + v 2 ) d s + 2 E 0 t u , c 1 ( u , v ) d s + 2 E 0 t v , c 2 ( u , v ) d s E [ | u 0 | 2 + | v 0 | 2 ] 2 E 0 t | u | 2 d s 2 E 0 t | v | 2 d s + ϵ 2 E 0 t ( u 2 + v 2 ) d s + 2 c 0 E 0 t ( u 2 + v 2 ) d s 2 ( β a ) E 0 t ( u 3 + v 3 ) d s E [ | u 0 | 2 + | v 0 | 2 ] 2 ( β a ) E 0 t ( u 3 + v 3 ) d s + 2 c 0 E 0 t ( u 2 + v 2 ) d s + ϵ 2 E 0 t ( u 2 + v 2 ) d s + E 0 t ( u 2 + v 2 ) d s E 0 t ( u 2 + v 2 ) d s .
Hence, with Young inequality and Gronwall inequality, we have
E [ | u ( t ) | 2 + | v ( t ) | 2 ] E [ | u 0 | 2 + | v 0 | 2 ] e t + K ( ϵ ) ( 1 e t ) ,
where K ( ϵ ) is a constant. □
With the boundedness of Y ( t , x ) , the sup-solution can be constructed to describe how fast the support of Y ( t , x ) can spread and the SCP property can be obtained.
Lemma 6. 
We let Y ( t , x ) be the solution to (1) with initial data Y 0 as a Heaviside function. We suppose for some r > 0 such that Y 0 is supported outside ( r 2 , r + 2 ) ; then, for any t 1 ,
P ( 0 t r r | | Y ( s , x ) | | d s d x > 0 ) C e t t | x | ( r + 1 ) exp ( ( | x | ( r + 1 ) ) 2 2 t ) | | Y 0 | | d x .
Proof. 
Since Y ( t , x ) is bounded and we construct a sup-solution solving the following equation:
d u = [ Δ u + u ( ρ β u ) ] d t + ϵ u d W t , d v = [ Δ v + v ( ρ β v ) ] d t + ϵ v d W t , u ( 0 ) = u 0 , v ( 0 ) = v 0 ,
where ρ > 0 is a constant such that u c 1 ( u , v ) u ( ρ β u ) and v c 2 ( u , v ) v ( ρ β v ) , then we refer to [11,12]. The proof can be completed. □
Then, we show that Y ( t , x ) satisfy the Kolmogorov tightness criterion and Y ( t , x ) K ( C , δ , μ , γ ) , which is dedicated to constructing a tight probability measure sequence and furthermore obtain the existence of a travelling wave solution.
Lemma 7. 
For any Heaviside functions u 0 and v 0 as initial data, if (H1)–(H4) hold, for, a . e . , ω Ω , any p 2 fixed, t > 0 , if | x x | 1 , there exits C ( p , t ) < such that
Q Y 0 ( | Y ( t , x ) Y ( t , x ) | p ) C ( p , t ) | x x | p / 2 1 .
Proof. 
Direct calculation shows that
| Y ( t , x ) Y ( t , x ) | p 3 p 1 | R ( G ( t , x y ) G ( t , x y ) ) u 0 d y | p + 3 p 1 | R ( G ( t , x y ) G ( t , x y ) ) v 0 d y | p + 3 p 1 | R 0 t ( G ( t s , x y ) G ( t s , x y ) ) u c 1 ( u , v ) d s d y | p I
+ 3 p 1 | R 0 t ( G ( t s , x y ) G ( t s , x y ) ) v c 2 ( u , v ) d s d y | p I I + 3 p 1 ϵ p | R 0 t ( G ( t s , x y ) G ( t s , x y ) ) u d W s d y | p I I I + 3 p 1 ϵ p | R 0 t ( G ( t s , x y ) G ( t s , x y ) ) v d W s d y | p I V .
Since
0 t R ( G ( t s , x y ) G ( t s , x y ) ) 2 d s d y C ( t ) | x x | ,
and Y ( t , x ) is bounded, for I I I and I V , we have
E [ I I I ] C ( p ) ϵ p E ( 0 t R ( G ( t s , x y ) G ( t s , x y ) ) 2 d s d y ) p / 2 1 × ( 0 t R ( G ( t s , x y ) G ( t s , x y ) ) 2 u p d s d y ) C 1 ( p , t ) | x x | p / 2 1 ,
and
E [ I V ] C 2 ( p , t ) | x x | p / 2 1 .
With Hölder inequality, for I and I I , we have
E [ I ] = 3 p 1 E | 0 t R ( G ( t s , x y ) G ( t s , x y ) ) ( u a 1 u 2 + b 1 u v ) d s d y | p 3 p 1 ( 0 t R ( G ( t s , x y ) G ( t s , x y ) ) 2 d s d y ) p / 2 1 × ( 0 t R | G ( t s , x y ) G ( t s , x y ) | 2 E [ ( u a 1 u 2 + b 1 u v ) p ] d s d y ) C 3 ( p , t ) | x x | p / 2 1 ,
and
E [ I I ] C 4 ( p , t ) | x x | p / 2 1 .
Meanwhile, we have
E | R ( G ( t , x y ) G ( t , x y ) ) u 0 d y | p = E | R x x ( y r ) 2 t 4 π y exp ( ( y r ) 2 4 t ) u 0 d r d y | p K ( t ) ( R x x 1 t exp ( ( y r ) 2 5 t ) u 0 d r d y ) p
K ( t ) | x x | p R 1 t exp ( ( y x ) 2 5 t ) | u 0 | p d y C 5 ( p , t ) | x x | p / 2 1 , ( s i n c e | x x | 1 ) ,
and
E | R ( G ( t , x y ) G ( t , x y ) ) v 0 d y | 2 C 6 ( p , t ) | x x | p / 2 1 .
Combining all the inequalities above completes the proof:
E [ | Y ( t , x ) Y ( t , x ) | p ] C ( p , t ) | x x | p / 2 1 .
In order to construct a travelling weave solution, according to the two sufficient conditions proposed by Tribe [11], we are required to show that the wavefront marker is bounded for all t > 0 and the translation of solution with respect to a wavefront marker is stationary. However, it is quite difficult to deal with R 0 ( t ) directly, so we turn to a new suitable wavefront marker for help. We define Q Y 0 as the law of the unique solution to Equation (5) with initial data Y 0 . For a probability measure ν on C t e m + , we define
Q ν ( A ) = C t e m + Q Y 0 ( A ) ν ( d Y 0 ) ,
define a new wavefront marker R 1 ( t ) : C t e m + [ , ] ,
R 1 ( f ) = l n R e x f d x , R 1 ( u ( t ) ) = ln R e x u ( t , x ) d x ,
and
R 1 ( t ) : = R 1 ( Y ( t ) ) = max { R 1 ( u ( t ) ) , R 1 ( v ( t ) ) } ;
then, R 1 ( t ) is an approximation to R 0 ( Y ( t ) ) = max { R 0 ( u ( t ) ) , R 0 ( v ( t ) ) } . We let Z ( t ) = Y ( t , · + R 1 ( t ) ) = ( Z 1 ( t ) , Z 2 ( t ) ) T , Z 0 ( t ) = Y ( t , · + R 0 ( Y ( t ) ) ) , and define
Z ( t ) = ( 0 , 0 ) T , R 1 ( t ) = , ( u ( t , · + R 1 ( t ) ) , v ( t , · + R 1 ( t ) ) ) T , < R 1 ( t ) < , ( p 1 , p 2 ) T , R 1 ( t ) = .
Next, define
ν T = t h e l a w o f 1 T 0 T Z ( s ) d s u n d e r Q Y 0 .
Now, we summarize the steps of constructing a travelling wave solution. First, we show that the new wavefront marker is bounded (see Lemma 8) to ensure the shifting does not destroy the tightness (see Lemma 7). Based on this, we construct a tight probability measure sequence { ν T } T N (see Lemma 9) and show that any limit point is nontrivial (see Theorem 3), where Q ν is the law of a travelling wave solution.
Lemma 8. 
For any Heaviside functions u 0 and v 0 as initial data, for, a . e . , ω Ω , any t 0 , d > 0 , T 1 , there exists C ( t ) < such that
Q ν T ( | R 1 ( t ) | > d ) C ( t ) d .
Proof. 
With the comparison principle, we construct a sup-solution solving Equation (28):
d u ˜ = [ Δ u ˜ + k u ˜ ] d t + ϵ u ˜ d W t , d v ˜ = [ Δ v ˜ + k v ˜ ] d t + ϵ v ˜ d W t , u ˜ 0 = u 0 , v ˜ 0 = v 0 ,
where k > 0 is a constant such that u c 1 ( u , v ) k u and v c 2 ( u , v ) k v ; thus, we determine that u ( t , x ) u ˜ ( t , x ) and v ( t , x ) v ˜ ( t , x ) hold on [ 0 , T ] uniformly, and for, a.e., ω Ω the solution to Equation (28) can be expressed by
Y ˜ ( t , x ) = R e k t G ( t , x y ) Y 0 ( y ) d y + ϵ R 0 t G ( t s , x y ) Y ˜ d W s d y .
Without generality, we assume that R 1 ( t ) = R 1 ( u ( t ) ) and take u ( t , x ) for an example. We have
Q u 0 ( R u ( t , x ) e x d x ) E [ R u ˜ ( t , x ) e x d x ] = E [ R R e k t G ( t , x y ) u 0 ( y ) d y e x d x ] = e k t + t R u 0 ( x ) e x d x ,
according to the definition of R 1 ( t ) , we know
R u ( t , x + R 1 ( t ) ) e x d x = e R 1 ( t ) R u ( t , x ) e x d x = 1 ;
meanwhile, we have
R v ( t , x + R 1 ( t ) ) e x d x 1 .
Combining (30) with (31) implies that
Q ν T ( R 1 ( t ) d ) = 1 T 0 T Q u 0 ( Q u ( s ) ( R 1 ( t ) d ) ) d s = 1 T 0 T Q u 0 ( Q u ( s ) ( e d R u ( t , x ) e x d x 1 ) ) d s e d 1 T 0 T Q u 0 ( Q u ( s ) ( R u ( t , x ) e x d x ) ) d s e d e k t + t 1 T 0 T R u ( s , x + R 1 ( s ) ) e x d x d s = e d e k t + t .
On the other hand, Jensen’s inequality offers
Q u 0 ( R 1 ( t ) ) ln ( e k t + t R u 0 ( x ) e x d x ) k t + t + R 1 ( u 0 ) ,
additionally, we can obtain such estimation:
1 T Q u 0 ( t T + t R 1 ( s ) d s 0 T R 1 ( s ) d s ) = 1 T Q u 0 ( 0 T R 1 ( t + s ) R 1 ( s ) d s ) = 1 T 0 T { R 1 ( t + s ) R 1 ( s ) > d } ( R 1 ( t + s ) R 1 ( s ) ) Q u 0 ( d u ) d s + 1 T 0 T { R 1 ( t + s ) R 1 ( s ) d } ( R 1 ( t + s ) R 1 ( s ) ) Q u 0 ( d u ) d s 1 T 0 T { R 1 ( t + s ) R 1 ( s ) > 0 } ( R 1 ( t + s ) R 1 ( s ) ) Q u 0 ( d u ) d s d T 0 T Q u 0 ( R 1 ( t + s ) R 1 ( s ) d ) d s 1 T 0 T 0 Q u 0 ( R 1 ( t + s ) R 1 ( s ) y ) d y d s
d T 0 T Q u 0 ( R 1 ( t + s ) R 1 ( s ) d ) d s = 0 Q ν T ( R 1 ( t ) y ) d y d Q ν T ( R 1 ( t ) d ) .
Rearranging the inequalities above implies
Q ν T ( R 1 ( t ) d ) 1 d 0 Q ν T ( R 1 ( t ) y ) d y + 1 d T 0 T Q ν T ( R 1 ( s ) ) d s 1 d T t T + t Q u 0 ( R 1 ( s ) ) d s 1 d 0 e y + k 0 t + t d y + 1 d T 0 T k 0 s + s + R 1 ( u 0 ) d s C ( t ) d .
We combine (32) with (33), and the proof can be completed. □
Via the boundedness of wavefront marker R 1 ( t ) , we can construct the tight sequence { ν T : T N } with Y ( t , x ) K ( C , δ , μ , γ ) .
Lemma 9. 
For any Heaviside functions u 0 and v 0 as initial data, for, a . e . , ω Ω , the sequence { ν T : T N } is tight.
Proof. 
Similarly, we start discussion with u ( t , x ) . Since Y ( t , x ) K ( C , δ , μ , γ ) , it can be determined that u ( t , x ) K ( C , δ , μ , γ ) , and furthermore, we have
ν T ( K ( C , δ , γ , μ ) ) = 1 T 0 T Q u 0 ( u ( t , · + R 1 ( t ) ) K ( C , δ , γ , μ ) ) d s 1 T 0 T Q u 0 ( ( u ( t , · + R 1 ( t 1 ) ) K ( C e μ d , δ , γ , μ ) ) × | R 1 ( t ) R 1 ( t 1 ) | d ) d s : = I I I .
According to Lemma 8, it can be easily determined that I I 0 as d . In addition, for any given d , μ > 0 , we choose C , δ , γ to make I as close to T T 1 as desired. In addition, we know
ν T { u 0 : R u 0 ( x ) e | x | d x R u 0 ( x ) e x d x = 1 } = 1 ;
thus, for a given μ > 0 , we can choose C , δ , γ such that ν T ( K ( C , δ , μ , γ ) { u 0 : R u 0 ( x ) e | x | d x } ) as close to one as desired for T and d that are sufficiently large, which means that sequence { ν T : T N } is tight. We refer to Lemma 3.9 in [12]. The proof can be completed. □
Theorem 3. 
For any Heaviside functions u 0 and v 0 as initial data, if (H1)–(H4) hold, for, a . e . , ω Ω , any T > 0 fixed, there is a travelling wave solution to Equation (1), and Q ν is the law of travelling wave solution.
Proof. 
Refer to Theorem 3.10 in [12]. The proof can be completed. □
Based on the existence of a stochastic travelling wave solution, we can estimate the wave speed by the comparison principle in the following. First, we construct the sup-solution
d u ¯ = [ Δ u ¯ + u ¯ c ¯ ( u ¯ ) ] d t + ϵ u ¯ d W t , d v ¯ = [ Δ v ¯ + v ¯ c ¯ ( v ¯ ) ] d t + ϵ v ¯ d W t , u ¯ 0 = c ¯ ( 0 ) c 1 ( 0 , 0 ) u 0 , v ¯ 0 = c ¯ ( 0 ) c 2 ( 0 , 0 ) v 0 ,
where c ¯ ( x ) is Lipschitz continuous and decreasing for x [ 0 , ) , and there exists δ > 0 , such that c ¯ ( x ) < 0 for x > δ . Since ( u , v ) is the solution to (1) and bounded, it holds that c 1 ( u , v ) c ¯ ( u ) and c 2 ( u , v ) c ¯ ( v ) . Then, we construct the sub-solution
d u ̲ = [ Δ u ̲ + u ̲ c 1 ( u ̲ , 0 ) ] d t + ϵ u ̲ d W t , d v ̲ = [ Δ v ̲ + v ̲ c 2 ( 0 , v ̲ ) ] d t + ϵ v ̲ d W t , u ̲ 0 = u 0 , v ̲ 0 = v 0 ,
where c 1 ( u , v ) c 1 ( u , 0 ) , c 2 ( u , v ) c 2 ( 0 , v ) . According to the comparison theorem of wave speed (see Lemma 4.2 in [12]), the wave speed of travelling wave solution to Equation (1) can be estimated.
Theorem 4. 
For any Heaviside functions u 0 and v 0 as initial data, if (H1)–(H4) hold, we denote by c the wave speed of the travelling wave solution to Equation (1); then,
4 c ̲ 0 2 ϵ 2 c 4 c ¯ 0 2 ϵ 2 a . s .
where c ̲ 0 = max { c 1 ( 0 , 0 ) , c 2 ( 0 , 0 ) } , c ¯ 0 = c ¯ ( 0 ) .
Proof. 
According the definition of wave speed,
c = lim t R 0 ( t ) t a . s . ,
the wave speed of stochastic reaction–diffusion equations is the maximum value between the two sub-systems; thus, with the comparison theorem of wave speed and referring to Theorems 4.1 and 4.2 in [12], the proof can be completed. □

3. Conclusions

In this paper, we are devoted to the propagation dynamics of stochastic reaction–diffusion equations and offer the definition of the stochastic travelling wave solution in law. According to the random monotonic dynamical system theory, the existence of travelling wave solution is determined via the two sufficient conditions proposed by Tribe, and we summarize the general methods of constructing a stochastic travelling wave solution. Furthermore, the estimation of asymptotic wave speed can be obtained by constructing sup-solution and sub-solution and using the comparison method of wave speed. Obviously, the upper bound and the lower bound of wave speed depend on the nonlinear terms and the strength of noise, and it is in line with reality. In the deterministic condition, the wave speed relies on the nonlinear term. After introducing the noise term, its impact is reflected in the estimate of wave speed.

Author Contributions

Conceptualization, H.W.; writing, H.W.;review and editing, Y.W. and G.L.; supervision, D.L. All authors have read and agreed to the published version of the manuscript.

Funding

This paper is funded by National Natural Science Foundation of China (11802328).

Data Availability Statement

No new data were created or analyzed in this study. Data sharing is not applicable to this article.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Øksendal, B.; Våge, G.; Zhao, H. Two properties of stochastic KPP equations: Ergodicity and pathwise property. Nonlinearity 2001, 3, 639–662. [Google Scholar] [CrossRef]
  2. Benth, F.; Gjessing, H. A nonlinear parabolic equation with noise. Potential Anal. 2000, 4, 385–401. [Google Scholar] [CrossRef]
  3. Freidlin, M. On wave fronts propagation in multicomponent media. Trans. Am. Math. Soc. 1983, 1, 181–191. [Google Scholar] [CrossRef]
  4. Øksendal, B.; Våge, G.; Zhao, H. Asymptotic properties of the solutions to stochastic KPP equations. Proc. R. Soc. Edinb. Sect. A 2000, 6, 1363–1381. [Google Scholar] [CrossRef]
  5. Huang, Z.; Liu, Z. Stochastic traveling wave solution to stochastic generalized KPP equation. NoDea-Nonlinear Differ. Equ. Appl. 2015, 1, 143–173. [Google Scholar] [CrossRef]
  6. Huang, Z.; Liu, Z. Random traveling wave and bifurcations of asymptotic behaviors in the stochastic KPP equation driven by dual noises. J. Differ. Equ. 2016, 2, 1317–1356. [Google Scholar] [CrossRef]
  7. Huang, Z.; Liu, Z.; Wang, Z. Utility indifference valuation for defaultable corporate bond with credit rating migration. Mathematics 2020, 8, 2033. [Google Scholar] [CrossRef]
  8. Wang, Z.; Zhou, T. Asymptotic behaviors and stochastic traveling waves in stochastic Fisher-KPP equations. Discret. Contin. Dyn. Syst. Ser. B 2021, 9, 5023–5045. [Google Scholar] [CrossRef]
  9. Huang, Z.; Miao, Y.; Wang, Z. Free boundary problem pricing defaultable corporate bonds with multiple credit rating migration risk and stochastic interest rate. AIMS Math. 2020, 6, 7746–7775. [Google Scholar] [CrossRef]
  10. Shiga, T. Two contrasting properties of solutions for one-dimensional stochastic partial differential equations. Can. J. Math. 1994, 2, 415–437. [Google Scholar] [CrossRef]
  11. Tribe, R. A travelling wave solution to the kolmogorov equation with noise. Stoch. Stoch. Rep. 1996, 56, 317–340. [Google Scholar] [CrossRef]
  12. Wen, H.; Huang, J.; Li, Y. Propagation of stochastic travelling waves of cooperative systems with noise. Discret. Contin. Dyn. Syst. Ser. B 2022, 10, 5779–5803. [Google Scholar] [CrossRef]
  13. Chueshov, I. Monotone Random Systems: Theory and Applications; Springer: New York, NY, USA, 2002. [Google Scholar]
  14. Kotelenez, P. Comparison methods for a class of function valued stochastic partial differential equations. Probab. Theory Relat. Fields 1992, 93, 1–19. [Google Scholar] [CrossRef]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Wen, H.; Wang, Y.; Liu, G.; Liu, D. Asymptotic Behavior of Stochastic Reaction–Diffusion Equations. Mathematics 2024, 12, 1284. https://doi.org/10.3390/math12091284

AMA Style

Wen H, Wang Y, Liu G, Liu D. Asymptotic Behavior of Stochastic Reaction–Diffusion Equations. Mathematics. 2024; 12(9):1284. https://doi.org/10.3390/math12091284

Chicago/Turabian Style

Wen, Hao, Yuanjing Wang, Guangyuan Liu, and Dawei Liu. 2024. "Asymptotic Behavior of Stochastic Reaction–Diffusion Equations" Mathematics 12, no. 9: 1284. https://doi.org/10.3390/math12091284

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop