Next Article in Journal
New Results on the Sequence Spaces Inclusion Equations of the Form FE+Fx Where F, F′ ∈ {w0, w, w}
Next Article in Special Issue
Solvability, Approximation and Stability of Periodic Boundary Value Problem for a Nonlinear Hadamard Fractional Differential Equation with p-Laplacian
Previous Article in Journal
Existence, Uniqueness and the Multi-Stability Results for a W-Hilfer Fractional Differential Equation
Previous Article in Special Issue
A Proof of Chaos for a Seasonally Perturbed Version of Goodwin Growth Cycle Model: Linear and Nonlinear Formulations
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Weighted Pseudo-θ-Almost Periodic Sequence and Finite-Time Guaranteed Cost Control for Discrete-Space and Discrete-Time Stochastic Genetic Regulatory Networks with Time Delays

1
City College, Kunming University of Science and Technology, Kunming 650051, China
2
Department of Mathematics, Yunnan University, Kunming 650091, China
3
Department of Mathematics, Yuxi Normal University, Yuxi 653100, China
*
Authors to whom correspondence should be addressed.
Axioms 2023, 12(7), 682; https://doi.org/10.3390/axioms12070682
Submission received: 28 April 2023 / Revised: 30 June 2023 / Accepted: 6 July 2023 / Published: 11 July 2023
(This article belongs to the Special Issue Differential Equations in Applied Mathematics)

Abstract

:
This paper considers the dual hybrid effects of discrete-time stochastic genetic regulatory networks and discrete-space stochastic genetic regulatory networks in difference formats of exponential Euler difference and second-order central finite difference. The existence of a unique-weight pseudo- θ -almost periodic sequence solution for discrete-time and discrete-space stochastic genetic regulatory networks on the basis of discrete constant variation formulation is discussed, as well as the theory of semi-flow and metric dynamical systems. Furthermore, a finite-time guaranteed cost controller is constructed to reach global exponential stability of these discrete networks via establishing a framework of drive, response, and error networks. The results indicate that spatial diffusions of non-negative dense coefficients have no influence on the global existence of the unique weighted pseudo- θ -almost periodic sequence solution of the networks. The present study is a basic work in the consideration of discrete spatial diffusion in stochastic genetic regulatory networks and serves as a foundation for further study.

1. Introduction

Genetic regulatory networks (GRNs) have been widely recognized due to their possible usages [1]. GRNs are actually a complex dynamical system that describes the regulatory mechanisms of DNA, mRNA, and protein interactions in biological systems at the molecular level [2,3]. The analysis of genetic regulatory networks is not only an important way to understand and grasp the operation mechanisms of the activity of cellular life [4], but also has promising applications in the fields of disease genetic prediction and drug target screening [5,6,7,8]. For this reason, it is necessary and valuable to propose suitable mathematical models to represent expression mechanisms and signal transduction pathways. Currently, GRNs are generally modeled by Boolean models, Bayesian models, and differential equation models. Two of the most widely used models are Boolean models and differential equation models [9,10,11]. In particular, differential equations describe the concentration changes in proteins and mRNA [12,13]. This model has received more attention because of its higher accuracy and its ability to accurately describe the nonlinear dynamic behaviour of biological systems.
In general, the majority of models utilised to characterize GRNs in the currently available literature suppose that the concentrations of mRNAs and proteins are spatially homogeneous at all times. However, this assumption has some limitations, for example the diffusion phenomenon should be considered for the case of non-uniform distributions of gene product concentrations [14]. Therefore, the issue of kinetic analysis of GRNs with reaction–diffusion effects is worth investigating. Moreover, time delay is often inevitable due to the finite processing time of interactions among agents and may influence system performance. As of recently, a great deal of results on GRNs with time delays can be found in the literature, see, e.g., Han et al. [14], who established an asymptotic stability criterion for reaction–diffusion delayed GRNs under Dirichlet and Neumann boundary conditions, respectively, insightfully recognizing that diffusion–reaction information can reduce the conservation of the system. Robust state estimation of delayed genetic regulatory networks with reaction–diffusion terms and uncertainty terms under the Dirichlet boundary condition is considered by Zou et al. in [15]. Xie et al. [16] discuss the stability of genetic regulatory networks, centralised spatial diffusion, and discrete and infinite distribution delays.
During the processes of both computational simulation and analysis, engineers often use discrete-time continuous models to evaluate their structural behaviour. The signals received and operated in digital networks are dependent on discrete-time rather than continuous-time. Therefore, discrete-time GRNs have been studied by many authors. For example, Xue et al. [17] investigate the problems of state boundary description and reachable set estimation for discrete-time delayed genetic regulatory networks with bounded perturbations. Liu et al. [18] study the problem of exponential stability analysis of discrete genetic regulatory networks with time-varying discrete-time delays and unbounded distributed time delays. Yue et al. [19] investigate the dynamics of discrete-time genetic models and obtain conditions for the existence and stability of fixed points. It is shown that the discrete-time genetic network undergoes fold bifurcation, flip bifurcation, and Neimark–Sacker bifurcation, illuminating the richer dynamical properties of the discrete-time genetic model than the original continuous-time model. It is worth noting that most of the results on GRNs only concern discrete-time GRNs [17,18,19,20,21,22], while the results on spatial discrete GRNs have not received sufficient attention in existing studies, probably owing to the partial ineffectiveness of traditional methods in space–time continuous networks, such as the Lyapunov–Krasovskii general functions in discrete-space and -time networks, and the difficulty of computing the difference. To date, there are several reports referring to space–time discrete models [23,24,25]; nevertheless, the models of stochastic space–time discrete GRNs have not been deeply addressed.
It is well known that stochastic uncertainty is inevitable in various dynamical systems, with reference to its ability to alter the mechanical properties of genetic regulatory networks in practical applications. Therefore, the dynamic behaviour of delayed stochastic genetic regulatory networks has been extensively studied, see the literature [26,27,28,29]. For example, Xu et al. [26] investigate the input state stability problem of stochastic gene regulation networks with multiple time delays, and give sufficient conditions for the mean square exponential input state stability of the system using the Lyapunov generalization, Ito’s formula, and Dynkin’s formula. Wang [29] investigates the dual effects of discrete space and discrete time in stochastic genetic regulatory networks by means of exponential Eulerian differences and central finite differences. In addition, finite-time guaranteed cost control is a very effective method in the engineering field due to its many advantages in practical applications, see references [30,31,32,33,34,35,36,37]. The advantages of finite-time guaranteed cost controllers are listed below: (1) Stability. A finite-time guaranteed cost controller is a feedback controller that adjusts the system to remain stable when it is subject to external disturbances or internal changes. (2) Reliability. It can adjust the control strategy adaptively depending on the state of the system, so as to increase the reliability of the system. In summary, the finite-time cost-preserving controller is an advanced control method for genetic regulatory networks with many advantages that can assist the system to be more stable, reliable, and robust, and optimise the performance index of the system.
On the other hand, the global exponential stability and almost periodic nature of GRNs are significant and necessary dynamical behaviours that have been extensively researched by many authors in the last two decades, see the literature [18,38,39,40,41,42]. Particularly in stochastic models, the notion of θ -almost periodicity was first introduced in the paper [43] on the basis of semi-flow and metric dynamical system theories, and the existence of θ -almost periodicity for several continuous-time stochastic models was investigated [44,45]. First, pseudo-almost periodicity was introduced in the early 1990s by Zhang [46] as a natural extension of classical probability periodicity. Since then, pseudo-approximate periodic solutions of differential equations have attracted a lot of attention. In the literature [47], Diagana extended pseudo-almost periodicity to weighted pseudo-almost periodicity and reported a number of excellent contributions on weighted pseudo-almost periodicity, see references [48,49,50]. However, the study of the θ -almost periodicity of stochastic discrete-time GRNs, not to mention weighted pseudo- θ -almost periodicity, influenced by spatial diffusion, has not been addressed in depth so far.
Based on the above motivation, the main purpose of this paper is to establish discrete-time stochastic genetic regulatory networks (SGRNs) for discrete-space diffusion using exponential Euler difference and central finite difference methods. On this ground, a discrete constant variation formula for discrete SGRNs is derived. On the basis of the discrete constant variation formula, the weighted pseudo- θ -almost periodicity of discrete SGRNs with discrete spatial diffusion is investigated by combining the theory of semi-fluid dynamical systems and metric dynamical systems. In the end, a finite-time guaranteed cost controller for this type of SGRN is designed by the construction of a drive, response, and error network framework. The main studies and innovations of this paper are briefly summarised in turn as follows.
(1)
Discrete-time and discrete-space SGRNs are newly introduced, which extends the studied models in reports [18,40].
(2)
The weighted pseudo- θ -almost periodicity of this class of SGRNs is considered for the first time, which complements the works on the almost periodicity of GRNs in references [12,38].
(3)
Finite-time cost-preserving controllers are designed for this class of SGRNs.
Plan of this paper: In Section 2, a formula for discrete-time and discrete-space SGRNs is given and the concept of weighted pseudo- θ -almost periodicity is presented. Section 3 discusses the global existence of unique weighted pseudo- θ -almost periodic sequence solutions for discrete-time and discrete-space SGRNs on the basis of the theory of semifluid and metric dynamical systems, the discrete constant variation formula, and the fixed-point theorem. Furthermore, in Section 4, finite-time cost-preserving controllers are designed by constructing a framework of drive, response, and error networks for discrete-time and discrete-space SGRNs. Section 5 gives numerical examples of discrete-time and discrete-space SGRNs achieving weight pseudo- θ -almost periodicity, finite-time guaranteed cost control, and global exponential stability. The conclusions and main points of the paper are given in Section 6.
Symbols:  R n denotes the space of n-dimensional real vectors; Z is the field of integral numbers; N 0 = { 0 , 1 , 2 , } ; N = N 0 { 0 } ; N a b = { a , a + 1 , , b } for any a , b Z ; I J = I J , I , J R . Let ξ 1 = ( 1 , 0 , , 0 ) T ,   ξ 2 = ( 0 , 1 , , 0 ) T ,   ξ m = ( 0 , 0 , , 1 ) T .
Define N p N for p N 1 m , ν : = ν = ( ν 1 , , ν m ) T : ( ν p , p ) ( N 1 N p 1 , N 1 m ) , ν : = ¯ ν ν , ¯ ν = ν = ( ν 1 , , ν m ) T : ( ν p , p ) ( N 0 N p , N 1 m ) .
For any function f : ¯ ν × Z to R n , we denote as f : = f k ν = ( f 1 , k ν , , f n , k ν ) T , where ( ν , k ) ¯ ν × Z . Sometimes, f = ( f 1 , , f n ) T is used for simplicity.

2. Problem Formulation

In this section, firstly, discrete-time and discrete-space SGRNs are presented, which can be considered as discrete formats of continuous-time SGRNs with reaction diffusion. Secondly, the constant variation formula of the discrete network is obtained by dividing the discrete network into two discrete sub-networks based on the theory of difference equations. In the next step, important inequalities are given, such as the Minkowski inequality in Lemma 2. Finally, the definition of weighted pseudo- θ -almost periodicity is presented.

2.1. Space–Time Discrete Stochastic GRNs

This article considers the following space–time discrete stochastic genetic regulatory networks (GRNs) in the Euler form of
m i , k + 1 ν = e a i , k h m i , k ν + 1 e a i , k h a i , k [ q = 1 n Θ i q Δ ˜ q 2 m i , k ν + j = 1 m b i j , k f j ( p j , k σ j , k ν ) + j = 1 m γ i j , k g j ( p j , k μ j , k ν ) w 1 j , k + I i , k ] , p i , k + 1 ν = e c i , k h p i , k ν + 1 e c i , k h c i , k q = 1 n Π i q Δ ˜ q 2 p i , k ν + d i , k m i , k ν + j = 1 m ϖ i j , k η j ( m j , k ν j , k ν ) w 2 j , k
for ( ν , k ) ν × Z and i = 1 , 2 , , m ; m i and p i denote the concentrations of the ith mRNA and ith protein, respectively;
a ˜ i = a i 2 q = 1 n Θ i q 2 , c ˜ i = c i 2 q = 1 n Π i q 2 ,
a ˜ i > 0 and c ˜ i > 0 are the decay rates of the ith mRNA and ith protein, respectively; Θ i q and Π i q represent the transmission diffusion matrixes, where Δ ˜ q 2 means the discrete-space operator denoted by
Δ ˜ q 2 m i , · · : = m i , · ν + ξ q + m i , · ν ξ q 2 , Δ ˜ q 2 p i , · · : = p i , · ν + ξ q + p i , · ν ξ q 2 , q N 1 n ;
and h denote the length of the space and time steps in order; γ i j and ϖ i j stand for noise intensities; d i > 0 is the translation rate; I i = j I i w i j , w i j 0 is bounded and I i is the set of all the j which is a repressor of gene i; b i j = w i j if transcription factor j is an activator of gene i, b i j = 0 if there is no link from node j to i, and b i j = w i j if transcription factor j is a repressor of gene i; f j , g j , and η j are Hill functions; w 1 j , k : = 1 h [ w 1 j ( k h + h ) w 1 j ( k h ) ] , w 2 j , k : = 1 h [ w 2 j ( k h + h ) w 2 j ( k h ) ] , and i , j = 1 , 2 , , m ; w 11 , , w 1 m , w 21 , , w 2 m are scalar mutually independent two-sided standard Brown motions on complete probability space ( Ω , F , F · , P ) with filtration
F k = σ ( w 11 , q , , w 1 m , q , w 21 , q , , w 2 m , q ) : q ( , k ) Z , k Z .
The Dirichlet boundary conditions of GRNs Equation (1) are described as
m i , k ν | ν ν = 0 = p i , k ν | ν ν , k Z .
Herein, ν can be regarded as a discrete form of the rectangle area ℧ in R m , which is described by
= x = ( x 1 , x 2 , , x m ) T R m : 0 < x p < L p : = N p , p N 1 m .
Let m i , k ν = M i ( ν , k h ) and p i , k ν = P i ( ν , k h ) for ( ν , k ) ν × Z . Then, GRNs Equation (1) is a full discretization scheme of the following stochastic GRNs with reaction diffusions
t M i ( x , t ) = q = 1 n x q Θ i q M i ( x , t ) x q a ˜ i ( t ) M i ( x , t ) + j = 1 m b i j ( t ) f j ( P j ( x , t σ j ( t ) ) ) + I i ( t ) + j = 1 m γ i j ( x , t ) g j ( P j ( x , t μ j ( t ) ) ) d d t W 1 j ( t ) , t P i ( x , t ) = q = 1 n x q Π i q P i ( x , t ) x q c ˜ i ( t ) P i ( x , t ) + d i ( x , t ) M i ( x , t ) + j = 1 m ϖ i j ( x , t ) η j ( M j ( x , t ν j ( t ) ) ) d d t W 2 j ( t ) , M i ( x , t ) | x = 0 = P i ( x , t ) | x ,
where x = ( x 1 , , x n ) T R n refers to a space variable.
The discrete techniques in SGRNs Equation (1) are therefore Eulerian difference (ED) for Brownian motion, exponential Eulerian difference (EED) for time variables, and central finite difference (CFD) for spatial variables, respectively. For more information on ED, EED, and CFD, please see the literature [51,52,53,54,55].
Remark 1.
By using Euler differences, reports [18,40] considered discrete-time GRNs without spatial diffusions. In this article, SGRNs Equation (1) extends the models in reports [18,40].
Lemma 1.
GRNs Equation (1) can be expressed as
m i , k ν = s = k 0 k 1 e a i , s h m i , k 0 ν + v = k 0 k 1 s = v + 1 k 1 e a i , s h ( 1 e a i , v h ) a i , v × q = 1 n Θ i q Δ ˜ q 2 m i , v ν + j = 1 m b i j , v f j ( p j , v σ j , v ν ) + j = 1 m γ i j , v g j ( p j , v μ j , v ν ) w 1 j , v + I i , v , p i , k ν = s = k 0 k 1 e c i , s h p i , k 0 ν + v = k 0 k 1 s = v + 1 k 1 e c i , s h ( 1 e c i , v h ) c i , v × q = 1 n Π i q Δ ˜ q 2 p i , v ν + d i , v m i , v ν + j = 1 m ϖ i j , v η j ( m j , v ν j , v ν ) w 2 j , v ,
where ( ν , k ) ν × [ k 0 , ) Z with some initial point k 0 Z , i = 1 , 2 , , m . Moreover, it holds that
m i , k ν | ν ν = 0 = p i , k ν | ν ν , k [ k 0 , ) Z , i = 1 , 2 , , m .
Lemma 2
([56] (Minkowski inequality)). If X , Y L 2 ( Ω , R ) , then
E | X + Y | 2 1 2 E | X | 2 1 2 + E | Y | 2 1 2 .
Lemma 3
([56] ( H o ¨ lder inequality ) ). Let a k , b k : Z R . Then,
| k a k b k | 2 k | a k | k | a k | | b k | 2 .
Lemma 4.
E | w 1 j , k | 2 = E | w 2 j , k | 2 = 1 h for j = 1 , 2 , , n .
Proof 
By the definition of w 1 j , k and Ito formula, it is derived that
E | w 1 j , k | 2 = 1 h 2 E k h k h + h d W 1 j ( s ) 2 = 1 h 2 E k h k h + h d s = 1 h , j = 1 , 2 , , n .
This completes the proof. □

2.2. Weighted Pseudo-Almost Periodicity

In the following, assume that ( X , · X ) is a norm linear space, and L p ( Ω , R n ) denotes the set of all pth integrable R n -valued random variables with the norm
u p = max 1 i n E | u i | p 1 / p , u = ( u 1 , , u n ) T L p ( Ω , R n ) , p > 0 ,
in which E denotes the expectation operator with respect to probability space ( Ω , F , P ) .
Definition 1.
Let X X and ϵ > 0 be arbitrary. If ν = ν ϵ and τ [ a , a + ν ϵ ] Z for any a Z , ensuring that
X k + τ X k X < ϵ , k Z ,
then { X k } is an almost periodic sequence. Herein, τ is called an ϵ-almost period of X. A P ( Z , X ) denotes the set of the whole almost periodic sequences.
Let U be the set of all weight sequences α : Z ( 0 , + ) satisfying
α k + s α k α ¯ , k Z , s [ 0 , σ 0 ] Z ;
μ k ( α ) : = s = k k α s + , 1 μ k ( α ) s = k σ 0 k α s 0 , as k + ,
where σ 0 = max 1 j m sup k Z { σ j , k , μ j , k , ν j , k } .
Define B ( Z , X ) as the set of all bounded sequences from Z to X and
P A P 0 μ ( Z , X , α ) : = X B ( Z , X ) : lim k + 1 μ k ( α ) s = k k α s X s X = 0 .
When X = L 2 ( Ω , R n ) or R n , we use P A P 0 μ ( Z , R n , α ) to denote P A P 0 μ ( Z , X , α ) .
Definition 2.
Sequence X B ( Z , X ) is said to be a weighted pseudo-almost periodic sequence or an α-pseudo-almost periodic sequence in the case X = Y + Z , where Y A P ( Z , X ) , Z P A P 0 μ ( Z , X , α ) , and α U . The space of all α-pseudo-almost periodic sequences is represented by P A P μ ( Z , X , α ) .
Supposing that ( Ω , F , P , θ ) is a metric dynamical system, see the pioneering work in [57]. It holds that θ k : Ω Ω is F -measurable, P ( θ k 1 ( A ) ) = P ( A ) for any A F , and θ s + k = θ s θ k , s , k Z .
Definition 3.
The translation to a sequential process X k is defined as
L τ X k ( ω ) : = X k + τ ( θ τ ω ) , ω Ω , s , k , τ Z .
Definition 4.
If X k X , k Z , then X is said to be θ-almost periodic in the case that for each ϵ > 0 we can find at least one positive integer ν = ν ( ϵ ) and it has a constant τ = τ ( ϵ ) ( a , a + ν ) Z for arbitrary a Z , ensuring that
L τ X k X k X ϵ , k Z .
Herein, τ is called an ϵ-θ-almost period of X. The space of all θ-almost periodic sequences is represented by A P θ ( Z , X ) . If L τ X = X with τ Z , then X is said to be θ-periodic.
When X = L p ( Ω , R n ) with p > 0 , then X is said to be θ-almost periodic in p-mean. If p = 2 , the elements in P A P θ ( Z , L p ( Ω , R n ) ) are called a mean square θ-almost periodic sequence. Hereby, we use a simplified symbol P A P θ ( Z , R n ) to denote P A P θ ( Z , L 2 ( Ω , R n ) ) .
Definition 5.
Sequence X : Z X is said to be a weighted pseudo-θ-almost periodic sequence or α-pseudo-θ-almost periodic sequence in the case X = Y + Z , where Y A P θ ( Z , X ) , Z P A P 0 μ ( Z , X , α ) , and α U . The space of all α-pseudo-θ-almost periodic sequences is represented by P A P θ , μ ( Z , X , α ) . If Y is θ-periodic, then X is said to be a weighted pseudo-θ-periodic sequence or an α-pseudo-θ-periodic sequence.
When X = L p ( Ω , R n ) with p > 0 , then X is said to be a weighted pseudo-θ-almost periodic sequence or an α-pseudo-θ-almost periodic sequence in p-mean. If p = 2 , the elements in P A P θ , μ ( Z , L p ( Ω , R n ) , α ) are called a weighted pseudo mean square θ-almost periodic sequence or an α-pseudo mean square θ-almost periodic sequence. Hereby, a simplified symbol P A P θ , μ ( Z , R n , α ) : = P A P θ , μ ( Z , L 2 ( Ω , R n ) , α ) .

3. Mean Square α -Pseudo- θ -Almost Periodic Sequence

This section focuses on weighted pseudo- θ -almost periodic sequence solutions in the mean square sense of SGRNs Equation (1) based on stochastic calculus theory, the constant variation formula, and the Banach contraction mapping principle.
For any u = ( m , p ) T P A P θ , μ ( ν × Z , R 2 m , α ) with m = ( m 1 , , m m ) T and p = ( p 1 , , p m ) T , define Γ : P A P θ , μ ( ν × Z , R 2 m , α ) R 2 m by
Γ u = ( Φ u 1 ) , , ( Φ u ) m , ( Ψ u ) 1 , , ( Ψ u ) m T ,
where
( Φ u ) i , k ν = v = k 1 s = v + 1 k 1 e a i , s h ( 1 e a i , v h ) a i , v [ q = 1 n Θ i q Δ ˜ q 2 m i , v ν + j = 1 m b i j , v f j ( p j , v σ j , v ν ) + j = 1 m γ i j , v g j ( p j , v μ j , v ν ) w 1 j , v + I i , v ] , ( Ψ u ) i , k ν = v = k 1 s = v + 1 k 1 e c i , s h ( 1 e c i , v h ) c i , v [ q = 1 n Π i q Δ ˜ q 2 p i , v ν + j = 1 m ϖ i j , v η j ( m j , v ν j , v ν ) w 2 j , v + d i , v m i , v ν ] , ( ν , k ) ν × Z ;
( Φ u ) i , k ν | ν ν = 0 = ( Ψ u ) i , k ν | ν ν , k Z , i = 1 , 2 , , m .
For u = ( m , p ) P A P θ , μ ( ν × Z , R 2 m , α ) , define the norm as follows:
u = sup ( ν , k ) ν × Z max 1 i m m i , k ν 2 , p i , k ν 2 ,
in which m i , k ν 2 = E m i , k ν 2 1 2 and p i , k ν 2 = E p i , k ν 2 1 2 for all ( ν , k ) ν × Z , i = 1 , 2 , , m .
Define
a ̲ i : = inf k Z a i , k , c ̲ i : = inf k Z c i , k , d ¯ i : = sup k Z | d i , k | ,
I ¯ i : = sup k Z | I i , k | , b ¯ i j : = sup k Z | b i j , k | , γ ¯ i j : = sup k Z | γ i j , k | , ϖ ¯ i j : = sup k Z | ϖ i j , k | ,
where i , j = 1 , 2 , , m .
In the later discussion of this paper, the following assumptions are necessary:
( g 1 )
a i and c i are R -valued almost periodic sequences; σ j , μ j , and ν j are Z 0 -valued almost periodic sequences; b i j , γ i j , ϖ i j , I i , and d i are R -valued α -pseudo-almost periodic sequences.
( g 2 )
f j ( 0 ) = g j ( 0 ) = η j ( 0 ) = 0 and there exist positive numbers L j f , L j g and L j η such that
| f j ( u ) f j ( v ) | L j f | u v | , | g j ( u ) g j ( v ) | L j g | u v | , | η j ( u ) η j ( v ) | L j η | u v |
for any u , v R , j = 1 , 2 , , m .
( g 3 )
min 1 i m { a ̲ i , c ̲ i } > 0 .

3.1. α -Pseudo- θ -Almost Periodicity of Operator Γ

Define a coordinate function w p j , k ( ω ) : = w p j ( k h , ω ) : = ω p j , k and θ = ( θ k ) k Z , which is the dynamical system on ( Ω , F , P ) , as
θ k ω ( s ) = w 11 , k + s w 11 , k , , w 1 m , k + s w 1 m , k , w 21 , k + s w 21 , k , , w 2 m , k + s w 2 m , k T ,
where ω = ( ω 11 , , ω 1 m , ω 21 , , ω 2 m ) T Ω , k , s Z , p = 1 , 2 , j = 1 , 2 , , m .
For any k , τ Z and ω Ω , it holds that
w p j , k + τ ( θ τ ω ) = w p j , k ( ω ) w p j , τ ( ω ) , p = 1 , 2 , j = 1 , 2 , , m .
Lemma 5.
Let σ : Z [ 0 , σ 0 ] Z with σ 0 > 0 and Δ σ < 1 . If x P A P 0 μ ( Z , X , α ) , then x k σ k P A P 0 μ ( Z , X , α ) , k Z .
Proof. 
By the definition of P A P 0 μ ( Z , X , α ) , we obtain
1 μ k ( α ) s = k k α s x s σ s X α ¯ μ k ( α ) q = k σ k k σ k α q x q X α ¯ μ k ( α ) q = k k α q x q X + α ¯ μ k ( α ) q = k σ 0 k α q x q X 0 ,
as k . This completes the proof. □
Corollary 1.
If x P A P 0 μ ( Z , X , α ) , then x k 1 P A P 0 μ ( Z , X , α ) for each k Z .
Lemma 6.
Let σ : Z [ 0 , σ 0 ] Z be an almost periodic sequence, which satisfies the conditions in Lemma 5. If x P A P θ , μ ( Z , X , α ) , then x k σ k P A P θ , μ ( Z , X , α ) , k Z .
Proof. 
Owing to x P A P θ , μ ( Z , X , α ) , then x = x ^ + x ˘ , where x ^ A P θ ( Z , R ) and x ˘ P A P 0 μ ( Z , R , α ) . From Lemma 5, x ˘ k σ k P A P 0 μ ( Z , X , α ) , k Z . It suffices to prove x ^ k σ k A P θ ( Z , X ) , k Z .
Let τ Z be an ϵ - θ -almost period of σ and x ^ , ϵ ( 0 , 1 ) . Noting that σ : Z Z , so
| σ k + τ σ k | = 0 < ϵ , k Z ,
which derives
L τ x ^ k σ k x ^ k σ k X x ^ k + τ σ k + τ x ^ k σ k + τ X + x ^ k σ k + τ x ^ k σ k X < ϵ , k Z .
Then, x ^ k σ k A P θ ( Z , X ) , k Z . This completes the proof. □
Lemma 7.
If b P A P μ ( Z , R , α ) , x P A P θ , μ ( Z , X , α ) is bounded, f ( 0 ) = 0 , and f : R R meets the Lipschitz condition with Lipschitz constant L f > 0 , then b f ( x ) P A P θ , μ ( Z , X , α ) .
Proof. 
Under the assumptions in Lemma 7, there exist b ^ A P ( Z , R ) , b ˘ P A P 0 μ ( Z , R , α ) , x ^ A P θ ( Z , X ) , and x ˘ P A P 0 μ ( Z , X , α ) such that
b = b ^ + b ˘ , x = x ^ + x ˘ .
For any τ Z ,
L τ b ^ k f ( x ^ k ) b ^ k f ( x ^ k ) X = b ^ k + τ f L τ x ^ k b ^ k f ( x ^ k ) X b ^ k + τ b ^ k L f x ^ k + τ ( θ τ ω ) X + | b ^ k | L f L τ x ^ k x ^ k X , k Z ,
which implies b ^ f ( x ^ ) A P θ ( Z , X ) . Meanwhile,
b f ( x ) b ^ f ( x ^ ) X | b ˘ | L f x 2 + | b ^ | L f x ˘ X ,
which induces b f ( x ) b ^ f ( x ^ ) P A P 0 μ ( Z , X , α ) . This completes the proof. □
Lemma 8.
If a A P ( Z , R ) with a ̲ = inf k Z a k > 0 , x P A P θ , μ ( Z , R , α ) is bounded and x k is F k -adaptive for each k Z , then
v = k 1 s = v + 1 k 1 e a s h x v P A P θ , μ ( Z , R , α ) , v = k 1 s = v + 1 k 1 e a s h x v w p j , v P A P θ , μ ( Z , R , α ) , k Z ,
where p = 1 , 2 , j = 1 , 2 , , m .
Proof. 
Similar to Lemma 7, there exist x ^ A P θ ( Z , R ) and x ˘ P A P 0 μ ( Z , R , α ) such that x = x ^ + x ˘ .
Let a ¯ = sup k Z a k , τ Z be an ϵ - θ -almost period of a and x ^ ,
I ^ p j , k : = v = k 1 s = v + 1 k 1 e a s h x ^ v w p j , v , I ˘ p j , k : = v = k 1 s = v + 1 k 1 e a s h x ˘ v w p j , v , k Z ,
where p = 1 , 2 , j = 1 , 2 , , m . By using Equation (6) and the Minkowski and Hölder inequalities in Lemmas 2 and 3, we have
L τ I ^ p j , k I ^ p j , k 2 = E v = k 1 s = v + 1 k 1 e a s h e a s h ( e a s + τ h e a s h ) x ^ v + τ + ( x ^ v + τ x ^ v ) w p j , v 2 1 2 v = k 1 e a ̲ ( k v 1 ) h v = k 1 e a ̲ ( k v 1 ) h E e ( a ¯ a ̲ ) h ϵ h | x ^ v + τ | + | x ^ v + τ x ^ v | w p j , v 2 1 2 1 1 e a ̲ h e ( a ¯ a ̲ ) h h sup k Z x ^ k 2 + 1 h 1 2 ϵ , k Z ,
which implies I ^ p j A P θ ( Z , R ) , p = 1 , 2 , j = 1 , 2 , , m .
On the other hand, similar to the before derivation, we attain
I ˘ p j , k 2 = E v = k 1 s = v + 1 k 1 e a s h x ˘ v w p j , v 2 1 2 v = k 1 e a ̲ ( k v 1 ) h v = k 1 e a ̲ ( k v 1 ) h E x ˘ v 2 w p j , v 2 1 2 1 1 e a ̲ h v = k 1 1 h e a ̲ ( k v 1 ) h x ˘ v 2 2 1 2 , k Z ,
which implies
lim k + 1 μ k ( α ) s = k k α s I ˘ p j , s 2 lim k + 1 μ k ( α ) s = k k α s s = k k α s I ˘ p j , s 2 2 1 2 lim k + 1 μ k ( α ) ( 1 e a ̲ h ) s = k k α s v = s 1 1 h e a ̲ ( s v 1 ) h x ˘ v 2 2 1 2 sup k Z x ˘ k 2 1 e a ̲ h q = 0 e a ̲ q h 1 h lim k + 1 μ k ( α ) s = k k α s x ˘ s q 1 2 1 2 ( q = s v 1 ) = 0 , p = 1 , 2 , j = 1 , 2 , , m .
In the above computations, Corollary 1 and the principle of uniform convergence are employed. Thus, v = k 1 s = v + 1 k 1 e a s h x v w · · , v P A P θ , μ ( Z , R , α ) , k Z . Furthermore, v = k 1 s = v + 1 k 1 e a s h x v P A P θ , μ ( Z , R , α ) can be similarly addressed, and k Z . This completes the proof. □
Together with Lemmas 5–8, we derive the following:
Theorem 1.
Supposing that ( g 1 ) ( g 3 ) hold. Then, Γ maps P A P θ , μ ( ν × Z , R 2 m , α ) to P A P θ , μ ( ν × Z , R 2 m , α ) .

3.2. Weighted Pseudo-Almost Periodic Sequence Solution to GRNs Equation (1)

Define
P A P b θ , μ ( ν × Z , R 2 m , α ) = u P A P θ , μ ( ν × Z , R 2 m , α ) : u φ ς φ 0 1 ς ,
where
φ = ( φ 1 , φ 2 , , φ m , 0 , , 0 ) T , φ i , k ν = v = k 1 s = v + 1 k 1 e a i , s h ( 1 e a i , v h ) a i , v I i , v
for all ( ν , k ) ν × Z , i = 1 , 2 , , m . From the definition of φ , we derive
φ = max 1 i m sup ( ν , k ) ν × Z φ i , k ν 2 = max 1 i m sup ( ν , k ) ν × Z v = k 1 s = v + 1 k 1 e a i , s h ( 1 e a i , v h ) a i , v I i , v max 1 i m I ¯ i a ̲ i = φ 0 ,
which induces
u u φ + φ ς φ 0 1 ς + φ 0 = φ 0 1 ς , u P A P b θ , μ ( ν × Z , R 2 m , α ) .
Theorem 2.
Let ( g 1 ) ( g 3 ) be valid. GRNs Equation (1) possesses a unique weighted pseudo- or α-pseudo-almost periodic sequence solution if the following condition holds.
( g 4 )
ς = max { ς 1 , ς 2 } < 1 , where
ς 1 = max 1 i m 1 a ̲ i q = 1 n 2 | Θ i q | 2 + j = 1 m b ¯ i j L j f + j = 1 m γ ¯ i j L j g h 1 2 ,
ς 2 = max 1 i m 1 c ̲ i q = 1 n 2 | Π i q | 2 + j = 1 m ϖ ¯ i j L j η h 1 2 + d ¯ i .
Proof. 
Let us prove that the operator Γ is self-mapping from P A P b θ , μ ( ν × Z , R 2 m , α ) to P A P b θ , μ ( ν × Z , R 2 m , α ) . Supposing that u = ( m , p ) T = ( m 1 , , m m , p 1 , , p m ) T P A P b θ , μ ( ν × Z , R 2 m , α ) . In view of Equation (5) and by utilizing the Minkowski and Hölder inequalities in Lemmas 2 and 3, we have
( Φ u ) i , k ν φ i , k ν 2 = { E ( v = k 1 s = v + 1 k 1 e a i , s h ( 1 e a i , v h ) a i , v [ q = 1 n Θ i q Δ ˜ q 2 m i , v ν + j = 1 m b i j , v f j ( p j , v σ j , v ν ) + j = 1 m γ i j , v g j ( p j , v μ j , v ν ) w 1 j , v ] ) 2 } 1 2 1 e a ̲ i h a ̲ i { E ( v = k 1 e a ̲ i ( k v 1 ) h [ q = 1 n | Θ i q | | Δ ˜ q 2 m i , v ν | + j = 1 m b ¯ i j L j f | p j , v σ j , v ν | + j = 1 m γ ¯ i j L j g | p j , v μ j , v ν | | w 1 j , v | ] ) 2 } 1 2 1 e a ̲ i h a ̲ i { v = k 1 e a ̲ i ( k v 1 ) h v = k 1 e a ̲ i ( k v 1 ) h × E q = 1 n | Θ i q | | Δ ˜ q 2 m i , v ν | + j = 1 m b ¯ i j L j f | p j , v σ j , v ν | + j = 1 m γ ¯ i j L j g | p j , v μ j , v ν | | w 1 j , v | 2 } 1 2 1 e a ̲ i h a ̲ i { 1 1 e a ̲ i h v = k 1 e a ̲ i ( k v 1 ) h { ( E [ q = 1 n | Θ i q | | Δ ˜ q 2 m i , v ν | + j = 1 m b ¯ i j L j f | p j , v σ j , v ν | + j = 1 m γ ¯ i j L j g | p j , v μ j , v ν | | w 1 j , v | ] 2 ) 1 2 } 2 } 1 2 1 e a ̲ i h a ̲ i { 1 1 e a ̲ i h v = k 1 e a ̲ i ( k v 1 ) h { E q = 1 n | Θ i q | | Δ ˜ q 2 m i , v ν | 2 1 2 + E j = 1 m b ¯ i j L j f | p j , v σ j , v ν | 2 1 2 + E j = 1 m γ ¯ i j L j g | p j , v μ j , v ν | | w 1 j , v | 2 ) 1 2 } 2 } 1 2 1 e a ̲ i h a ̲ i { 1 1 e a ̲ i h v = k 1 e a ̲ i ( k v 1 ) h { q = 1 n | Θ i q | 2 u + j = 1 m b ¯ i j L j f u + j = 1 m γ ¯ i j L j g 1 h u } 2 } 1 2 1 e a ̲ i h a ̲ i { 1 1 e a ̲ i h 1 1 e a ̲ i h { q = 1 n | Θ i q | 2 u + j = 1 m b ¯ i j L j f u + j = 1 m γ ¯ i j L j g 1 h u } 2 } 1 2 1 a ̲ i q = 1 n | Θ i q | 2 + j = 1 m b ¯ i j L j f + j = 1 m γ ¯ i j L j g 1 h u ς φ 0 1 ς , i = 1 , 2 , , m ,
as well as
( Ψ u ) i , k ν 0 2 = { E ( v = k 1 s = v + 1 k 1 e c i , s h ( 1 e c i , v h ) c i , v [ q = 1 n Π i q Δ ˜ q 2 p i , v ν + d i , v m i , v ν + j = 1 m ϖ i j , v η j ( m j , v ν j , v ν ) w 2 j , v ] ) 2 } 1 2 1 e c ̲ i h c ̲ i { E ( v = k 1 e c ̲ i ( k v 1 ) h [ q = 1 n | Π i q | | Δ ˜ q 2 p i , v ν | + d ¯ i | m i , v ν | + j = 1 m ϖ ¯ i j L j η | m j , v ν j , v ν | | w 2 j , v | ] ) 2 } 1 2 1 e c ̲ i h c ̲ i { v = k 1 e c ̲ i ( k v 1 ) h v = k 1 e c ̲ i ( k v 1 ) h × E q = 1 n | Π i q | | Δ ˜ q 2 p i , v ν | + d ¯ i | m i , v ν | + j = 1 m ϖ ¯ i j L j η | m j , v ν j , v ν | | w 2 j , v | 2 } 1 2 1 e c ̲ i h c ̲ i { 1 1 e c ̲ i h v = k 1 e c ̲ i ( k v 1 ) h { ( E [ q = 1 n | Π i q | | Δ ˜ q 2 p i , v ν | + d ¯ i | m i , v ν | + j = 1 m ϖ ¯ i j L j η | m j , v ν j , v ν | | w 2 j , v | ] 2 ) 1 2 } 2 } 1 2 1 e c ̲ i h c ̲ i { 1 1 e c ̲ i h v = k 1 e c ̲ i ( k v 1 ) h { E q = 1 n | Π i q | | Δ ˜ q 2 p i , v ν | 2 1 2 + E d ¯ i | m j , v ν | 2 1 2 + E j = 1 m ϖ ¯ i j L j η | m j , v ν j , v ν | | w 2 j , v | 2 ) 1 2 } 2 } 1 2 1 e c ̲ i h c ̲ i { 1 1 e c ̲ i h v = k 1 e c ̲ i ( k v 1 ) h × q = 1 n | Π i q | 2 u + d ¯ i u + j = 1 m ϖ ¯ i j L j η 1 h u 2 } 1 2 1 e c ̲ i h c ̲ i { 1 1 e c ̲ i h 1 1 e c ̲ i h × q = 1 n | Π i q | 2 u + d ¯ i u + j = 1 m ϖ ¯ i j L j η 1 h u 2 } 1 2 1 c ̲ i q = 1 n | Π i q | 2 + d ¯ i + j = 1 m ϖ ¯ i j L j η 1 h u ς φ 0 1 ς , i = 1 , 2 , , m .
In the calculations of the stochastic terms of Equations (7) and (8), Lemma 4 has been employed.
Together with Equations (7) and (8), Γ u φ ς φ 0 1 ς and Γ u is well defined in space P A P b θ , μ ( ν × Z , R 2 m , α ) , · for any u P A P b θ , μ ( ν × Z , R 2 m , α ) .
In the end, the property of contraction to the operator Γ in space P A P b θ , μ ( ν × Z , R 2 m , α ) will be demonstrated. Let u = ( m 1 , , m m , p 1 , , p m ) T and u ˜ = ( m ˜ 1 , , m ˜ m ,
p ˜ 1 , , p ˜ m ) T belong to space P A P b θ , μ ( ν × Z , R 2 m , α ) , it follows that
( Φ u ) i , k ν ( Φ u ˜ ) i , k ν 2 = { E ( v = k 1 s = v + 1 k 1 e a i , s h ( 1 e a i , v h ) a i , v [ q = 1 n Θ i q Δ ˜ q 2 ( m i , v ν m ˜ i , v ν ) + j = 1 m b i j , v f j ( p j , v σ j , v ν ) f j ( p ˜ j , v σ j , v ν ) + j = 1 m γ i j , v g j ( p j , v μ j , v ν ) g j ( p ˜ j , v μ j , v ν ) w 1 j , v ] ) 2 } 1 2 1 e a ̲ i h a ̲ i { E ( v = k 1 e a ̲ i ( k v 1 ) h [ q = 1 n | Θ i q | | Δ ˜ q 2 ( m i , v ν m ˜ i , v ν ) | + j = 1 m b ¯ i j L j f | p j , v σ j , v ν p ˜ j , v σ j , v ν | + j = 1 m γ ¯ i j L j g | p j , v μ j , v ν p ˜ j , v μ j , v ν | | w 1 j , v | ] ) 2 } 1 2 1 e a ̲ i h a ̲ i { v = k 1 e a ̲ i ( k v 1 ) h v = k 1 e a ̲ i ( k v 1 ) h E [ q = 1 n | Θ i q | | Δ ˜ q 2 ( m i , v ν m ˜ i , v ν ) | + j = 1 m b ¯ i j L j f | p j , v σ j , v ν p ˜ j , v σ j , v ν | + j = 1 m γ ¯ i j L j g | p j , v μ j , v ν p ˜ j , v μ j , v ν | | w 1 j , v | ] 2 } 1 2 1 e a ̲ i h a ̲ i { 1 1 e a ̲ i h v = k 1 e a ̲ i ( k v 1 ) h { ( E [ q = 1 n | Θ i q | | Δ ˜ q 2 ( m i , v ν m ˜ i , v ν ) | + j = 1 m b ¯ i j L j f | p j , v σ j , v ν p ˜ j , v σ j , v ν | + j = 1 m γ ¯ i j L j g | p j , v μ j , v ν p ˜ j , v μ j , v ν | | w 1 j , v | ] 2 ) 1 2 } 2 } 1 2 1 e a ̲ i h a ̲ i { 1 1 e a ̲ i h v = k 1 e a ̲ i ( k v 1 ) h { E q = 1 n | Θ i q | | Δ ˜ q 2 ( m i , v ν m ˜ i , v ν ) | 2 1 2 + E j = 1 m b ¯ i j L j f | p j , v σ j , v ν p ˜ j , v σ j , v ν | 2 1 2 + E j = 1 m γ ¯ i j L j g | p j , v μ j , v ν p ˜ j , v μ j , v ν | | w 1 j , v | 2 ) 1 2 } 2 } 1 2 1 e a ̲ i h a ̲ i { 1 1 e a ̲ i h v = k 1 e a ̲ i ( k v 1 ) h { q = 1 n | Θ i q | 2 u u ˜ + j = 1 m b ¯ i j L j f u u ˜ + j = 1 m γ ¯ i j L j g 1 h u u ˜ } 2 } 1 2 1 e a ̲ i h a ̲ i { 1 ( 1 e a ̲ i h ) 2 { q = 1 n | Θ i q | 2 u u ˜ + j = 1 m b ¯ i j L j f u u ˜ + j = 1 m γ ¯ i j L j g 1 h u u ˜ } 2 } 1 2 1 a ̲ i q = 1 n | Θ i q | 2 + j = 1 m b ¯ i j L j f + j = 1 m γ ¯ i j L j g 1 h u u ˜ ς u u ˜ , i = 1 , 2 , , m ,
as well as
( Ψ u ) i , k ν ( Ψ u ˜ ) i , k ν 2 = { E ( v = k 1 s = v + 1 k 1 e c i , s h ( 1 e c i , v h ) c i , v [ q = 1 n Π i q Δ ˜ q 2 ( p i , v ν p ˜ i , v ν ) + d i , v ( m i , v ν m ˜ i , v ν ) + j = 1 m ϖ i j , v η j ( m j , v ν j , v ν m ˜ j , v ν j , v ν ) w 2 j , v ] ) 2 } 1 2 1 e c ̲ i h c ̲ i { E ( v = k 1 e c ̲ i ( k v 1 ) h [ q = 1 n | Π i q | | Δ ˜ q 2 ( p i , v ν p ˜ i , v ν ) | + d ¯ i | m i , v ν m ˜ i , v ν | + j = 1 m ϖ ¯ i j L j η | m j , v ν j , v ν m ˜ j , v ν j , v ν | | w 2 j , v | ] ) 2 } 1 2 1 e c ̲ i h c ̲ i { v = k 1 e c ̲ i ( k v 1 ) h v = k 1 e c ̲ i ( k v 1 ) h E [ q = 1 n | Π i q | | Δ ˜ q 2 ( p i , v ν p ˜ i , v ν ) | + d ¯ i | m i , v ν m ˜ i , v ν | + j = 1 m ϖ ¯ i j L j η | m j , v ν j , v ν m ˜ j , v ν j , v ν | | w 2 j , v | ] 2 } 1 2 1 e c ̲ i h c ̲ i { 1 1 e c ̲ i h v = k 1 e c ̲ i ( k v 1 ) h { ( E [ q = 1 n | Π i q | | Δ ˜ q 2 ( p i , v ν p ˜ i , v ν ) | + d ¯ i | m i , v ν m ˜ i , v ν | + j = 1 m ϖ ¯ i j L j η | m j , v ν j , v ν m ˜ j , v ν j , v ν | | w 2 j , v | ] 2 ) 1 2 } 2 } 1 2 1 e c ̲ i h c ̲ i { 1 1 e c ̲ i h v = k 1 e c ̲ i ( k v 1 ) h { E q = 1 n | Π i q | | Δ ˜ q 2 ( p i , v ν p ˜ i , v ν ) | 2 1 2 + E d ¯ i | m j , v ν m ˜ j , v ν | 2 1 2 + E j = 1 m ϖ ¯ i j L j η | m j , v ν j , v ν m ˜ j , v ν j , v ν | | w 2 j , v | 2 ) 1 2 } 2 } 1 2 1 e c ̲ i h c ̲ i { 1 1 e c ̲ i h v = k 1 e c ̲ i ( k v 1 ) h { q = 1 n | Π i q | 2 u u ˜ + d ¯ i u u ˜ + j = 1 m ϖ ¯ i j L j η 1 h u u ˜ } 2 } 1 2 1 e c ̲ i h c ̲ i { 1 ( 1 e c ̲ i h ) 2 { q = 1 n | Π i q | 2 u u ˜ + d ¯ i u u ˜ + j = 1 m ϖ ¯ i j L j η 1 h u u ˜ } 2 } 1 2 1 c ̲ i q = 1 n | Π i q | 2 + d ¯ i + j = 1 m ϖ ¯ i j L j η 1 h u u ˜ ς u u ˜ , i = 1 , 2 , , m .
The inequalities in Equations (9) and (10) exhibit Γ u Γ u ˜ ς u u ˜ , u , u ˜ P A P b θ , μ ( ν × Z , R 2 m , α ) . In line with assumption ( g 1 ) , the operator Γ is a contraction mapping. Consequently, Γ possess a unique fixed point u ^ = ( m ^ , p ^ ) T P A P b θ , μ ( ν × Z , R 2 m , α ) , i.e., Γ u ^ = u ^ . Hence, u ^ is a unique weighted pseudo-almost periodic sequence to GRNs Equation (1). This completes the proof. □
Remark 2.
Articles [12,38] studied the existence of a unique (weighted pseudo) almost periodic solution of continuous-time GRNs without spatial diffusions. However, this paper not only regards the spatial diffusions, but also studies the corollary responding to multi-variable discrete GRNs. So Theorem 2 complements the works of [12,38].

4. Finite-Time Guaranteed Cost Controls in Exponential Form

In this section, finite-time guaranteed cost controllers for SGRNs Equation (1) are designed based on the drive network, response network, and error network. The global exponential stability of SGRNs Equation (1) in the mean square sense is also discussed.

4.1. The Frame of Controlling GRNs

Let u ^ = ( m ^ , p ^ ) T P A P b θ , μ ( ν × Z , R 2 m , α ) be the unique weighted pseudo-almost periodic sequence to GRNs Equation (1), where m ^ = ( m ^ 1 , , m ^ m ) T and p ^ = ( p ^ 1 , , p ^ m ) T . That is,
m ^ i , k + 1 ν = e a i , k h m ^ i , k ν + 1 e a i , k h a i , k [ q = 1 n Θ i q Δ ˜ q 2 m ^ i , k ν + j = 1 m b i j , k f j ( p ^ j , k σ j , k ν ) + j = 1 m γ i j , k g j ( p ^ j , k μ j , k ν ) w 1 j , k + I i , k ] , p ^ i , k + 1 ν = e c i , k h p ^ i , k ν + 1 e c i , k h c i , k [ q = 1 n Π i q Δ ˜ q 2 p ^ i , k ν + j = 1 m ϖ i j , k η j ( m ^ j , k ν j , k ν ) w 2 j , k + d i , k m ^ i , k ν ] , ( ν , k ) ν × Z 0 ,
where i = 1 , 2 , , m . The initial and boundary values of GRNs Equation (11) can be described as
m ^ i , s · = φ ^ i , s · , p ^ i , s · = ϕ ^ i , s · , s [ σ 0 , 0 ] Z ; m ^ i , k ν | ν ν = 0 = p ^ i , k ν | ν ν , k Z 0 ,
where i = 1 , 2 , , m .
A controlling network is constructed as below:
m i , k + 1 ν = e a i , k h m i , k ν + 1 e a i , k h a i , k [ q = 1 n Θ i q Δ ˜ q 2 m i , k ν + j = 1 m b i j , k f j ( p j , k σ j , k ν ) + j = 1 m γ i j , k g j ( p j , k μ j , k ν ) w 1 j , k + I i , k ] + ρ i , k ν , p i , k + 1 ν = e c i , k h p i , k ν + 1 e c i , k h c i , k [ q = 1 n Π i q Δ ˜ q 2 p i , k ν + j = 1 m ϖ i j , k η j ( m j , k ν j , k ν ) w 2 j , k + d i , k m i , k ν ] + ϱ i , k ν , ( ν , k ) ν × Z 0 ,
where i = 1 , 2 , , m . The initial and boundary values of GRNs Equation (12) are given by
m i , s · = φ i , s · , p i , s · = ϕ i , s · , s [ σ 0 , 0 ] Z ; m i , k ν | ν ν = 0 = p i , k ν | ν ν , k Z 0 ,
where i = 1 , 2 , , m .
Let e i = m i m ^ i and w i = p i p ^ i , i = 1 , 2 , , m . Together with GRNs Equations (12) and (11), it yields
e i , k + 1 ν = e a i , k h e i , k ν + 1 e a i , k h a i , k [ q = 1 n Θ i q Δ ˜ q 2 e i , k ν + j = 1 m b i j , k f ˜ j ( w j , k σ j , k ν ) + j = 1 m γ i j , k g ˜ j ( w j , k μ j , k ν ) w 1 j , k ] + ρ i , k ν , w i , k + 1 ν = e c i , k h w i , k ν + 1 e c i , k h c i , k [ q = 1 n Π i q Δ ˜ q 2 w i , k ν + j = 1 m ϖ i j , k η ˜ j ( e j , k ν j , k ν ) w 2 j , k + d i , k e i , k ν ] + ϱ i , k ν ,
where
f ˜ j ( w j ) = f j ( p j ) f j ( p ^ j ) , g ˜ j ( w j ) = g j ( p j ) g j ( p ^ j ) , η ˜ j ( e j ) = g j ( m j ) g j ( m ^ j ) ,
in which ( ν , k ) ν × Z 0 , i , j = 1 , 2 , , m .
The state feedback controller is designed:
ρ i , k · = κ i e i , k · , ϱ i , k · = ϰ i w i , k · , k Z 0 ,
where κ i and ϰ i denote the controller gains to be determined later, i = 1 , 2 , , m .
Substituting controller Equation (14) into the error network Equation (13) leads to
e i , k + 1 ν = ( e a i , k h + κ i ) e i , k ν + 1 e a i , k h a i , k [ q = 1 n Θ i q Δ ˜ q 2 e i , k ν + j = 1 m b i j , k f ˜ j ( w j , k σ j , k ν ) + j = 1 m γ i j , k g ˜ j ( w j , k μ j , k ν ) w 1 j , k ] , w i , k + 1 ν = ( e c i , k h + ϰ i ) w i , k ν + 1 e c i , k h c i , k [ q = 1 n Π i q Δ ˜ q 2 w i , k ν + j = 1 m ϖ i j , k η ˜ j ( e j , k ν j , k ν ) w 2 j , k + d i , k e i , k ν ] , ( ν , k ) ν × Z 0 ,
where i = 1 , 2 , , m .
Similar to the derivation of Formula (4), we achieve
e i , k ν = s = 0 k 1 ( e a i , s h + κ i ) e i , 0 ν + v = 0 k 1 s = v + 1 k 1 ( e a i , s h + κ i ) ( 1 e a i , v h ) a i , v × q = 1 n Θ i q Δ ˜ q 2 e i , v ν + j = 1 m b i j , v f ˜ j ( w j , v σ j , v ν ) + j = 1 m γ i j , v g ˜ j ( w j , v μ j , v ν ) w 1 j , v , w i , k ν = s = 0 k 1 ( e c i , s h + ϰ i ) w i , 0 ν + v = 0 k 1 s = v + 1 k 1 ( e c i , s h + ϰ i ) ( 1 e c i , v h ) c i , v × q = 1 n Π i q Δ ˜ q 2 w i , v ν + d i , v e i , v ν + j = 1 m ϖ i j , v η ˜ j ( e j , v ν j , v ν ) w 2 j , v , ( ν , k ) ν × Z 0 ,
where i = 1 , 2 , , m . Moreover, it holds that
e i , s · = φ i , s · φ ^ i , s · , w i , s · = ϕ i , s · ϕ ^ i , s · , s [ σ 0 , 0 ] Z ; e i , k ν | ν ν = 0 = w i , k ν | ν ν , k Z 0 ,
where i = 1 , 2 , , m .
Definition 6.
State feedback controller Equation (14) finite-time stabilises GRNs Equation (12) with a finite-time exponential convergent form in case the error networks Equation (15) achieves finite-time exponential stability, i.e., for any ϵ ( 0 , 1 ) there exists δ > 0 , μ > 0 and integer K > 0 , ensuring that
φ 0 : = max 1 i m max ( ν , s ) ν × [ σ 0 , 0 ] Z e i , s ν 2 , w i , s ν 2 < δ
implies that
max 1 i m max ν ν e i , k ν 2 , w i , k ν 2 ϵ e μ k h , k [ 0 , K ] Z .
Herein, K is called the settling time.
Define a performance index J c K associated with the error networks Equation (15) by
J c K = E k = 0 K max ν ν U k ν T F U k ν ,
where
U = col ( e , ρ , w , ϱ ) , F = diag ( P 1 , Q 1 , P 2 , Q 2 ) ,
e = col ( e 1 , , e m ) , w = col ( w 1 , , w m ) ,
ρ = col ( ρ 1 , , ρ m ) , ϱ = col ( ϱ 1 , , ϱ m ) ,
P ı = P ı T > 0 , Q ı = Q ı T > 0 , ı = 1 , 2 .
Definition 7.
State feedback controller Equation (14) is said to be a finite-time guaranteed cost controller to GRNs Equation (12) in case it finite-time stabilises GRNs Equation (12) with an exponential convergent form and meets
J c K λ ,
where λ > 0 is a constant.

4.2. Design of Finite-Time Guaranteed Cost Controllers

From the first equation of the error networks Equation (16), we obtain
e i , k ν 2 = E | e i , k ν | 2 1 2 ( e a ̲ i h + κ i ) k e i , 0 ν 2 + v = 0 k 1 ( e a ̲ i h + κ i ) k v 1 ( 1 e a ̲ i h ) a ̲ i × q = 1 n | Θ i q | Δ ˜ q 2 e i , v ν 2 + j = 1 m b ¯ i j L j f w j , v σ j , v ν 2 + j = 1 m γ ¯ i j L j g w j , v μ j , v ν 2 h 1 2 ,
where ν ν , i = 1 , 2 , , m . Similarly,
w i , k ν 2 = E | w i , k ν | 2 1 2 ( e c ̲ i h + ϰ i ) k w i , 0 ν 2 + v = 0 k 1 ( e c ̲ i h + ϰ i ) k v 1 ( 1 e c ̲ i h ) c ̲ i × q = 1 n | Π i q | Δ ˜ q 2 w i , v ν 2 + d ¯ i e i , v ν 2 + j = 1 m ϖ ¯ i j L j η e j , v ν j , v ν 2 h 1 2 ,
where ν ν , i = 1 , 2 , , m .
Equations (18) and (19) are equal to
max ν ν e i , k ν 2 ( e a ̲ i h + κ i ) k max ν ν e i , 0 ν 2 + v = 0 k 1 ( e a ̲ i h + κ i ) k v 1 ( 1 e a ̲ i h ) a ̲ i × [ q = 1 n | Θ i q | max ν ν Δ ˜ q 2 e i , v ν 2 + j = 1 m b ¯ i j L j f max ν ν w j , v σ j , v ν 2 + j = 1 m γ ¯ i j L j g max ν ν w j , v μ j , v ν 2 h 1 2 ] ,
and
max ν ν w i , k ν 2 ( e c ̲ i h + ϰ i ) k max ν ν w i , 0 ν 2 + v = 0 k 1 ( e c ̲ i h + ϰ i ) k v 1 ( 1 e c ̲ i h ) c ̲ i × [ q = 1 n | Π i q | max ν ν Δ ˜ q 2 w i , v ν 2 + d ¯ i max ν ν e i , v ν 2 + j = 1 m ϖ ¯ i j L j η max ν ν e j , v ν j , v ν 2 h 1 2 ] , i = 1 , 2 , , m .
Theorem 3.
If ( g 2 ) and the following assumptions are fulfilled,
( g 5 )
The control gains κ i = e a ^ i h e a ̲ i h and ϰ i = e c ^ i h e c ̲ i h , where a ^ i and c ^ i are positive constants, i = 1 , 2 , , m .
( g 6 )
It holds that 1 e α ̲ h < max { υ 1 , υ 2 } < 1 e α ̲ h 1 e α ¯ h , where α ̲ = min 1 i m { a ^ i , c ^ i } and α ¯ = max 1 i m { a ^ i , c ^ i } ,
υ 1 = max 1 i m ( 1 e a ̲ i h ) a ̲ i q = 1 n 2 | Θ i q | 2 + j = 1 m b ¯ i j L j f + j = 1 m γ ¯ i j L j g h 1 2 ,
υ 2 = max 1 i m ( 1 e c ̲ i h ) c ̲ i q = 1 n 2 | Π i q | 2 + d ¯ i + j = 1 m ϖ ¯ i j L j η h 1 2 .
then state feedback controller Equation (14) is a finite-time guaranteed cost controller for GRNs Equation (12) with the settling time K satisfying
K < 1 α ¯ h ln 1 1 e α ̲ h max { υ 1 , υ 2 } .
Proof 
In accordance with ( g 6 ) , for any ϵ > 0 , we can select δ > 0 and 0 < μ < α ̲ to be small enough, causing
δ ϵ + max 1 i m 1 e ( a ^ i μ ) K h 1 e ( a ^ i μ ) h ( 1 e a ̲ i h ) e μ ( σ 0 + 1 ) h a ̲ i q = 1 n 2 | Θ i q | 2 + j = 1 m b ¯ i j L j f + j = 1 m γ ¯ i j L j g h 1 2 < 1 ,
δ ϵ + max 1 i m 1 e ( c ^ i 1 μ ) K h 1 e ( c ^ i 1 μ ) h ( 1 e c ̲ i h ) e μ ( σ 0 + 1 ) h c ̲ i q = 1 n 2 | Π i q | 2 + d ¯ i + j = 1 m ϖ ¯ i j L j η h 1 2 < 1 .
A method of reduction to absurdity will be adapted here, supposing that Equation (17) holds. If not, then one of the following two cases must be valid.
(a)
There exist k 0 ( 0 , T ] Z and i 0 { 1 , 2 , , m } such that
max 1 i m max ν ν e i , k ν 2 , w i , k ν 2 ϵ e μ k h , k [ 0 , k 0 ) Z ; max ν ν e i 0 , k 0 ν 2 > ϵ e μ k 0 h .
(b)
There exist k 1 ( 0 , T ] Z and i 1 { 1 , 2 , , m } ensuring
max 1 i m max ν ν e i , k ν 2 , w i , k ν 2 ϵ e μ k h , k [ 0 , k 1 ) Z ; max ν ν w i 1 , k 1 ν 2 > ϵ e μ k 1 h .
If ( a ) holds, from Equation (20) and ( g 5 ) we obtain
max ν ν e i 0 , k 0 ν 2 ( e a ̲ i 0 h + κ i 0 ) k 0 δ + v = 0 k 0 1 ( e a ̲ i 0 h + κ i 0 ) k 0 v 1 ( 1 e a ̲ i 0 h ) a ̲ i 0 × q = 1 n 2 | Θ i 0 q | 2 + j = 1 m b ¯ i 0 j L j f + j = 1 m γ ¯ i 0 j L j g h 1 2 e μ σ 0 h ϵ e μ v h e a ^ i 0 k 0 h δ + v = 0 k 0 1 e a ^ i 0 h ( k 0 v 1 ) ( 1 e a ̲ i 0 h ) a ̲ i 0 × q = 1 n 2 | Θ i 0 q | 2 + j = 1 m b ¯ i 0 j L j f + j = 1 m γ ¯ i 0 j L j g h 1 2 e μ σ 0 h ϵ e μ v h = e a ^ i 0 k 0 h δ + v = 0 k 0 1 e ( a ^ i 0 μ ) h ( k 0 v 1 ) ( 1 e a ̲ i 0 h ) a ̲ i 0 e μ ( σ 0 + 1 ) h × q = 1 n 2 | Θ i 0 q | 2 + j = 1 m b ¯ i 0 j L j f + j = 1 m γ ¯ i 0 j L j g h 1 2 ϵ e μ k 0 h ( δ ϵ e ( a ^ i 0 μ ) k 0 h + 1 e ( a ^ i 0 μ ) k 0 h 1 e ( a ^ i 0 μ ) h ( 1 e a ̲ i 0 h ) e μ ( σ 0 + 1 ) h a ̲ i 0 × q = 1 n 2 | Θ i 0 q | 2 + j = 1 m b ¯ i 0 j L j f + j = 1 m γ ¯ i 0 j L j g h 1 2 ) ϵ e μ k 0 h { δ ϵ + 1 e ( a ^ i 0 μ ) K h 1 e ( a ^ i 0 μ ) h ( 1 e a ̲ i 0 h ) e μ ( σ 0 + 1 ) h a ̲ i 0 × q = 1 n 2 | Θ i 0 q | 2 + j = 1 m b ¯ i 0 j L j f + j = 1 m γ ¯ i 0 j L j g h 1 2 } ϵ e μ k 0 h ϵ e μ k 0 h ,
which contradicts fact ( a ) .
On the other hand, if ( b ) holds, from Equation (21), we can likewise compute
max ν ν w i 1 , k 1 ν 2 ( e c ̲ i 1 h + ϰ i 1 ) k 1 δ + v = 0 k 1 1 ( e c ̲ i 1 h + ϰ i 1 ) k 1 v 1 ( 1 e c ̲ i 1 h ) c ̲ i 1 × q = 1 n 2 | Π i 1 q | 2 + d ¯ i 1 + j = 1 m ϖ ¯ i 1 j L j η h 1 2 e μ σ 0 h ϵ e μ v h e c ^ i 1 k 1 h δ + v = 0 k 1 1 e c ^ i 1 h ( k 1 v 1 ) ( 1 e c ̲ i 1 h ) c ̲ i 1 × q = 1 n 2 | Π i 1 q | 2 + d ¯ i 1 + j = 1 m ϖ ¯ i 1 j L j η h 1 2 e μ σ 0 h ϵ e μ v h = e c ^ i 1 k 1 h δ + v = 0 k 1 1 e ( c ^ i 1 μ ) h ( k 1 v 1 ) ( 1 e c ̲ i 1 h ) c ̲ i 1 e μ ( σ 0 + 1 ) h × q = 1 n 2 | Π i 1 q | 2 + d ¯ i 1 + j = 1 m ϖ ¯ i 1 j L j η h 1 2 ϵ e μ k 1 h ( δ ϵ e ( c ^ i 1 μ ) k 1 h + 1 e ( c ^ i 1 μ ) k 1 h 1 e ( c ^ i 1 μ ) h ( 1 e c ̲ i 1 h ) e μ ( σ 0 + 1 ) h c ̲ i 1 × q = 1 n 2 | Π i 1 q | 2 + d ¯ i 1 + j = 1 m ϖ ¯ i 1 j L j η h 1 2 ) ϵ e μ k 1 h { δ ϵ + 1 e ( c ^ i 1 μ ) K h 1 e ( c ^ i 1 μ ) h ( 1 e c ̲ i 1 h ) e μ ( σ 0 + 1 ) h c ̲ i 1 × q = 1 n 2 | Π i 1 q | 2 + d ¯ i 1 + j = 1 m ϖ ¯ i 1 j L j η h 1 2 } ϵ e μ k 1 h ϵ e μ k 1 h ,
which contradicts fact ( b ) . As a consequence, state feedback controller Equation (14) with the control gains in ( g 5 ) stabilises GRNs Equation (12) in finite time.
In light of Definition 7, the finite-time guaranteed cost control will be displayed as follows. It holds that
U T U = e ρ w ϱ e ρ w ϱ = i = 1 m e i 2 + ρ i 2 + w i 2 + ϱ i 2 = i = 1 m ( 1 + κ i 2 ) e i 2 + ( 1 + ϰ i 2 ) w i 2 i = 1 m 2 + κ i 2 + ϰ i 2 max { e i 2 , w i 2 } ,
which induces
J c K = E k = 0 K max ν ν U k ν T U k ν ϑ k = 0 K max 1 i m max ν ν e i , k ν 2 , w i , k ν 2 ϑ k = 0 K ϵ e μ k h λ ,
where ϑ = i = 1 m 2 + κ i 2 + ϰ i 2 and λ = ϑ 1 e μ h . Therefore, state feedback controller Equation (14) is a finite-time guaranteed cost controller for GRNs Equation (12). This completes the proof. □
If κ i = 0 = ϰ i in feedback controller Equation (14), then ρ i , k ν and ϱ i , k ν are vanished from GRNs Equation (12), ( ν , k ) ν × N 0 and i = 1 , 2 , , m . Based upon the proof of Theorem 3, we can easily obtain
Corollary 2.
Let assumptions ( g 2 ) ( g 4 ) hold. Then, GRNs Equation (1) is finite-time exponentially stable in a mean-square sense. Further, if ( g 1 ) holds, then GRNs Equation (1) admits a unique weighted pseudo almost periodic sequence solution, which is finite-time exponentially stable in a mean-square sense.

5. Example

This section gives an experimental example to verify the feasibility of the main results for discrete-space and -time stochastic GRNs, which have been addressed in the previous sections of this article.
Considering the following discrete-time stochastic GRNs with discrete spatial diffusions
m 1 , k + 1 ν m 2 , k + 1 ν = e 9 h 0 0 e 10 h m 1 , k ν m 2 , k ν + 1 e 9 h 9 0 0 1 e 10 h 10 [ 0.2 0 0 0.2 Δ ˜ 2 m 1 , k ν m 2 , k ν + 1.2 cos ( k π + π 4 ) + e | k | 0.5 0.3 1.8 sin ( k π + π 4 ) + e | k | f 1 ( p 1 , k 2 ν ) f 2 ( p 2 , k 1 ν ) + 0.2 0.1 0 0.15 g 1 ( p 1 , k 1 ν ) w 11 , k g 2 ( p 2 , k 1 ν ) w 12 , k + 1 + 0.2 cos ( k π + π 4 ) 0.5 + 0.5 sin ( k π + π 4 ) ] , p 1 , k + 1 ν p 2 , k + 1 ν = e 12 h 0 0 e 15 h p 1 , k ν p 2 , k ν + 1 e 12 h 12 0 0 1 e 15 h 15 [ 0.1 0 0 0.1 Δ ˜ 2 p 1 , k ν p 2 , k ν + 0.1 | m 1 , k ν | | m 2 , k ν | + cos ( k π + π 3 ) + e | k | 0.1 0 sin ( k π + π 5 ) + e | k | η 1 ( m 1 , k 1 ν ) w 21 , k η 2 ( m 2 , k 2 ν ) w 22 , k ] ,
where ( ν , k ) ( 0 , 10 ) × Z 0 ,
m i , k ν | ν = 0 = m i , k ν | ν = 10 = 0 , p i , k ν | ν = 0 = p i , k ν | ν = 10 = 0 , k Z 0 , i = 1 , 2 .
Taking h = 0.1 and = 0.5 . Corresponding to GRNs Equation (1),
a 1 , k = 9 , a 2 , k = 10 , c 1 , k = 12 , c 2 , k = 15 , Θ 11 = Θ 22 = 0.2 , Π 11 = Π 22 = 0.1 ,
Θ 12 = Θ 21 = Π 12 = Π 21 = 0 , b 11 , k = 1.2 cos ( k π + π 4 ) + e | k | , b 12 , k = 0.5 , b 21 , k = 0.3 ,
b 22 , k = 1.8 sin ( k π + π 4 ) + e | k | , σ 1 , k = 2 , σ 2 , k = 1 , γ 11 , k = 0.2 , γ 12 , k = 0.1 , γ 21 , k = 0 ,
γ 22 , k = 0.15 , I 1 , k = 1 + 0.2 cos ( k π + π 4 ) , I 2 , k = 0.5 + 0.5 sin ( k π + π 4 ) , d 1 , k = d 2 , k = 0.1 ,
ϖ 11 , k = cos ( k π + π 3 ) + e | k | , ϖ 12 , k = 0.1 , ϖ 21 , k = 0 , ϖ 22 , k = sin ( k π + π 5 ) + e | k | ,
f 1 ( p 1 , k 2 ν ) = p 1 , k 2 ν 15 2 1 + p 1 , k 2 ν 15 2 , f 2 ( p 2 , k 1 ν ) = p 2 , k 1 ν 15 2 1 + p 2 , k 1 ν 15 2 , g i ( p i , k 1 ν ) = p i , k 1 ν 20 2 1 + p i , k 1 ν 20 2 ,
η 1 ( m 1 , k 1 ν ) = m 1 , k 1 ν 10 2 1 + m 1 , k 1 ν 10 2 , η 2 ( m 2 , k 2 ν ) = m 2 , k 2 ν 10 2 1 + m 2 , k 2 ν 10 2 , i = 1 , 2 , ( ν , k ) ( 0 , 10 ) × Z 0 .
Obviously, L 1 f = L 2 f = 1 15 , L 1 g = L 2 g = 0.05 , L 1 η = L 2 η = 0.1 . It follows from the direct calculation that max { ς 1 , ς 2 } < 1 . Therefore, assumptions ( g 1 ) ( g 4 ) in Theorem 2 are valid, i.e., GRNs Equation (22) possesses a unique weighted pseudo- or α -pseudo-almost periodic sequence solution, see Figure 1 and Figure 2. Let a ^ 1 = 1.25 , a ^ 2 = 12 , c ^ 1 = 14 , and c ^ 2 = 7 . Then, the state feedback controllers corresponding to Equation (14) are listed as follows:
ρ 1 , k · = 0.4983 e 1 , k · , ρ 2 , k · = 0.0667 e 2 , k · , ϱ 1 , k · = 0.0546 w 1 , k · , ϱ 2 , k · = 0.2735 w 2 , k · ,
where k Z 0 . Moreover, assumptions ( g 2 ) and ( g 5 ) ( g 6 ) in Theorem 3 hold. Then, the state feedback controller Equation (23) is a finite-time guaranteed cost controller for GRNs Equation (22) with the settling time K satisfying K < 4.0294 , see Figure 3, Figure 4, Figure 5 and Figure 6. Finally, the trajectories of the finite-time exponential stability of GRNs Equation (22) in three-dimensional and two-dimensional spaces are shown in Figure 7, Figure 8, Figure 9 and Figure 10.
In Figure 1 and Figure 2, the pictures show the weighted pseudo-almost periodicity of m and p in GRNs Equation (22). From these pictures, we can observe that the solution of GRNs Equation (22) is not weighted pseudo-almost periodic at the beginning of the time, but it becomes almost periodic as the time increases.
In Figure 3 and Figure 4, the pictures show the trajectories of m and p in GRNs Equation (22) with feedback controls in the closed loop. By observing these pictures, we can observe that the solutions of GRNs Equation (22) with different initial values realise finite-time exponential stability in three-dimensional space. Figure 5 and Figure 6 give the trajectories of m and p of GRNs Equation (22) with feedback controls in the closed loop when ν = 6 .
Figure 7 and Figure 8 show the solutions of GRNs Equation (22) without feedback control, realising finite-time exponential stability in three-dimensional space. Figure 9 and Figure 10 draw the solutions of GRNs Equation (22) without feedback control, realising finite-time exponential stability when ν = 8 .

6. Conclusions and Perspectives

Utilizing EED and CFT techniques, discrete stochastic genetic regulatory networks with discrete spatial diffusion are presented, which can be considered as fully discrete configurations of stochastic genetic regulatory networks with reaction diffusion. Based on the constant variable formulation in discrete form, the existence uniqueness, the finite-time guaranteed cost control, and the exponential stability of the weighted pseudo- θ -almost periodic sequence of such discrete stochastic genetic regulatory networks in the mean-square sense are discussed. In addition, Lemmas 2 and 3, among others, have been crucial to the discussion in this paper over the course of the study. Notably, the work in this paper will initiate the development of qualitative problems in discrete-time and discrete-space models, laying the theoretical and practical foundations for future work in this area.

Author Contributions

Conceptualization, S.S. and T.Z.; Methodology, S.S. and T.Z.; Formal analysis, S.S., T.Z. and Z.L.; Investigation, S.S., T.Z. and Z.L.; Writing—original draft, S.S., T.Z. and Z.L.; Writing—review and editing, S.S., T.Z. and Z.L. All authors have read and agreed to the published version of the manuscript.

Funding

This work was supported by the Key Laboratory of Complex Dynamics System and Application Analysis of Department of Education of Yunnan Province.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Alon, U. An Introductin to Systems Biology: Design Principles of Biological Circuits; CRC: London, UK, 2006. [Google Scholar]
  2. Thieffry, D.; Thomas, R. Qualitative analysis of gene networks. Proc. Pac. Symp. Biocomput. 1998, 3, 77–88. [Google Scholar]
  3. Bao, W.Z.; Yuan, C.A.; Zhang, Y.H. Mutli-features prediction of protein translational modification sites. IEEE/ACM Trans. Comput. Biol. Bioinf. 2018, 15, 1453–1460. [Google Scholar] [CrossRef] [PubMed]
  4. Somogyi, R.; Sniegoski, C. Modeling the complexity of genetic networks: Understanding multigenic and pleiotropic regulation. Complexity 1996, 1, 45–63. [Google Scholar] [CrossRef]
  5. de Jong, H. Modeling and simuation of genetic regulatory systems: A literature review. J. Comput. Biol. 2002, 9, 67–103. [Google Scholar] [CrossRef] [PubMed]
  6. Barabási, A.; Gulbahce, N.; Loscalzo, J. Network medicien: A network-based approach to human disease. Nat. Rev. Genet. 2011, 12, 56–68. [Google Scholar] [CrossRef] [PubMed]
  7. Song, Q.; Long, L.; Zhao, Z.; Liu, Y.; Alsaadi, F.E. Stability criteria of quatemion-valued neutral-type delayed neural networks. Neurocomputing 2020, 412, 287–294. [Google Scholar] [CrossRef]
  8. Hood, L.; Health, J.; Phelps, M.; Lin, B. Systems biology and new technologies enable predictive and preventative medicine. Science 2004, 306, 640–643. [Google Scholar] [CrossRef]
  9. Liu, R.J.; Lu, J.Q.; Lou, J.G.; Alsaedi, A.; Alsaedi, F.E. Set stabiliation of Boolean networks under pinning contril strategy. Neurocomputing 2017, 260, 142–148. [Google Scholar] [CrossRef]
  10. Possieri, C.; Teel, A.R. Asymptotic stability in probability for stochastic Boolean Networks. Automatica 2017, 83, 1–9. [Google Scholar] [CrossRef]
  11. Zhang, X.Y.; Wang, Y.T.; Zhang, X. Improved stochastic integral inequalities to stability analysis of stochastic genetic regulatory networks with mixed time-varying delays. IET Control Theory Appl. 2020, 14, 2439–2448. [Google Scholar] [CrossRef]
  12. Ayachi, M. Existence and exponential stability of weighted pseudo-almost periodic solutions for genetic regulatory networks with time-varying delays. Int. J. Biomath. 2021, 14, 2150006. [Google Scholar] [CrossRef]
  13. Chen, T.; He, H.Y.; Church, G.M. Modeling gene expression with differential equations. Pac. Symp. Biocomput. 1999, 4, 29–40. [Google Scholar]
  14. Han, Y.Y.; Zhang, X.; Wang, Y.T. Asymptotic Stability Criteria for genetic regulatory networks with time-varying delays and reaction-diffusion terms. Circ. Syst. Signal Process 2015, 34, 3161–3190. [Google Scholar] [CrossRef]
  15. Zou, C.Y.; Zhou, C.J.; Zhang, Q.; He, V.Y.; Huang, C. State emstimation for delayed genetic regulatory networks with reaction diffusion terms and Markovian jump. Complex Intell. Syst. 2023, 1–15. [Google Scholar] [CrossRef]
  16. Xie, Y.P.; Xiao, L.; Wang, L.M.; Wang, G.H. Algebriaic Stability Criteria of Reaction Diffusion Genetic Regulatory Neteorks With Discrete and Distrubted Delays. IEEE Access 2021, 9, 16410–16418. [Google Scholar] [CrossRef]
  17. Xue, Y.; Liu, C.Y.; Zhang, X. State bounding description and reachable set estimation for discrete-time genetic regulatory networks with time-varying delays and bounded disturbances. IEEE Trans. Syst. Man Cybern. Syst. 2022, 52, 6652–6661. [Google Scholar] [CrossRef]
  18. Liu, C.Y.; Wang, X.; Xue, Y. Global exponential stability analysis of discrete-time genetic regulatory networks with time-varying discrete delays and unbounded distributed delays. Neurocomputing 2020, 372, 100–108. [Google Scholar] [CrossRef]
  19. Yue, D.D.; Guan, Z.H.; Chen, J.; Ling, G.; Wu, Y. Bifurcations and chaos of a discrete-time model in genetic regulatory networks. Nonlinear Dyn. 2017, 87, 567–586. [Google Scholar] [CrossRef]
  20. Zhang, T.W.; Li, Y.K. Global exponential stability of discrete-time almost automorphic Caputo—Fabrizio BAM fuzzy neural networks via exponential Euler technique. Knowl.-Based Syst. 2022, 246, 108675. [Google Scholar] [CrossRef]
  21. Huang, Z.K.; Mohamad, S.; Gao, F. Multi-almost periodicity in semi-discretizations of a general class of neural networks. Math. Comput. Simul. 2014, 101, 43–60. [Google Scholar] [CrossRef]
  22. Zhang, T.W.; Han, S.F.; Zhou, J.W. Dynamic behaviours for semi-discrete stochastic Cohen-Grossberg neural networks with time delays. J. Frankl. Inst. 2020, 357, 13006–13040. [Google Scholar] [CrossRef]
  23. Zhang, T.W.; Qu, H.Z.; Liu, Y.T.; Zhou, J.W. Weighted pseudo θ-almost periodic sequence solution and guaranteed cost control for discrete-time and discrete-space stochastic inertial neural networks. Chaos Solitons Fractals 2023, 173, 113658. [Google Scholar] [CrossRef]
  24. Zhang, T.W.; Li, Z.H. Switching clusters’ synchronization for discrete space-time complex dynamical networks via boundary feedback controls. Pattern Recognit. 2023, 143, 109763. [Google Scholar] [CrossRef]
  25. Zhang, T.W.; Liu, Y.T.; Qu, H.Z. Global mean-square exponential stability and random periodicity of discrete-time stochastic inertial neural networks with discrete spatial diffusions and Dirichlet boundary condition. Comput. Math. Appl. 2023, 141, 116–128. [Google Scholar] [CrossRef]
  26. Xu, G.X.; Bao, H.B.; Cao, J.D. Mean-square exponential input-to-state stability of stochastic gene regulatory networks with maltiple time delays. Neural Process. Lett. 2020, 51, 271–286. [Google Scholar] [CrossRef]
  27. Zhou, J.; Xu, S.; Shen, H. Finite-time robust stochastic stability of uncertain stochastic delayed reaction-diffusion genetic regulatory networks. Neurocomputing 2011, 74, 2790–2796. [Google Scholar] [CrossRef]
  28. Wang, W.Q.; Zhong, S.M.; Liu, F. Robust filtering of uncertain stochastic genetic regulatory networks with time-varying delays. Chaos Solitons Fract. 2012, 45, 915–929. [Google Scholar] [CrossRef]
  29. Wang, B. Random periodic sequence of globally mean-square exponentially stable discrete-time stochastic genetic regulatory networks with discrete spatial diffusions. Electron. Res. Arch. 2023, 31, 3097–3122. [Google Scholar] [CrossRef]
  30. Zhang, G.P.; Zhu, Q.X. Finite-time guaranteed cost control for uncertain delayed switched nonlinear stochastic systems. J. Frankl. Institeu 2022, 359, 8802–8818. [Google Scholar] [CrossRef]
  31. Gao, H.; Zhang, H.B.; Shi, K.B.; Zhou, K. Event-triggered finite-time guaranteed cost control for networked Takagi-Sugeno (T-S) fuzzy switched systems under denial of service attacks. Int. J. Robust Nolinear Control 2022, 32, 5764–5775. [Google Scholar] [CrossRef]
  32. Liu, L.P.; Di, Y.F.; Shang, Y.L.; Fu, Z.M.; Fan, B. Guaranteed Cost and Finite-Time Non-fragile Control of Fractional-Order Positive Switched Systems with Asynchronous Switching and Impulsive Moments. Circuits Syst. Signal Process. 2021, 40, 3143–3160. [Google Scholar] [CrossRef]
  33. Liu, M.X.; Wu, B.W.; Wang, Y.E.; Liu, L.L. Dynamic Output Feedback Control and Guaranteed Cost Finite-time Boundedness for Uncertain Switched Linear Systems. Int. J. Control Autom. Syst. 2023, 21, 400–409. [Google Scholar] [CrossRef]
  34. Liu, M.X.; Wu, B.W.; Wang, Y.E.; Liu, L.L. Dynamic Output Feedback control and Guaranteed Cost Finite-Time Boundedness for Switched Linear Systems. Circuits Syst. Signal Process. 2022, 41, 2653–2668. [Google Scholar] [CrossRef]
  35. Liu, X.K.; Li, W.C.; Yao, C.X.; Li, Y. Finite-Time Guaranteed Cost Control for Markovian Jump Systems with Time-Varying Delays. Mathematics 2022, 10, 2028. [Google Scholar] [CrossRef]
  36. Zhang, X.; Yin, Y.Y.; Wang, H.; He, S.P. Finite-time dissipative control for time-delay Markov jump systems with conic-type non-linearities under guaranteed cost controller and quantiser. IET Control Theory Appl. 2021, 15, 489–498. [Google Scholar] [CrossRef]
  37. Luo, Y.P.; Wang, X.E.; Cao, J.D. Guaranteed-cost finite-time consensus of multi-agent systems via intermittent control. Math. Methods Appl. Sci. 2022, 45, 697–717. [Google Scholar] [CrossRef]
  38. Duan, L.; Di, F.J.; Wang, Z.Y. Existence and global exponential stability of almost periodic solutions of genetic regulatory networks with time-varying delays. J. Exp. Theor. Artif. Intell. 2020, 32, 453–463. [Google Scholar] [CrossRef]
  39. Luo, Q.; Zhang, R.B.; Liao, X.X. Unconditional global exponential stability in Lagrange sense of genetic regulatory networks with SUM regulatory logic. Cogn. Neurodyn. 2010, 4, 251–261. [Google Scholar] [CrossRef]
  40. Li, Y.J.; Zhang, X.; Tan, C. Global exponential stability analysis of discrete-time genetic regulatory networks with time delays. Asian J. Control 2013, 15, 1448–1475. [Google Scholar] [CrossRef]
  41. Xie, Y.P.; Xiao, L.; Ge, M.F.; Wang, L.M.; Wang, G.H. New results on global exponential stability of genetic regulatory networks with diffusion effect and time-varying hybird delays. Neural Process. Lett. 2021, 53, 3947–3963. [Google Scholar] [CrossRef]
  42. Liu, Z.X.; Yang, X.; Yu, T.T.; Zhang, X.; Wang, X. Global Exponential Satbility Analysis of Coupled Cyclic Genentic Regulatory Networks With Constant Delays. IEEE Trans. Control Netw. Syst. 2021, 8, 1811–1821. [Google Scholar] [CrossRef]
  43. Zhang, W.L.; Zheng, Z.H. Random almost periodic solutions of random dynamical systems. arXiv 2019, arXiv:1909.01586. [Google Scholar]
  44. de Fitte, P.R. Almost periodicity and periodicity for nonautonomous random dynamical systems. Stochastics Dyn. 2020, 21, 2150034. [Google Scholar] [CrossRef]
  45. Marie, N.; Fitte, P.R.D. Almost periodic and periodic solutions of differential equations driven by the fractional Brownian motion with statistical application. Stochastics 2020, 93, 886–906. [Google Scholar] [CrossRef]
  46. Zhang, C. Pseudo almost periodic solutions of some differential equations. J. Math. Anal. Appl. 1994, 181, 62–76. [Google Scholar] [CrossRef]
  47. Diagana, T. Weighted pseudo-almost periodic functions and applications. Comptes Rendus Math. 2006, 343, 643–646. [Google Scholar] [CrossRef]
  48. Es-saiydy, M.; Zitane, M. New composition theorem for weighted stepanov-like pseudo almost periodic functions on time scales and applications. Bol. Soc. Parana. Mat. 2023, in press. [CrossRef]
  49. Yan, Z. Sensitivity analysis for a fractional stochastic differential equation with S-p-weighted pseudo almost periodic coefficients and infinite delay. Fract. Calc. Appl. Anal. 2022, 25, 2356–2399. [Google Scholar] [CrossRef]
  50. M’Hamdi, M.S. On the weighted pseudo almost-periodic solutions of static DMAM neural network. Neural Process. Lett. 2022, 54, 4443–4464. [Google Scholar] [CrossRef]
  51. Hu, P.; Huang, C.M. Delay dependent asymptotic mean square stability analysis of the stochastic exponential Euler method. J. Comput. Appl. Math. 2021, 382, 113068. [Google Scholar] [CrossRef]
  52. Zhang, T.W.; Li, Y.K. Exponential Euler scheme of multi-delay Caputo-Fabrizio fractional-order differential equations. Appl. Math. Lett. 2022, 124, 107709. [Google Scholar] [CrossRef]
  53. Bessaih, H.; Garrido-Atienza, M.J.; Köpp, V.; Schmalfuß, B.; Yang, M. Synchronization of stochastic lattice equations. Nonlinear Differ. Equ. Appl. Nodea 2020, 27, 36. [Google Scholar] [CrossRef]
  54. Han, X.Y.; Kloeden, P.E. Sigmoidal approximations of Heaviside functions in neural lattice models. J. Differ. Equ. 2020, 268, 5283–5300. [Google Scholar] [CrossRef]
  55. Han, X.Y.; Kloden, P.E.; Usman, B. Upper semi-continuous convergence of attractors for a Hopfield-type lattice model. Nonlinearity 2020, 33, 1881–1906. [Google Scholar] [CrossRef]
  56. Kuang, J.C. Applied Inequalities; Shandong Science and Technology Press: Shandong, China, 2012. [Google Scholar]
  57. Arnold, L. Random Dynamical Systems; Springer: Berlin, Germany, 1998. [Google Scholar]
Figure 1. Weighted pseudo-almost periodic sequence solution of m 1 , k 3 and m 2 , k 3 .
Figure 1. Weighted pseudo-almost periodic sequence solution of m 1 , k 3 and m 2 , k 3 .
Axioms 12 00682 g001
Figure 2. Weighted pseudo-almost periodic sequence solution of p 1 , k 3 and p 2 , k 3 .
Figure 2. Weighted pseudo-almost periodic sequence solution of p 1 , k 3 and p 2 , k 3 .
Axioms 12 00682 g002
Figure 3. Finite-time guaranteed cost controller for m 1 , k ν and m 2 , k ν with the settling time K satisfying K < 4.0294 .
Figure 3. Finite-time guaranteed cost controller for m 1 , k ν and m 2 , k ν with the settling time K satisfying K < 4.0294 .
Axioms 12 00682 g003
Figure 4. Finite-time guaranteed cost controller for p 1 , k ν and p 2 , k ν with the settling time K satisfying K < 4.0294 .
Figure 4. Finite-time guaranteed cost controller for p 1 , k ν and p 2 , k ν with the settling time K satisfying K < 4.0294 .
Axioms 12 00682 g004
Figure 5. Finite-time guaranteed cost controller for m 1 , k 6 and m 2 , k 6 with the settling time K satisfying K < 4.0294 .
Figure 5. Finite-time guaranteed cost controller for m 1 , k 6 and m 2 , k 6 with the settling time K satisfying K < 4.0294 .
Axioms 12 00682 g005
Figure 6. Finite-time guaranteed cost controller for p 1 , k 6 and p 2 , k 6 with the settling time K satisfying K < 4.0294 .
Figure 6. Finite-time guaranteed cost controller for p 1 , k 6 and p 2 , k 6 with the settling time K satisfying K < 4.0294 .
Axioms 12 00682 g006
Figure 7. Finite-time exponential stability of m 1 , k ν and m 2 , k ν .
Figure 7. Finite-time exponential stability of m 1 , k ν and m 2 , k ν .
Axioms 12 00682 g007
Figure 8. Finite-time exponential stability of p 1 , k ν and p 2 , k ν .
Figure 8. Finite-time exponential stability of p 1 , k ν and p 2 , k ν .
Axioms 12 00682 g008
Figure 9. Finite-time exponential stability of m 1 , k 8 and m 2 , k 8 .
Figure 9. Finite-time exponential stability of m 1 , k 8 and m 2 , k 8 .
Axioms 12 00682 g009
Figure 10. Finite-time exponential stability of p 1 , k 8 and p 2 , k 8 .
Figure 10. Finite-time exponential stability of p 1 , k 8 and p 2 , k 8 .
Axioms 12 00682 g010
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

Sun, S.; Zhang, T.; Li, Z. Weighted Pseudo-θ-Almost Periodic Sequence and Finite-Time Guaranteed Cost Control for Discrete-Space and Discrete-Time Stochastic Genetic Regulatory Networks with Time Delays. Axioms 2023, 12, 682. https://doi.org/10.3390/axioms12070682

AMA Style

Sun S, Zhang T, Li Z. Weighted Pseudo-θ-Almost Periodic Sequence and Finite-Time Guaranteed Cost Control for Discrete-Space and Discrete-Time Stochastic Genetic Regulatory Networks with Time Delays. Axioms. 2023; 12(7):682. https://doi.org/10.3390/axioms12070682

Chicago/Turabian Style

Sun, Shumin, Tianwei Zhang, and Zhouhong Li. 2023. "Weighted Pseudo-θ-Almost Periodic Sequence and Finite-Time Guaranteed Cost Control for Discrete-Space and Discrete-Time Stochastic Genetic Regulatory Networks with Time Delays" Axioms 12, no. 7: 682. https://doi.org/10.3390/axioms12070682

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