Next Article in Journal
Two Inverse Eigenproblems for Certain Symmetric and Nonsymmetric Pentadiagonal Matrices
Previous Article in Journal
Subgraph Adaptive Structure-Aware Graph Contrastive Learning
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Razumikhin Theorems on Polynomial Stability of Neutral Stochastic Pantograph Differential Equations with Markovian Switching

School of Information and Mathematics, Yangtze University, Jingzhou 434023, China
*
Author to whom correspondence should be addressed.
Mathematics 2022, 10(17), 3048; https://doi.org/10.3390/math10173048
Submission received: 24 July 2022 / Revised: 12 August 2022 / Accepted: 19 August 2022 / Published: 24 August 2022
(This article belongs to the Section Computational and Applied Mathematics)

Abstract

:
This paper investigates the polynomial stability of neutral stochastic pantograph differential equations with Markovian switching (NSPDEsMS). Firstly, under the local Lipschitz condition and a more general nonlinear growth condition, the existence and uniqueness of the global solution to the addressed NSPDEsMS is considered. Secondly, by adopting the Razumikhin approach, one new criterion on the qth moment polynomial stability of NSPDEsMS is established. Moreover, combining with the Chebyshev inequality and the Borel–Cantelli lemma, the almost sure polynomial stability of NSPDEsMS is examined. The results derived in this paper generalize the previous relevant ones. Finally, two examples are provided to illustrate the effectiveness of the theoretical work.
MSC:
60H10; 34K40; 37H30; 93E15

1. Introduction

Due to the existence of random disturbances, neutral stochastic differential equations (NSDEs) can be utilized to characterize those complicated systems such as population system, chemical reaction process, heating control systems, complex networks and other systems [1,2,3,4,5,6,7]. The structures and parameters of some systems may encounter unpredictable variations, so Markovian jump systems are introduced to depict these phenomena. During the past several decades, many scholars have been absorbed in the neutral stochastic differential equations with Markovian switching (NSDEsMS), and large amounts of interesting results have been acquired [8,9,10].
The pantograph system was presented by Ockendon and Tayler in 1971 [11], which could be seen as one important class of systems with unbounded delays. Recently, network systems with pantograph delays as one class of pantograph systems have received extensive attention. Particularly, in [12], the exponential stability of switching neural networks with pantograph delays was discussed by adopting the average dwell-time (ADT) technique and Lyapunov stability approach. In [13], global h-stability criteria for pantograph delay high-order inertial neural networks were examined by utilizing the non-reduced order method. In [14,15], periodic solutions and anti-periodic solutions of neural networks with pantograph delays were analyzed by means of differential inequality techniques. In [16,17], based on the comparison principle and some analysis techniques, control issues, such as the synchronization and passivity of neural networks with pantograph delays were investigated. On the other hand, by employing the stochastic Lyapunov method, the stability of linear or highly nonlinear stochastic pantograph equations were extensively investigated [18,19,20]. Moreover, the referent results were generalized to the stochastic pantograph differential equations (SPDEs) or neutral stochastic pantograph differential equations with Markovian switching (NSPDEsMS) [21,22,23].
The Razumikhin approach is one effective tool to deal with the stability issue of the time delayed system. This approach was initiated in [24,25] and it was developed in various different systems, including discrete systems, impulsive systems and stochastic systems, and many publications have been reported [26,27,28,29,30,31,32,33,34,35]. In particular, the Razumikhin technique was also extensively applied to NSDEs. For instance, Mao [28] adopted the Razumikhin technique to investigate the mean-square moment exponential stability of NSDEs. Subsequently, the theory wa sfurther extended to analyze the pth moment stability of NSFDEs in [29]. Huang and Deng [30] used the Razumikhin technique to examine the asymptotic stability of NSDEs. By incorporating the stability with general decay rate, Pavlovi c ´ and Jankovi c ´ [31] established new Razumikhin theorems, which may be specialized on the different types of stability. Moreover, Razumikhin techniques were generalized to NSDEs with Markovian switching [32,33] and NSDEs with unbounded delays [34]. For NSPDEs, Yu [35] constructed the criterion on Razumikhin-type pth moment asymptotic stability and discussed the stability of the numerical solutions in virtue of the backward Euler method.
In addition, different from exponential stability, polynomial stability is also one class important stability. In [36], Mao considered the almost sure polynomial stability of the stochastic systems by using the semimartingale theory. Inspired by several practical examples, Liu [37] investigated moment stability with general decay speeds. Lan et al. [38] proposed one modified truncated Euler–Maruyama (MTEM) approach and explored the almost sure and mean square polynomial stability of the numerical technique. For SPDEs, many scholars [39,40,41,42,43] analyzed the polynomial stability by using the stochastic Lyapunov function method and some numerical algorithms. More recently, Mao et al. [44] constructed the novel Razumikhin theorems on the pth moment polynomial stability of the SPDEs. For NSPDEs, it can be observed that the references listed above focus on two aspects. One is the pth moment exponential stability [20,21,22], the other one is the pth moment stability with general decay rate [23]. Meanwhile, all the results in Refs. [20,21,22,23] required that the coefficients of delayed terms keep time varying. Therefore, it is necessary to develop other stabilities, such as the polynomial stability of NSPDEs with constant coefficients and generalize the theory in [35,44] to NSPDEsMS.
Inspired by the aforementioned discussions, this paper will investigate the polynomial stability of NSPDEsMS by virtue of the Razumikhin method and several stochastic analysis techniques. The contributions of our article are listed below. Firstly, the existence and uniqueness of the solutions to NSPDEsMS are analyzed, where the condition on upper bound of the operator L U is relaxed. Secondly, the Razumikhin theorem on the qth polynomial stability of NSPDEsMS is established, and the drift term does not need to meet the linear growth condition. Moreover, based on some stochastic theories, the criterion on almost sure polynomial stability of NSFDEsMS is provided. Thirdly, all the existing stability results [20,21,22,23] require that coefficients of the delay term be time-varying, but the restriction in this paper is removed and the coefficients may keep constant. This paper also generalizes the theory in [35,44] to NSFDEsMS. The structure of this article is arranged appropriately. In Section 2, standard notations are introduced, and several importance assumptions are proposed. In Section 3, the existence and uniqueness of the global solutions to NSPDEsMS are considered. Furthermore, some criteria on polynomial stability are constructed by utilizing the Razumikhin approach and stochastic analysis techniques. Section 4 illustrates the validity of the theoretical work through two concrete examples, and a full summarization is made in the last part.

2. Preliminaries

Throughout this paper, the following standard notations are adopted. Set t 0 > 0 , 0 < q < 1 . Let ( Ω , F , ( F t ) t t 0 , P ) be a complete probability space with a filtration { F t } t t 0 satisfying the usual conditions. Let w ( t ) = w 1 ( t ) , , w m ( t ) T be one m dimensional Brownian motion defined on the probability space. | · | denotes the Euclidean norm in R n . C ( [ δ t 0 , t 0 ] ; R n ) denotes the family of continuous functions ζ : [ δ t 0 , t 0 ] R n with the norm | | ζ | | = sup δ t 0 s t 0 | ζ ( s ) | . L F t q ( [ δ t , t ] ; R n ] ) denotes the set of all F t -measurable, C ( [ δ t , t ] ; R n ) -valued stochastic variables ψ = { ψ ( s ) : δ t s t } such that E | | ψ ( s ) | | q < + . Υ ( t ) , t t 0 denotes a Markov chain on the probability space taking values in a finite state space S = { 1 , 2 , , N } with generator Γ = ρ i j N × N given by
P { Υ ( t + Δ ) = j Υ ( t ) = i } = ρ i j Δ + o ( Δ ) , if i j , 1 + ρ i i Δ + o ( Δ ) , if i = j ,
in which Δ > 0 , and ρ i j satisfies ρ i j 0 , i j and ρ i i = j i ρ i j . Moreover, the Markov chain Υ ( · ) is supposed to be independent of the Brownian motion w ( · ) .
Consider the following NSPDEsMS
d [ y ( t ) G ( y ( δ t ) , t , Υ ( t ) ) ] = F ( y ( t ) , y ( δ t ) , t , Υ ( t ) ) d t + H ( y ( t ) , y ( δ t ) , t , Υ ( t ) ) d w ( t ) , t t 0 , y ( s ) = ζ ( s ) [ δ t 0 , t 0 ] , t 0 > 0 , 0 < δ < 1 ,
where G : R n × [ δ t 0 , + ) × S R n , F : R n × R n × [ δ t 0 , + ) × S R n and H : R n × R n × [ δ t 0 , + ) × S R n × m are Borel-measurable functions. In order to discuss the polynomial stability of Equation (1), we suppose that the initial value ζ L F t 0 q , and F ( 0 , 0 , t , Υ ( t ) ) = 0 , H ( 0 , 0 , t , Υ ( t ) ) = 0 , G ( 0 , 0 , Υ ( t ) ) = 0 . Obviously, this means that Equation (1) has one trivial solution.
To acquire our main results, the following definitions and assumptions on the addressed system are imposed.
Definition 1.
The solution of Equation (1) is called to be polynomially stable in the pth moment if there is one constant η ˜ satisfying
lim t + sup ln E | y ( t ) | q ln ( 1 + t ) η ˜ .
Definition 2.
The solution of Equation (1) is called to be almost surely polynomially stable if there is one constant η ˜ satisfying
lim t + sup ln | y ( t ) | ln ( 1 + t ) η ˜ a . s .
Assumption 1.
For arbitrary integer m > 1 , there is one constant K m > 0 satisfying that
F ( υ 1 , υ 2 , t , i ) F ( υ ¯ 1 , υ ¯ 2 , t , i ) H ( υ 1 , υ 2 , t , i ) H ( υ ¯ 1 , υ ¯ 2 , t , i ) K m ( υ 1 υ ¯ 1 + υ 2 υ ¯ 2 ) ,
where all υ 1 , υ 2 , υ ¯ 1 , υ ¯ 2 R n , υ 1 υ 2 υ ¯ 1 υ ¯ 2 m and ( t , i ) [ δ t 0 , + ] × S .
Assumption 2.
For all υ 1 , υ 2 R n and ( t , i ) [ t 0 , ) , there exists a real number κ ( 0 , 1 ) satisfying
G ( υ 1 , t , i ) G ( υ 2 , t , i ) | κ | υ 1 υ 2 | ,
where G ( 0 , t , i ) = 0 .
Assumption 3.
Suppose that there exists one function U C 2 , 1 ( R n × [ δ t 0 , + ) × S ; R + ) and several constants d 1 > 0 , d 2 > 0 , α > q 1 , β i 0 ( i = 0 , 1 , 2 , 3 , 4 ) such that
(i) 
d 1 | y | q U ( y , t , i ) d 2 | y | q ,
(ii) 
L U ( y , z , t , i ) β 0 + β 1 | y | q + δ β 2 | z | q β 3 | y | α + δ β 4 | z | α .
Assumption 4.
Suppose that there exists one function U C 2 , 1 ( R n × [ δ t 0 , + ) × S ; R + ) and several constants d 1 > 0 , d 2 > 0 , q 1 , β i 0 ( i = 1 , 2 ) such that
(i) 
d 1 | y | q U ( y , t , i ) d 2 | y | q ,
(ii) 
L U ( y , z , t , i ) β 1 | y | q + δ β 2 | z | q .

3. Main Results

In this section, the existence and uniqueness of the global solutions to NSPDEsMS are considered. Furthermore, some criteria on polynomial stability are constructed by utilizing the Razumikhin approach and stochastic analysis techniques.
Theorem 1.
Under Assumptions 1, 2 and 3, for y ( s ) = ζ ( s ) , s [ δ t 0 , t 0 ] , t 0 > 0 , there exists one unique global solution y ( t ) to Equation (1) on t [ δ t 0 , + ) .
Proof. 
According to Assumption 3, we can obtain that
L U ( y , z , t , i ) β 0 + β ˜ 1 | y G ( z , t , i ) | q + δ β ˜ 2 | z | q β 3 | y | α + δ β 4 | z | α ,
where β ˜ 1 = 2 q 1 β 1 0 and β ˜ 2 = 2 q 1 β 1 κ q δ 1 + β 2 0 . Moreover, since functions F , H and G satisfy Assumptions 1 and 2, by adopting the standing truncation technique, for ζ ( s ) L ( [ δ t 0 , t 0 ] ; R n ) , there exists a unique maximal local solution y ( t ) on [ δ t 0 , σ ) . Let b 0 be large enough for | | ψ | | b 0 . For arbitrary integer b b 0 , define the stopping time sequence
θ b = inf { t [ t 0 , σ ] : | y ( t ) | > b } .
Clearly, the sequence { θ b } keeps growing as b . Set θ = lim b + θ b , whence θ σ a.s. Noting that θ = a.s. means σ = a.s., we only need to prove θ = a.s. Firstly, we will claim that θ > t 0 δ a.s. Let u ( t ) = y ( t ) G ( y ( δ t ) , t , Υ ( t ) ) . By the It o ^ formula, for t [ t 0 , t 1 ] , we have that
E U ( u ( θ b t 1 ) , θ b t 1 , Υ ( θ b t 1 ) ) E U ( u ( t 0 ) , t 0 , Υ ( t 0 ) ) + E t 0 θ b t 1 [ β 0 + β ˜ 1 | u ( s ) | q + δ β ˜ 2 | y ( δ s ) | q β 3 | y ( s ) | α + δ β 4 | y ( δ s ) | α ] d s .
When t 1 [ t 0 , t 0 δ ] , on the basis of Assumption 3, we obtain that
d 1 E | u ( θ b t 1 ) | q Q 1 + E t 0 θ b t 1 β ˜ 1 | u ( s ) | q d s ,
where
Q 1 = E U ( u ( t 0 ) , t 0 , Υ ( t 0 ) ) + E t 0 t 0 δ [ β 0 + δ β ˜ 2 | y ( δ s ) | q + δ β 4 | y ( δ s ) | α ] d s d 2 2 q 1 ( 1 + κ q ) E | | ζ | | q + E δ t 0 t 0 [ β 0 δ 1 + β ˜ 2 | y ( s ) | q + β 4 | y ( s ) | α ] d s < + .
It implies that
E | u ( θ b t 1 ) | q Q 1 d 1 + 1 d 1 E t 0 θ b t 1 β ˜ 1 | u ( s ) | q d s , t 1 [ t 0 , t 0 δ ] .
By applying the Gronwall inequality, we have that
E | u ( θ b t 1 ) | q Q 1 d 1 e t 0 d 1 ( 1 δ 1 ) , t 1 [ t 0 , t 0 δ ] .
According to the elementary inequality | l 1 + l 2 | q | l 1 | q ( 1 υ ) q 1 + | l 2 | q υ q 1 , 0 < υ = κ < 1 , we infer that
E | y ( θ b t 1 ) | q sup t 0 t 1 t 0 δ E | u ( θ b t 1 ) | q ( 1 κ ) q + E | | ζ | | q 1 κ Q 1 e t 0 d 1 ( 1 δ 1 ) d 1 ( 1 κ ) q + E | | ζ | | q 1 κ = Q 1 , t 1 [ t 0 , t 0 δ ] .
In particular, when t 1 = t 0 δ , we have that E | y ( θ b t 0 δ ) | q Q 1 . It means that b q P { θ b t 0 δ } Q 1 . Letting b , we hence acquire that P { θ t 0 δ } = 0 , equivalently, P { θ > t 0 δ } = 1 . Let us proceed to prove θ > t 0 δ 2 a.s. For t 1 [ t 0 , t 0 δ 2 ] , according to Assumption 3, we have that
d 1 E | u ( θ b t 1 ) | q E U ( u ( θ b t 1 ) , θ b t 1 , Υ ( θ b t 1 ) ) Q 2 + E t 0 θ b t 1 β ˜ 1 | u ( s ) | q d s ,
where
Q 2 = d 2 E | u ( t 0 ) | q + E t 0 t 0 δ 2 [ β 0 + δ β ˜ 2 | y ( δ s ) | q + δ β 4 | y ( δ s ) | α ] d s Q 1 + E t 0 t 0 δ [ β 0 δ 1 + β ˜ 2 | y ( s ) | q + β 4 | y ( s ) | α ] d s < + .
Applying the Gronwall inequality yields that
E | u ( θ b t 1 ) | q Q 2 d 1 e t 0 d 1 ( 1 δ 2 1 ) , t 1 [ t 0 , t 0 δ 2 ] .
Similarly, we also have that
E | y ( θ b t 1 ) | q sup t 0 t 1 t 0 δ 2 E | u ( θ b t 1 ) | q ( 1 κ ) q + E | | ζ | | q 1 κ Q 2 e t 0 d 1 ( 1 δ 2 1 ) d 1 ( 1 κ ) q + E | | ζ | | q 1 κ = Q 2 , t 1 [ t 0 , t 0 δ 2 ] .
In particular, when t 1 = t 0 δ 2 , we have that E | y ( θ b t 0 δ 2 ) | q Q 2 . It means that b q P { θ b t 0 δ 2 } Q 2 . Letting b , we hence acquire that P { θ t 0 δ 2 } = 0 , equivalently, P { θ > t 0 δ 2 } = 1 . Repeating this procedure, we can show that P { θ > t 0 δ j } = 1 for any integer j 1 . Letting j yields that θ = + a.s. It means that the above conclusion holds. □
Remark 1.
In Theorem 1, the existence and uniqueness of the global solutions to NSPDEsMS are investigated by combining stochastic analysis techniques and the Gronwall inequality. Compared with the results in [14,15,16,17], the assumption condition is more general since all the parameters only need to satisfy β i 0 , i = { 0 , 1 , 2 , 3 , 4 } .
Lemma 1.
Let Assumption 2 be satisfied. Then, for q 1 ,
E | y ( t ) G ( y ( δ t ) , t , i ) | q ( 1 + κ ) q 1 sup δ t s t E | y ( s ) | q , t t 0 .
Proof. 
By utilizing the inequality | l 1 + l 2 | q ( 1 + υ ) q 1 ( | l 1 | q + | l 2 | q υ q 1 ) , we derive that
E | y ( t ) G ( y ( δ t ) , t , i ) | q ( 1 + υ ) q 1 ( E | y ( t ) q | + E | G ( y ( δ t ) , t , i ) | q υ q 1 ) ,
Noting Assumption 1, let υ = κ , we can obtain that
E | y ( t ) G ( y ( δ t ) , t , i ) | q ( 1 + κ ) q sup δ t s t E | y ( s ) | q .
Lemma 2.
Let Assumption 2 hold. If y ( t ) satisfies that
( 1 + t ) η E | y ( t ) G ( y ( δ t ) , t , i ) | q d 2 d 1 ( 1 + κ ) q ( 1 + t 0 ) η sup δ t 0 s t 0 E | y ( s ) | q , t 0 s c .
where c t 0 > 0 and 0 < η < q ln κ ln δ . Then,
( 1 + t ) η E | y ( t ) | q d 2 ( 1 + κ ) q ( 1 + t 0 ) η d 1 [ 1 κ ( 1 δ ) η q ] q sup δ t 0 s t 0 E | y ( s ) | q , δ t 0 t c .
Proof. 
Based on the inequality | l 1 + l 2 | q ( 1 + ε ) q 1 ( | l 1 | q + | l 2 | q ε q 1 ) , ε ( 0 , 1 ) , we can derive that
( 1 + t ) η E | y ( t ) | q ( 1 + t ) η E | y ( t ) G ( y ( δ t ) , t , i ) | q ( 1 ε ) q 1 + κ q E | y ( δ t ) | q ε q 1 d 2 d 1 ( 1 + κ ) q ( 1 + t 0 ) η sup δ t 0 s t 0 E | y ( s ) | q ( 1 ε ) q 1 + κ q ε q 1 ( 1 + t 1 + δ t ) η ( 1 + δ t ) η E | y ( δ t ) | q d 2 d 1 ( 1 + κ ) q ( 1 + t 0 ) η sup δ t 0 s t 0 E | y ( s ) | q ( 1 ε ) q 1 + κ q ε q 1 ( 1 δ ) η sup δ t 0 s z ( 1 + s ) η E | y ( t ) | q , t [ t 0 , c ] .
When t [ δ t 0 , t 0 ] , the above inequality still holds. Furthermore, we have that
sup δ t 0 s c ( 1 + s ) η E | y ( s ) | q d 2 d 1 ( 1 + κ ) q ( 1 + t 0 ) η sup δ t 0 s t 0 E | y ( s ) | q ( 1 ε ) q 1 + κ q ε q 1 ( 1 δ ) η sup δ t 0 s c ( 1 + s ) η E | y ( t ) | q .
Letting ε = κ ( 1 δ ) η q , we see that
sup δ t 0 s c ( 1 + s ) η E | y ( s ) | q d 2 d 1 ( 1 + κ ) q ( 1 + t 0 ) η [ 1 κ ( 1 δ ) η q ] q sup δ t 0 s t 0 E | y ( s ) | q .
Theorem 2.
Let Assumptions 1, 2 and 4 hold. If there exist two constants μ > 0 , λ > 0 such that
E L U ( y ( t ) , y ( δ t ) , t , i ) μ E U ( y ( t ) G ( y ( δ t ) , t , i ) , t , i ) , i S ,
for all t t 0 and function U satisfying
E min 1 i N U ( y ( δ t ) , δ t , i ) λ E max 1 i N U ( y ( t ) G ( y ( δ t ) , t , i ) , i , t ) ,
then, for ζ ( s ) L F t 0 q , the solution y ( t ; ζ ) to Equation (1) has the property
E | y ( t ) | q λ ( 1 + κ ) q ( 1 + t 0 ) η ˜ sup δ t 0 s t 0 E | y ( s ) | q ( 1 + t ) η ˜ ,
i.e.,
lim t + sup ln E | y ( t ) | q ln ( 1 + t ) η ˜ ,
where η ˜ = min μ , 1 ln 1 δ ln λ 1 ( 1 + κ λ 1 1 q ) q and λ 1 = d 1 d 2 λ > 1 ( 1 κ ) q .
Proof. 
Let η ( 0 , η ˜ ) . Firstly, we will claim that
( 1 + t ) η E U ( y ( t ) G ( y ( δ t ) , t , Υ ( t ) ) , t , Υ ( t ) ) d 2 ( 1 + κ ) p ( 1 + t 0 ) η sup δ t 0 s t 0 E | y ( t ) | q , t t 0 .
When t = t 0 , by Lemma 1, we have that
( 1 + t ) η E U ( y ( t 0 ) G ( y ( δ t 0 ) , t 0 , Υ ( t 0 ) ) ) d 2 ( 1 + t 0 ) η E | y ( t 0 ) G ( y ( δ t 0 ) , t 0 , Υ ( t 0 ) ) | q d 2 ( 1 + κ ) q ( 1 + t 0 ) η sup δ t 0 s t 0 E | y ( s ) | q .
For t > t 0 , if assertion (5) does not hold, then we can find a constant χ 0 satisfying
( 1 + t ) η E U ( y ( t ) G ( y ( δ t ) , t , Υ ( t ) ) , t , Υ ( t ) ) d 2 ( 1 + κ ) q ( 1 + t 0 ) η sup δ t 0 s t 0 E | y ( s ) | q , t < χ 0 .
and
( 1 + δ 0 ) η E U ( y ( δ 0 ) G ( y ( δ χ 0 ) , χ 0 , Υ ( χ 0 ) ) , χ 0 , Υ ( χ 0 ) ) = d 2 ( 1 + κ ) q ( 1 + t 0 ) η sup δ t 0 s t 0 E | y ( s ) | q .
There exists a time sequence { t m } m 1 , t m > χ 0 , t m χ 0 such that
( 1 + t m ) η E U ( y ( t m ) G ( y ( t m ) , t m , Υ ( t m ) ) , t m , Υ ( t m ) ) > d 2 ( 1 + κ ) q ( 1 + t 0 ) q sup δ t 0 s t 0 E | y ( s ) | q .
Therefore, when δ χ 0 [ δ t 0 , χ 0 ] , combining (7), (8) and Lemma 2 result in that
E [ min 1 i N U ( y ( δ χ 0 ) , δ χ 0 , i ) ] E U ( y ( δ χ 0 ) , δ χ 0 , Υ ( δ χ 0 ) ) = ( 1 + δ χ 0 ) η ( 1 + δ χ 0 ) η E U ( y ( δ χ 0 ) , δ χ 0 , Υ ( δ χ 0 ) ) d 2 ( 1 + δ χ 0 ) η ( 1 + δ χ 0 ) η E | y ( δ χ 0 ) | q d 2 ( 1 + δ χ 0 ) η d 2 d 1 ( 1 + κ ) q ( 1 + t 0 ) η [ 1 κ ( 1 δ ) η q ] q sup δ t 0 s t 0 E | y ( s ) | q d 2 ( 1 + χ 0 ) η d 1 ( 1 + δ χ 0 ) η 1 [ 1 κ ( 1 δ ) η q ] q E U ( y ( χ 0 ) G ( y ( δ χ 0 ) , χ 0 , Υ ( χ 0 ) ) , χ 0 , Υ ( χ 0 ) ) d 2 ( 1 δ ) η d 1 [ 1 κ ( 1 δ ) η q ] q E U ( y ( χ 0 ) G ( y ( δ χ 0 ) , χ 0 , Υ ( χ 0 ) ) , χ 0 , Υ ( χ 0 ) ) .
Since η < 1 ln 1 δ ln λ 1 ( 1 + κ λ 1 1 q ) q , it means that ( 1 δ ) η < λ 1 ( 1 + κ λ 1 1 q ) q , i.e., ( 1 δ ) η q < λ 1 1 q 1 + κ λ 1 1 q . Furthermore, it can be inferred that 1 κ ( 1 δ ) η q 1 κ λ 1 1 q 1 + κ λ 1 1 q = 1 1 + κ λ 1 1 q . Therefore,
( 1 δ ) η < λ 1 ( 1 + κ λ 1 1 q ) q < λ 1 [ 1 κ ( 1 δ ) η q ] q = d 1 d 2 λ [ 1 κ ( 1 δ ) η q ] q ,
which implies that d 2 d 1 ( 1 δ ) η [ 1 κ ( 1 δ ) η q ] q < λ . It follows from Equation (10) that
E min 1 i N U ( y ( δ χ 0 ) , δ χ 0 , i ) λ E U ( y ( χ ) G ( y ( δ χ 0 ) , χ 0 , Υ ( χ 0 ) ) , χ 0 , Υ ( χ 0 ) ) λ E max 1 i N U ( y ( χ 0 ) G ( y ( δ χ 0 ) , χ 0 , i ) , i , χ 0 ) .
Accordingly, we have
E L U ( y ( χ 0 ) , y ( δ χ 0 ) , χ 0 , i ) μ E U ( y ( χ 0 ) G ( y ( δ χ 0 ) , χ , i ) , χ 0 , i ) , i S ,
Since η < μ and functions F , H , G keep continuous, one sufficiently small h > 0 can be found such that
E L U ( y ( t ) , y ( δ t ) , t , i ) η E U ( y ( t ) G ( y ( δ t ) , t , i ) , t , i ) , i S , t [ χ 0 , χ 0 + h ] .
Applying the It o ^ formula yields that
( 1 + χ 0 + h ) η E U ( y ( χ 0 + h ) G ( y ( q ( χ 0 + h ) ) , χ 0 + h , Υ ( χ 0 + h ) ) , χ 0 + h , Υ ( χ 0 + h ) ) d 2 ( 1 + κ ) q sup δ t 0 s t 0 E | y ( s ) | q = χ 0 χ 0 + h ( 1 + s ) η η 1 + s E U ( y ( s ) G ( y ( δ s ) , s , Υ ( s ) ) , s , Υ ( s ) ) + E L U ( y ( s ) , y ( δ s ) , s , Υ ( s ) ) d s = χ 0 χ 0 + h ( 1 + s ) η η 1 + s η E U ( y ( s ) G ( y ( δ s ) , s , Υ ( s ) ) , s , Υ ( s ) ) d s 0 ,
which contradicts Equation (9). Therefore, we obtain that
( 1 + t ) η E U ( y ( t ) G ( y ( δ t ) , t , Υ ( t ) ) , t , Υ ( t ) ) d 2 ( 1 + κ ) q ( 1 + t 0 ) η sup δ t 0 s t 0 E | y ( s ) | q .
By Lemma 2, we have that
( 1 + t ) η E | y ( t ) | q λ ( 1 + κ ) q ( 1 + t 0 ) η sup δ t 0 s t 0 E | y ( s ) | q .
Letting η η ˜ , we obtain that ( 1 + t ) η ˜ E | y ( t ) | q λ ( 1 + κ ) q ( 1 + t 0 ) η ˜ sup δ t 0 s t 0 E | y ( s ) | q , which implies
lim t + sup ln E | y ( t ) | q ln ( 1 + t ) η ˜ .
Remark 2.
In Theorem 2, if all conditions are satisfied except condition (4) which is replaced by the stronger condition
E max 1 i N L U ( y ( t ) , y ( δ t ) , t , i ) μ E max 1 i N U ( y ( t ) G ( y ( δ t ) , t , i ) , t , i ) ,
then the assertion still holds. In fact, the above stronger condition is also difficult to be verified.
Remark 3.
It is noted that all the existing stability results [20,21,22,23] require that the coefficients of the delay term be time varying, but the restriction in this paper is removed and the coefficients may keep constant. Theorem 2 also generalizes the theory in [35,44] to NSFDEsMS. In [45], an efficient method based on the generalized hat functions for solving nonlinear stochastic differential equations driven by the multi-fractional Gaussian noise was proposed, and the theory was applied to some stochastic population models. Moreover, dynamic properties of stochastic pantograph systems with multi-fractional Gaussian noise are worthy of exploration.
Lemma 3.
Suppose that Assumption 2 is satisfied. Let q > 1 . If there are two positive constants η and M 1 satisfying
0 < η < 1 ln 1 δ ln 1 κ q ,
and
y ( t ) G ( y ( δ t ) , t , Υ ( t ) ) M 1 ( 1 + t ) η , t t 0 ,
then we have that
lim t + sup ln | y ( t ) | ln ( 1 + t ) η q a . s .
Proof. 
For T > 0 , When t [ t 0 , T ] , we can find one constant υ ( 0 < υ < 1 ) such that
( 1 + t ) η | y ( t ) | q ( 1 + t ) η | y ( t ) G ( y ( δ t ) , t , Υ ( t ) ) | q ( 1 υ ) q 1 + | G ( y ( δ t ) , t , Υ ( t ) ) | q υ q 1 M 1 ( 1 υ ) q 1 + κ q υ q 1 1 + t 1 + δ t η ( 1 + δ t ) η | y ( δ t ) | q .
We have that
sup δ t 0 t T ( 1 + t ) η | y ( t ) | q M 1 ( 1 υ ) q 1 + sup δ t 0 t t 0 | y ( t ) | q + κ q ( 1 δ ) η υ q 1 sup t 0 t T ( 1 + δ t ) η | y ( δ t ) | q M 1 ( 1 υ ) q 1 + sup δ t 0 t t 0 | y ( t ) | q + κ q ( 1 δ ) η υ q 1 sup δ t 0 t T ( 1 + t ) η | y ( t ) | q .
Since η < 1 ln 1 δ ln 1 κ q , i.e., ( 1 δ ) η κ q < 1 , by choosing υ = ( 1 δ ) η q κ , we obtain that
sup δ t 0 t T ( 1 + t ) η | y ( t ) | q M 2 1 ( 1 δ ) η q κ ,
where M 2 = M 1 ( 1 ε ) q 1 + sup δ t 0 t t 0 | y ( t ) | q . It means that
lim t sup ln | y ( t ) | ln ( 1 + t ) η q a . s .
Theorem 3.
Let U ( y , t , i ) = y 2 . Let q 2 and σ 0 ( 1 , η ˜ ) . Suppose that there is one constant L > 0 satisfying | H ( y , z , t , i ) | L ( | y | + | z | ) . If all the conditions of Theorem 2 hold, then
lim t + sup ln | y ( t ) | ln ( 1 + t ) η ˜ σ 0 q a . s .
Proof. 
For convenience, let u ( t ) = y ( t ) G ( y ( δ t ) , t , Υ ( t ) ) . For any positive integer n 0 , by using the It o ^ formula, we compute that
E sup δ n t 0 t δ ( n + 1 ) t 0 | u ( t ) | q E | u ( δ n t 0 ) | q + E sup δ n t 0 t δ ( n + 1 ) t 0 δ n t 0 t L U ( y ( s ) , y ( δ s ) , s , Υ ( s ) ) d s + E sup δ n t 0 t δ ( n + 1 ) t 0 δ n t 0 t U x ( u ( s ) , s , Υ ( s ) ) H ( y ( s ) , y ( δ s ) , s , Υ ( s ) ) d s = E | u ( δ n t 0 ) | q + I 1 + I 2 .
Noting that L U ( y , z , t , Υ ( t ) ) β 1 | y | q + β 2 δ | z | q , β 1 0 , β 2 0 , we acquire that
I 1 δ n t 0 δ ( n + 1 ) t 0 [ β 1 | y ( s ) | q + β 2 δ | y ( δ s ) | q ] d s .
On the other hand, by using BDG inequality, we have that
I 2 C q E δ n t 0 δ ( n + 1 ) t 0 | U x ( u ( s ) , s , Υ ( s ) ) H ( y ( s ) , y ( δ s ) , s , Υ ( s ) ) | 2 d s 1 2 q C q L E δ n t 0 δ ( n + 1 ) t 0 | u ( s ) | 2 q 2 ( | y ( s ) | + | y ( δ s ) | ) 2 d s 1 2 q C q L E ( ε sup δ n t 0 t δ ( n + 1 ) t 0 | u ( s ) | q ) 1 2 ( 1 ε δ n t 0 δ ( n + 1 ) t 0 | u ( s ) | q 2 ( | y ( s ) | + | y ( δ s ) | ) 2 d s ) 1 2 .
Applying the Young inequality to the above equation yields that
I 2 ε q C q L 2 sup δ n t 0 t δ ( n + 1 ) t 0 | u ( s ) | q + 2 ( q 3 ) 0 q C q L 2 ε δ n t 0 δ ( n + 1 ) t 0 | y ( s ) | q 2 + κ q 2 | y ( δ s ) | q 2 ( 2 | y ( s ) | 2 + 2 | y ( δ s ) | 2 ) d s .
Choose ε = 1 q C q L . Then,
I 2 1 2 sup δ n t 0 t δ ( n + 1 ) t 0 | u ( s ) | q + 2 ( q 3 ) 0 ( q C q L ) 2 δ n t 0 δ ( n + 1 ) t 0 [ ( 1 + ( q 2 ) + 2 κ q 2 q ) | y ( s ) | q + ( 1 + ( q 2 ) κ q 2 + 2 q ) | y ( δ s ) | q ] d s .
Substituting I 1 and I 2 into Equation (20), we have
E sup δ n t 0 t δ ( n + 1 ) t 0 | u ( s ) | q M 1 E | u ( δ n t 0 ) | q + M 2 δ n t 0 δ ( n + 1 ) t 0 | y ( s ) | q d s + M 3 δ n t 0 δ ( n + 1 ) t 0 | y ( δ s ) | q d s ,
where M 1 = 2 , M 2 = 2 ( q 3 ) 0 + 2 q 2 C q 2 L 2 + 2 β 1 , M 3 = 2 ( q 3 ) 0 + 2 q 2 C q 2 L 2 + 2 β 2 δ . When Theorem 2 holds, we obtain that
E | u ( t ) | q d 2 d 1 ( 1 + κ ) q ( 1 + t 0 ) η ˜ sup δ t 0 s t 0 E | y ( s ) | q ( 1 + t ) η ˜ ,
and
E | y ( t ) | q λ ( 1 + κ ) q ( 1 + t 0 ) η ˜ sup δ t 0 s t 0 E | y ( s ) | q ( 1 + t ) η ˜ .
Substituting Equations (24) and (25) into Equation (23) yields that
E [ sup δ n t 0 t δ ( n + 1 ) t 0 | y ( s ) | q ] M 4 ( 1 + δ n t 0 ) η ˜ + M 5 δ n t 0 δ ( n + 1 ) t 0 ( 1 + s ) η ˜ d s + M 6 δ ( n + 1 ) t 0 δ n t 0 ( 1 + s ) η ˜ d s ,
where M 4 = M 1 ( 1 + t 0 ) η ˜ ( 1 + κ ) q sup δ t 0 s t 0 E | y ( s ) | q , M 5 = λ ( 1 + κ ) q ( 1 + t 0 ) η ˜ sup δ t 0 s t 0 E | y ( s ) | p M 2 , and M 6 = λ M 3 ( 1 + κ ) q ( 1 + t 0 ) η ˜ sup δ t 0 s t 0 E | y ( s ) | q . According to Chebyshev’s inequality, we obtain that
P sup δ n t 0 t δ ( n + 1 ) t 0 | u ( t ) | q > ( 1 + δ n t 0 ) ( η ˜ σ 0 ) ( 1 + δ n t 0 ) ( η ˜ σ 0 ) E sup δ n t 0 t δ ( n + 1 ) t 0 | u ( t ) | q ( 1 + δ n t 0 ) σ 0 M 4 + M 5 ( δ ( n + 1 ) t 0 δ n t 0 ) + M 6 ( δ n t 0 δ ( n 1 ) t 0 ) = Φ ( n ) .
Noting σ 0 ( 1 , η ˜ ) , we have that
n = 0 Φ ( n ) = [ M 4 + M 5 ( δ 1 1 ) + M 6 ( 1 δ ) ] n = 0 ( 1 + δ n t 0 ) σ 0 δ n < ,
By utilizing the Borel–Cantelli lemma, there exists one set Ω 0 with P ( Ω 0 ) = 1 and one integer n 0 ( ω ) > 0 , for n > n 0 ( ω ) , ω Ω 0 and δ n t 0 t δ ( n + 1 ) t 0 , satisfying that
| u ( t ) | q = | y ( t ) G ( y ( δ t ) , t , Υ ( t ) ) | q ( 1 + δ n t 0 ) ( η ˜ σ 0 ) ( 1 δ ) η ˜ σ 0 ( 1 + t ) ( η ˜ σ 0 ) .
By Lemma 3, we can conclude that
lim t + sup ln | y ( t ) | ln ( 1 + t ) η ˜ σ 0 q a . s .

4. Examples

In this section, two examples are exhibited to show the validity of the proposed theoretical results.
Example 1.
Consider the following NSPDEsMS
d [ y ( t ) G ( y ( δ t ) , t , Υ ( t ) ) ] = F ( y ( t ) , y ( δ t ) , t , Υ ( t ) ) d t + = H ( y ( t ) , y ( δ t ) , t , Υ ( t ) ) d w ( t ) ,
where δ = 0.2 , Υ ( t ) denotes one Markov chain taking values in S = { 1 , 2 } with the generator
Γ = 4 4 5 5 .
Here,
G ( y ( 0.2 t ) , i , t ) = 0.4 y ( 0.2 t ) , i = 1 , 0.3 y ( 0.2 t ) , i = 2 .
F ( y ( t ) , y ( 0.2 t ) , t , i ) = 12 [ y ( t ) 0.4 y ( 0.2 t ) ] [ y ( t ) 0.4 y ( 0.2 t ) ] 3 + 0.5 y ( 0.2 t ) , i = 1 , 10 [ y ( t ) 0.3 y ( 0.2 t ) ] + 0.6 y ( 0.2 t ) , i = 2 .
H ( y ( t ) , y ( 0.2 t ) , t , i ) = 0.6 y ( 0.2 t ) , i = 1 , 0.5 y ( 0.2 t ) , i = 2 .
We choose
U ( y , i , t ) = y 2 .
By computing, one obtains that
L U ( y ( t ) , y ( 0.2 t ) , t , 1 ) 23.5 [ y ( t ) 0.4 x ( 0.2 t ) ] 2 + 0.86 y 2 ( 0.2 t ) ,
L U ( y ( t ) , y ( 0.2 t ) , t , 2 ) 19.4 [ y ( t ) 0.3 x ( 0.2 t ) ] 2 + 0.85 y 2 ( 0.2 t ) .
Furthermore, when
U ( y ( 0.2 t ) , t , i ) λ U [ y ( t ) G ( y ( 0.2 t ) , t , i ) , t , i ] ,
by choosing λ = 20 , we have that
E L U ( y , i , t ) [ 19.4 + 0.86 × 20 ] U ( y ( t ) G ( y ( 0.2 t ) , i , t ) , i , t ) 2.2 U ( y ( t ) G ( y ( 0.2 t ) , i , t ) ) .
Let η ˜ = min { μ , 1 ln 1 δ ln λ 1 ( 1 + κ λ 1 1 q ) q } = min { 2.2 , 1 ln 5 ln 20 ( 1 + 0.2 × 20 0.5 ) } = 1.0674 > 1 . According to Theorems 2 and 3, we can deduce that the above system is polynomially stable in mean square and almost surely polynomially stable.
Example 2.
Consider the two-dimensional system
d [ y ( t ) G ( y ( 0.6 t ) , t , Υ ( t ) ) ] = [ A ( Υ ( t ) ) y ( t ) + B ( Υ ( t ) ) y ( 0.3 t ) ] d t + C Υ ( t ) y ( 0.3 t ) d w ( t ) ,
where Υ ( t ) denotes one Markov chain with the generator
Γ = 1 1 3 3 .
Meanwhile,
G ( y ( 0.6 t ) , i , t ) = 0.3 y 1 ( 0.6 t ) 0.3 y 2 ( 0.6 t ) .
A ( 1 ) = A 1 = 4 0.2 0.1 0.4 , B ( 1 ) = B 1 = 1.5 0.34 0.17 1.7 , C ( 1 ) = C 1 = 0.1 0.3 0.4 0.2 ,
A ( 2 ) = A 2 = 0.3 0.5 0.6 3 , B ( 2 ) = B 2 = 1.1 0.05 0.12 1.1 , C ( 2 ) = C 2 = 0.4 0.1 0.1 0.5 .
We choose the Lyapunov function
U ( y , i , t ) = θ i [ ( y 1 G ( y 1 ( 0.6 t ) , i , t ) ) 2 + ( y 2 G ( y 2 ( 0.6 t ) , i , t ) ) 2 ] , i = 1 , 2 .
Let θ 1 = 2 , θ 2 = 3 , d 1 = 2 , d 2 = 3 , λ = 6 , λ 1 = 4 . If
U ( y , i , t ) λ U [ y ( t ) G ( y ( 0.6 t ) , i , t ) , i , t ] ,
then we have
L U ( y ( t ) , y ( 0.6 t ) , t , i ) { λ max [ A i + A i T + I + 1 θ i i = 1 2 r i j θ j I ] + λ λ m a x 2 [ ( 0.3 A i + B i ) T ( 0.3 A i + B i ) + C i T C i ] } U ( y ( t ) G ( y ( 0.6 t ) , t , i ) , t , i ) .
We compute that
L U ( y ( t ) , y ( 0.6 t ) , t , 1 ) ( 7.7 + 6.1626 ) U ( y ( t ) G ( y ( 0.6 t ) , t , 1 ) , t , 1 ) 1.5374 U ( y ( t ) G ( y ( 0.6 t ) , t , 1 ) , t , 1 ) ,
and
L U ( y ( t ) , y ( 0.6 t ) , t , 2 ) 2.0404 U ( y ( t ) G ( y ( 0.6 t ) , t , 2 ) , t , 2 ) ,
which indicates that
L U ( y ( t ) , y ( 0.6 t ) , t , i ) 1.5 U ( y ( t ) G ( y ( 0.6 t ) , i , t ) , t , i ) .
Let μ = 1.5 . Noting that
1 ln 1 δ ln λ 1 ( 1 + κ λ 1 1 q ) q = 1 ln 1 0.6 ln 4 ( 1 + 0.6 ) 2 = 0.8737 ,
then η ˜ = min μ , 1 ln 1 δ ln λ 1 ( 1 + κ λ 1 1 q ) q = min { 1.5 , 0.8737 } = 0.8737 < 1 . Hence, according to Theorems 2 and 3, we can conclude that the above system is polynomially stable in mean square rather than almost surely polynomially stable.

5. Conclusions

In this paper, the new Razumikhin theorem on the qth moment polynomial stability of NSPDEsMS is established. Furthermore, combining with several stochastic analysis techniques, the almost sure polynomial stability of NSPDEsMS is explored. In the end, the effectiveness of the main results is demonstrated through two concrete examples. In years to come, our theoretical work can be further generalized to the SPDEs with L e ´ vy noise or neural network systems.

Author Contributions

Formal analysis, C.Z.; Funding acquisition, Y.S.; Investigation, Z.Z.; Methodology, Z.Z.; Project administration, Y.S.; Supervision, Y.S.; Writing—review & editing, C.Z. All authors have read and agreed to the published version of the manuscript.

Funding

This research is jointly supported by the National Natural Science Foundation of China (62076039, 61803046) and the Natural Science Foundation of Hubei Province (2021CFB543).

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Mao, X. Stochastic Differential Equations and Applications; Horwood Publishing: Chichester, UK, 1997. [Google Scholar]
  2. Liu, K.; Xia, X. On the exponential stability in mean square of neutral stochastic functional differential equations. Syst. Control Lett. 1999, 37, 207–215. [Google Scholar] [CrossRef]
  3. Shaikhet, L. Some new aspects of Lyapunov-type theorems for stochastic differential equations of neutral type. Siam J. Control Optim. 2010, 48, 4481–4499. [Google Scholar] [CrossRef]
  4. Jovanovic, M.; Jankovic, S. Neutral stochastic functional differential equations with additive perturbations. Appl. Math. Comput. 2009, 213, 370–379. [Google Scholar] [CrossRef]
  5. Jiang, F.; Shen, Y.; Wu, F. A note on order of convergence of numerical method for neutral stochastic functional differential equations. Commun. Nonlinear Sci. Numer. Simulat. 2012, 17, 1194–1200. [Google Scholar] [CrossRef]
  6. Wang, Q.; Chen, H.; Yuan, C. A note on exponential stability for numerical solution of neutral stochastic functional differential equations. Mathematics 2022, 10, 866. [Google Scholar] [CrossRef]
  7. Chen, H.; Shi, P.; Lim, C. Exponential synchronization for markovian stochastic coupled neural networks of neutral-type via adaptive feedback control. IEEE Trans. Neural Netw. Learn. Syst. 2017, 28, 1618–1632. [Google Scholar] [CrossRef]
  8. Mao, X.; Yuan, C. Stochastic Differential Equations with Markovian Switching; Imperial College Press: London, UK, 2006. [Google Scholar]
  9. Ji, Y.; Chizeck, H.J. Controllability, stabilizability and continuous-time markovian jump linear quadratic control. IEEE Trans. Autom. Control 1990, 35, 777–788. [Google Scholar] [CrossRef]
  10. Li, X.; Mao, X. A note on almost sure asymptotic stability of neutral stochastic delay differential equations with Markovian switching. Automatica 2012, 48, 2329–2334. [Google Scholar] [CrossRef]
  11. Ockendon, J.R.; Tayler, A.B. The dynamics of a current collection system for an electric locomotive. Proc. R. Soc. Lond. A 1971, 322, 447–468. [Google Scholar]
  12. Wang, X.; Park, J.H.; Yang, H.; Zhong, S. Delay-Dependent Stability Analysis for Switched Stochastic Networks with Proportional Delay. IEEE Trans. Cybern. 2020, 52, 6369–6378. [Google Scholar] [CrossRef]
  13. Wang, J.; Wang, X.; Wang, Y.; Zhang, X. Non-reduced order method to global h-stability criteria for proportional delay high-order inertial neural networks. Appl. Math. Comput. 2021, 407, 126308. [Google Scholar] [CrossRef]
  14. Zhou, L.; Zhao, Z. Global polynomial periodicity and polynomial stability of proportional delay Cohen–Grossberg neural networks. ISA Trans. 2021, 122, 205–217. [Google Scholar] [CrossRef] [PubMed]
  15. Luo, D.; Jiang, Q.; Wang, Q. Anti-periodic solutions on Clifford-valued high-order Hopfield neural networks with multi-proportional delays. Neurocomputing 2022, 472, 1–11. [Google Scholar] [CrossRef]
  16. Xiao, Q.; Huang, T.; Zeng, Z. Synchronization of Timescale-type nonautonomous neural networks with proportional delays. IEEE Trans. Syst. Man Cybern. A 2021, 52, 2168–2216. [Google Scholar] [CrossRef]
  17. Padmaja, N.; Balasubramaniam, P. New delay and order-dependent passivity criteria for impulsive fractional-order neural networks with switching parameters and proportional delays. Neurocomputing 2021, 454, 113–123. [Google Scholar] [CrossRef]
  18. Fan, Z.; Liu, M.; Cao, W. Existence and uniqueness of the solutions and convergence of semi-implicit Euler methods for stochastic pantograph equations. J. Math. Anal. Appl. 2007, 325, 1142–1159. [Google Scholar] [CrossRef]
  19. Appleby, J.; Buckwar, E. Sufficient conditions for polynomial asymptotic behaviour of the stochastic pantograph equation. Electron. J. Qual. Theory 2016, 45, 1–32. [Google Scholar]
  20. Liu, L.; Deng, F. pth moment exponential stability of highly nonlinear neutral pantograph stochastic differential equations driven by Lévy noise. Appl. Math. Lett. 2018, 86, 313–319. [Google Scholar] [CrossRef]
  21. Shen, M.; Fei, W.; Mao, X.; Deng, S. Exponential stability of highly nonlinear neutral pantograph stochastic differential equation. Asian J. Control 2020, 22, 436–448. [Google Scholar] [CrossRef]
  22. Caraballo, T.; Mchiri, L.; Mohsen, B.; Rhaima, M. pth moment exponential stability of neutral stochastic pantograph differential equations with Markovian switching. Commun. Nonlinear Sci. Numer. Simulat. 2021, 102, 105916. [Google Scholar] [CrossRef]
  23. Mao, W.; Hu, L.; Mao, X. Almost sure stability with general decay rate of neutral stochastic pantograph equations with Markovian switching. Electron. J. Qual. Theory Differ. Equ. 2019, 52, 1–17. [Google Scholar] [CrossRef]
  24. Razumikhin, B.S. On the stability of systems with a delay. Prikl. Mat. Mekh. 1956, 20, 500–512. [Google Scholar]
  25. Razumikhin, B.S. Application of Lyapunov’s method to problems in the stability of systems with a delay. Avtomat. I. Telemekh. 1960, 21, 740–749. [Google Scholar]
  26. Mao, X. Razumikhin-type theorems on exponential stability of stochastic functional differential equations. Stoch. Proc. Appl. 1996, 65, 233–250. [Google Scholar] [CrossRef] [Green Version]
  27. Zong, X.; Lei, D.; Wu, F. Discrete Razumikhin-type stability theorems for stochastic discrete-time delay systems. J. Frankl. Inst. 2018, 355, 8245–8265. [Google Scholar] [CrossRef]
  28. Mao, X. Razumikhin-type theorems on exponential stability of neutral stochastic functional differential equations. SIAM J. Math. Anal. 1997, 28, 389–401. [Google Scholar] [CrossRef]
  29. Janković, S.; Randjelović; Jovanović, J. Razumikhin-type exponential stability criteria of neutral stochastic functional differential equations. J. Math. Anal. Appl. 2009, 355, 811–820. [Google Scholar] [CrossRef]
  30. Huang, L.; Deng, F. Razumikhin-type theorems on stability of neutral stochastic functional differential equations. IEEE Trans. Automat. Control 2008, 53, 1718–1723. [Google Scholar] [CrossRef]
  31. Pavlović, G.; Janković, S. The Razumikhin approach on general decay stability for neutral stochastic functional differential equations. J. Frankl. Inst. 2013, 350, 2124–2145. [Google Scholar] [CrossRef]
  32. Zhou, S.; Hu, S. Razumikhin-type theorems of neutral stochastic functional differential equations. Acta Math. Sci. 2009, 29, 181–190. [Google Scholar]
  33. Song, Y.; Zeng, Z. Razumikhin-type theorems on pth moment boundedness of neutral stochastic functional differential equations with Makovian switching. J. Frankl. Inst. 2018, 355, 8296–8312. [Google Scholar] [CrossRef]
  34. Wu, F.; Hu, S. Razumikhin-type theorems for neutral stochastic functional differential equations with unbounded delay. Acta Math. Sci. 2011, 31, 1245–1258. [Google Scholar]
  35. Yu, Z. Razumikhin-type theorem and mean square asymptotic behavior of the backward Euler method for neutral stochastic pantograph equations. J. Inequalities Appl. 2013, 229, 2–15. [Google Scholar] [CrossRef]
  36. Mao, X. Polynomial stability for perturbed stochastic differential equations with respect to semimartingales. Stoch. Proc. Appl. 1992, 41, 101–116. [Google Scholar] [CrossRef]
  37. Liu, K.; Chen, A. Moment decay rates of solutions of stochastic differential equations. Tohoku Math. J. 2001, 53, 81–93. [Google Scholar] [CrossRef]
  38. Lan, G.; Xia, F.; Wang, Q. Polynomial stability of exact solution and a numerical method for stochastic differential equations with time-dependent delay. J. Comput. Appl. Math. 2019, 346, 340–356. [Google Scholar] [CrossRef] [Green Version]
  39. Hu, L.; Mao, X.; Shen, Y. Stability and boundedness of nonlinear hybrid stochastic differential delay equations. Syst. Control Lett. 2013, 62, 178–187. [Google Scholar] [CrossRef]
  40. Milošević, M. Existence, uniqueness, almost sure polynomial stability of solution to a class of highly nonlinear pantograph stochastic differential equations and the Euler–Maruyama approximation. Appl. Math. Comput. 2014, 237, 672–685. [Google Scholar]
  41. Milošević, M. Convergence and almost sure polynomial stability of the backward and forward–backward Euler methods for highly nonlinear pantograph stochastic differential equations. Math. Comput. Simulat. 2018, 150, 25–48. [Google Scholar] [CrossRef]
  42. Guo, P.; Liu, M.; He, Z.; Jia, H. Stability of numerical solutions for the stochastic pantograph differential equations with variable step size. J. Comput. Appl. Math. 2021, 388, 325–342. [Google Scholar] [CrossRef]
  43. Mao, W.; Hu, L.; Mao, X. The asymptotic stability of hybrid stochastic systems with pantograph delay and non-Gaussian Lévy noise. J. Frankl. Inst. 2020, 357, 1174–1198. [Google Scholar] [CrossRef]
  44. Mao, W.; Hu, L.; Mao, X. Razumikhin-type theorems on polynomial stability of hybrid stochastic systems with pantograph delay. Discret. Contin. Dyn. Syst. 2020, 25, 3217–3232. [Google Scholar] [CrossRef]
  45. Eftekhari, T.; Rashidinia, J. A novel and efficient operational matrix for solving nonlinear stochastic differential equations driven by multi-fractional Gaussian noise. Appl. Math. Comput. 2022, 429, 127218. [Google Scholar] [CrossRef]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Zou, Z.; Song, Y.; Zhao, C. Razumikhin Theorems on Polynomial Stability of Neutral Stochastic Pantograph Differential Equations with Markovian Switching. Mathematics 2022, 10, 3048. https://doi.org/10.3390/math10173048

AMA Style

Zou Z, Song Y, Zhao C. Razumikhin Theorems on Polynomial Stability of Neutral Stochastic Pantograph Differential Equations with Markovian Switching. Mathematics. 2022; 10(17):3048. https://doi.org/10.3390/math10173048

Chicago/Turabian Style

Zou, Zihan, Yinfang Song, and Chi Zhao. 2022. "Razumikhin Theorems on Polynomial Stability of Neutral Stochastic Pantograph Differential Equations with Markovian Switching" Mathematics 10, no. 17: 3048. https://doi.org/10.3390/math10173048

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