Next Article in Journal
Solvability of Singular Fractional-Order Differential Equations with a Perturbation Term
Previous Article in Journal
Some Categories of Compactness and Connectedness in Generalized Topological Spaces
Previous Article in Special Issue
A Computational Approach to the Perimeter-Area Inequality in a Triangle
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

pth Moment Exponential Synchronization of Fuzzy Stochastic Cellular Neural Networks with Discrete and Infinite Delays

1
Department of Mathematics, Northeast Forestry University, Harbin 150040, China
2
Engineering Research Center of Agricultural Microbiology Technology, Ministry of Education, Harbin 150080, China
3
Heilongjiang Provincial Key Laboratory of Ecological Restoration and Resource Utilization for Cold Region, Harbin 150080, China
4
School of Mathematical Science, Heilongjiang University, Harbin 150080, China
*
Author to whom correspondence should be addressed.
Axioms 2025, 14(2), 142; https://doi.org/10.3390/axioms14020142
Submission received: 23 January 2025 / Revised: 12 February 2025 / Accepted: 15 February 2025 / Published: 19 February 2025
(This article belongs to the Special Issue Recent Advances in Applied Mathematics and Artificial Intelligence)

Abstract

:
In this paper, we consider the pth moment exponential synchronization (PMES) of fuzzy stochastic cellular neural networks (FSCNNs) with discrete and infinite delays. In order to achieve pth-moment exponential synchronization of FSCNNs with discrete and infinite delays, we design an appropriate feedback controller. Using the Lyapunov function method and theories of infinite delayed systems, we obtain some sufficient conditions to ensure the pth-moment exponential synchronization of the system. Finally, to verify the effectiveness of our results, we provide a numerical simulation example. Our results extend the pth-moment exponential synchronization of FSCNNs from finite delays systems to infinite delays systems.

1. Introduction

In recent decades, cellular neural networks (CNNs) have shown their effectiveness in many application domains such as pattern identification [1] and associative memory [2]. In order to optimize the design of CNNs and broaden their practical applications, various dynamic characteristics of CNNs have been thoroughly investigated. In particular, the synchronization behavior of CNNs has been a focus and attracted a lot of research interest in the past few decades [3,4,5,6].
Considering the inherent uncertainty and imprecision in real systems, Yang et al. [7] innovatively integrated fuzzy logic into the traditional cellular neural networks architecture and introduced the concept of fuzzy cellular neural networks (FCNNs) for the first time in 1966. In contrast with conventional CNNs, FCNNs show better ability when performing complex nonlinear filtering tasks, which significantly improves their adaptability and effectiveness in a variety of practical application scenarios. In view of the wide application prospects of FCNNs in many fields, it is particularly important to explore its dynamic characteristics, especially the synchronization behavior [8,9,10].
As the limited information transmission speed will cause a delay effect in the implementation process of neural networks, Roska and Chua [11] integrated the influence of time delays into the fundamental framework of conventional CNNs and pioneered the concept of time-delayed CNNs in 1990. On this basis, Wei et al. [12] further proposed fuzzy logic to address uncertainty and investigated the FCNNs with discrete delays. Moreover, random fluctuations and other variables in the process of neurotransmitter release tend to disrupt synaptic transmission and generate random interference. Therefore, incorporating random disturbances into the analysis of the dynamic properties of CNNs is quite significant. In light of this perspective, Chen and Zhao [13] elaborated on the notion of FSCNNs with time delays in 2008 and delved deeper into the exponential stability of such networks. At present, there are many research results about the synchronization of FSCNNs. In 2018, Zhang et al. [14] established a class of FSCNNs defined on time scales, demonstrated the system’s exponential stability, and revealed periodic solutions. In [15,16,17], the authors used the Lyapunov method and stochastic analysis techniques to design feedback and adaptive controllers, such that FSCNNs with discrete and distributed delays can achieve synchronization at a finite or fixed time.
It is worth mentioning that most researchers are primarily concerned with the synchronization problems of FSCNNs with finite time delays currently. However, some scholars have found that the totality of a neuron’s past states often exerts a profound influence on its present state and proposed the phenomenon of infinite delays [18,19,20,21]. The finite time delay means that the current state of the system is only affected by the previous time period τ . It is unreasonable in some cases, because the neural network accumulates more information over time [22], while some complex systems usually accumulate information and respond over a longer period of time. At the same time, in many practical situations, the current behavior of a neuron is related to its entire past state [23]. Therefore, in many cases, infinite delay is more applicable. Considering infinite delay can not only help to optimize the existing FSCNNs, especially when dealing with complex systems or multi-time domain information, it can provide higher simulation accuracy, but also better simulate the long-term memory effect of real systems. That is to say that accounting for infinite delays is of importance when addressing the synchronization issue in the realm of FSCNNs. In 2010, Li and Fu [24] established a set of theorems about the pth moment exponential stability and global convergence properties of differential equations with infinite delay by effectively using both Razumikhin techniques and Lyapunov function method. The application of these theorems has facilitated the study of pth moment exponential stability in a class of stochastic recurrent neural networks with infinite delays and provided insights into the synchronization of related models. But, the research on FSCNNs synchronization under infinite delays conditions is still limited. This prompted us to investigate the pth moment exponential synchronization in FSCNNs with infinite delays in this paper.
In this paper, the Lyapunov function method and pth moment exponential synchronization principle are used. At the same time, the related theorems of infinite delay differential equations with pth moment exponential stability in reference [24] are also used. Unlike the study of pth-moment exponential synchronization in traditional cellular neural networks [25], the neural network model studied in this paper uses a fuzzy term and infinite delays. Therefore, during the mathematical derivation, we perform additional scaling based on the mathematical characteristics of the fuzzy term and the related properties of the infinite delays. At the same time, the traditional method of verifying pth-moment exponential synchronization is mainly based on the definition of pth moment exponential synchronization [26]. However, considering the addition of infinite delays, based on the study of infinite delays in reference [24], in this paper, we use the Lyapunov function method and inequality scaling to study the pth moment exponential synchronization of FSCNNs. At the same time, the conditions for the realization of pth-moment exponential synchronization of FSCNNs with infinite delays are given and proved. The purpose is to study the synchronization issue of a class of FSCNNs with both infinite and discrete delays.
N o t a t i o n s . The symbol Λ = { 1 , 2 , . . . , n } is used, as well as the positive real number set R + = ( 0 , + ) . The n-dimensional Euclidean space is represented by the symbol R n . The expected value in mathematics is represented by E ( · ) . L represents the Itô differential operator, which is derived from the Itô formula. The function sgn ( · ) represents the sign function. The complete probability space ( Ω , F , F , P ) has F as the σ -algebra of Ω , P as the probability measure defined therein, and Ω as the set of all possible basic results of random experiments. The filter F = { F t } t 0 in this space is right continuous, meaning it satisfies the standard condition. Its initial value F 0 contains all P zero sets. Additionally, | · | is a symbol for the Euclidean norm for vectors. The symbol C 2 , 1 ( [ α , ) × R n , R + ) , α [ , 0 ) , indicates the class v ( t , x ) of nonnegative functions that are linearly and quadratically differentiable for t and x, respectively. BC ( [ α , 0 ] , R n ) is the space of bounded and continuously differentiable functions on the closed interval [ α , 0 ] and its range is in R n . α β is a mathematical operation that takes a smaller value or a minimum value between α and β .

2. Materials and Methods

Consider the n-dimensional stochastic functional differential equation system with infinite delays:
d x ( t ) = f ( t , x ( t ) , x t ) d t + σ ( t , x ( t ) , x t ) d B ( t ) , t 0 , x 0 = ξ ,
where x ( t ) = ( x 1 ( t ) , , x n ( t ) ) T and the initial value is ξ BC F 0 ( [ α , 0 ] , R n ) . x t = x ( t + θ ) : α θ 0 can be regarded as a C ( [ α , 0 ] , R n ) value random process, where α [ , 0 ) . In particular, when α = , the interval [ t + α , t ] is interpreted as ( , t ] . f : R + × R n × C ( [ α , 0 ] , R n ) R n , σ : R + × R n × C ( [ α , 0 ] , R n ) R n × m . The set of F t -measurable random variables φ that take values in BC ( [ α , 0 ] , R n ) and satisfy sup α θ 0 E | φ ( θ ) | p < is represented by BL F t p ( [ α , 0 ] , R n ) .
Definition 1
([27,28]). For any initial state ξ BC F 0 , if M and λ are positive constants, and the inequality E | x ( t , ξ ) | p < M E | | ξ | | α p e λ t holds, then the equilibrium solution of system (1) is said to be pth moment exponentially stable. When p = 2 , the system is typically referred to as the mean square exponential stability.
Lemma 1
([24]). Suppose c 1 , c 2 , and p are positive, and q > 1 . Suppose there exists a function V C 2 , 1 ( [ α , ) × R n , R + ) and positive numbers λ, η, such that the following conditions hold: (i) c 1 | x | p V ( t , x ) c 2 | x | p for all ( t , x ) [ α , ) × R n ; (ii) E L V ( t , φ ) λ E V ( t , φ ( 0 ) ) , whenever e η θ E V ( t + θ , φ ( θ ) ) < q E V ( t , φ ( 0 ) ) for all α θ 0 , where φ BL F t p ( [ α , 0 ] , R n ) . Under infinite delays, the equilibrium solution of the Equation (1) exhibits pth-moment exponential stability, and the pth moment Lyapunov exponent is less than λ η .
A category of FSCNNs with discrete and infinite delays is examined in this paper. Its mathematical expression is as follows:
d x i ( t ) = [ α i x i ( t ) + j = 1 n k i j f ( x j ( t ) ) + j = 1 n h i j f ( x j ( t τ ) ) + j = 1 n w i j t q j t s f ( x j ( s ) ) d s + j = 1 n m i j g ( x j ( t τ ) ) + j = 1 n l i j g ( x j ( t τ ) ) + j = 1 n s i j t q j t s g ( x j ( s ) ) d s + j = 1 n v i j t q j ( t s ) g ( x j ( s ) ) d s + j = 1 n C i j γ j + j = 1 n R i j γ j + A i ] d t + σ i ( t , x i ( t ) , t q i ( t s ) h ( x i ( s ) ) d s ) d B ( t ) .
For each i , j Λ , x i ( t ) denotes the state of the ith neuron at time t, and α i is the passive decay rate of the ith neuron’s state. The feedback template elements are represented by the parameters k i j , h i j , and w i j . The jth neuron’s activation functions are represented by the functions f ( · ) , g ( · ) , and h ( · ) : R R . σ i represents the noise intensity that affects the ith neuron. The variable γ i represents the input stimulus of the ith neuron, and A i represents the deviation of the ith neuron. m i j and s i j symbolize the components of the fuzzy feedback MIN template, whereas l i j and v i j embody the constituents of the fuzzy feedback MAX structure. The elements C i j and R i j belong to the fuzzy feedforward MIN and MAX templates, respectively. τ > 0 represents the time delay, and the kernel delay function q j is a continuous, non-negative real-valued function that is defined over a given interval and complies with certain requirements that are explained later. q i ( t ) Q ( t ) , i Λ , where Q ( t ) is a continuous function satisfying the integral constraint 0 + Q ( s ) e η ˜ s d s < , with η ˜ being a positive constant. In addition, t q j t s f ( x j ( s ) ) d s is a term with distributed infinite time delay. f ( x j ( t τ ) ) is a term with a discrete time delay, where τ represents the signal transmission delay between the ith neuron and jth neuron.
Remark 1.
Compared with the FSCNNs with bounded time delays in reference [13,14,15], our model has infinite time delays, which is more appropriate to the real world and has a wider role.
In this section, we regard system (2) as the drive system of the problem to be studied. The response system of FSCNNs with controllers is as follows:
d y i ( t ) = [ α i y i ( t ) + j = 1 n k i j f ( y j ( t ) ) + j = 1 n h i j f ( y j ( t τ ) ) + j = 1 n w i j t q j t s f ( y j ( s ) ) d s + j = 1 n m i j g ( y j ( t τ ) ) + j = 1 n l i j g ( y j ( t τ ) ) + j = 1 n s i j t q j t s g ( y j ( s ) ) d s + j = 1 n v i j t q j ( t s ) g ( y j ( s ) ) d s + j = 1 n C i j γ j + j = 1 n R i j γ j + A i + u i ( t ) ] d t + σ i ( t , y i ( t ) , t q i t s h ( y i ( s ) ) d s ) d B ( t ) .
At time t, the ith neuron’s state is represented by y i ( t ) , and u i ( t ) provides an appropriate controller intended to accomplish pth-moment exponential synchronization between the systems (2) and (3). The synchronization error of the ith neuron is defined as e i ( t ) = y i ( t ) x i ( t ) in order to assess the synchronization between the two systems. The system’s overall synchronization error dynamics is represented as follows:
d e i ( t ) = [ α i e i ( t ) + j = 1 n k i j F ˇ ( e j ( t ) ) + j = 1 n h i j F ˇ ( e j ( t τ ) ) + j = 1 n w i j t q j t s F ˇ ( e j ( s ) ) d s + j = 1 n m i j G ˇ ( e j ( t τ ) ) + j = 1 n l i j G ˇ ( e j ( t τ ) ) + j = 1 n s i j t q j t s G ˇ ( e j ( s ) ) d s + j = 1 n v i j t q j ( t s ) G ˇ ( e j ( s ) ) d s + u i ( t ) ] d t + σ i ( t , e i ( t ) , t q i t s h ( e i ( s ) ) d s ) d B ( t ) .
In which,
F ˇ ( e i ( · ) ) = f ( y i ( · ) ) f ( x i ( · ) ) , G ˇ ( e i ( · ) ) = g ( y i ( · ) ) g ( x i ( · ) ) ; j = 1 n l i j G ˇ ( e j ( · ) ) = j = 1 n l i j g ( y j ( · ) ) j = 1 n l i j g ( x j ( · ) ) ; j = 1 n m i j G ˇ ( e j ( · ) ) = j = 1 n m i j g ( y j ( · ) ) j = 1 n m i j g ( x j ( · ) ) ; σ i ( t , e i ( t ) , t q i ( t s ) h ( e i ( s ) ) d s ) = σ i ( t , y i ( t ) , t q i ( t s ) h ( y i ( s ) ) d s ) σ i ( t , x i ( t ) , t q i ( t s ) h ( x i ( s ) ) d s ) .
For the system (2), the specified initial condition is the vector-valued function φ ( s ) = ( φ 1 ( s ) , , φ n ( s ) ) BC F 0 ( [ α , 0 ] , R n ) , where α takes any value in the interval [ , 0 ) . Similarly, for the system (3), the initial condition ϕ ( s ) = ( ϕ 1 ( s ) , , ϕ n ( s ) ) BC F 0 ( [ α , 0 ] , R n ) . In order to guarantee that there are solutions to the systems represented by Equations (2) and (3) in their respective initial states, we always assume that functions f and g meet all requirements in this work. When examining the error system (4) contained in the equation, the initial condition is defined accordingly: the initial state vector of the error, denoted as ψ ( s ) = ( ψ 1 ( s ) , , ψ n ( s ) ) BC F 0 ( [ α , 0 ] , R n ) .
Lemma 2
([24]). If p 2 is an integral number, then there is a positive number e p ( n ) , such that
e p ( n ) ( i = 1 n | x i | 2 ) p 2 i = 1 n | x i | p   ( i = 1 n | x i | 2 ) p 2 , x = ( x 1 , , x n ) T R n .
Lemma 3
([29]). For x i 0 , ν i > 0 and i = 1 n ν i = 1 , i = 1 n x i ν i i = 1 n ν i x i , equality holds only if x i = x j , for all i , j = 1 , , n .
Lemma 4
([7]). Assuming that x 1 and x 2 are the two states of the system (2), there are | j = 1 n m i j g ( x 1 ) j = 1 n m i j g ( x 2 ) |   j = 1 n | m i j | | g ( x 1 ) g ( x 2 ) | , | j = 1 n l i j g ( x 1 ) j = 1 n l i j g ( x 2 ) |   j = 1 n | l i j | | g ( x 1 ) g ( x 2 ) | .
Assumption 1.
The functions f ( · ) , g ( · ) and h ( · ) conform to the Lipschitz condition, and there exist three positive constants L 1 , L 2 , and L 3 , fulfilling the condition that
| f ( ϑ 1 ) f ( ϑ 2 ) |   L 1 | ϑ 1 ϑ 2 | , | g ( ϑ 1 ) g ( ϑ 2 ) |   L 2 | ϑ 1 ϑ 2 | , | h ( ϑ 1 ) h ( ϑ 2 ) |   L 3 | ϑ 1 ϑ 2 | ,
for all ϑ 1 , ϑ 2 R .
Assumption 2.
The noise intensity function σ i ( t , w i , v i ) satisfies the Lipschitz condition, with two constants d i ˇ 0 and z i ˇ 0 , such that:
σ i ( t , w i , v i ) σ i T ( t , w i , v i ) d i ˇ w i 2 + z i ˇ v i 2 .
Assumption 3.
0 + q j ( w ) d w = J j , ζ = 0 + Q ( s ) e η ˜ s d s .

3. Results

A feedback controller u i ( t ) is designed in this section to synchronize the systems (2) and (3) exponentially in the pth moment. The design of the feedback controller proceeds as follows:
u i ( t ) = χ i e i ( t ) j = 1 n ϱ i j | e j ( t τ ) | sgn ( e i ( t ) ) , i f e i ( t ) 0 , 0 , i f e i ( t ) = 0 ,
where i , j Λ , the non-negative number χ i is the gain coefficient, and ϱ i j is an undetermined constant, and sgn ( · ) is the sign function.
Theorem 1.
Under Assumptions (1, 2, 3), it is demonstrated that Systems (2) and (3) synchronize exponentially in the pth moment with the proposed feedback controller if the following conditions hold:
p min i Λ α i + L 1 ( p 1 ) max i Λ j = 1 n k i j + L 1 i = 1 n max j Λ k i j + 1 2 p ( p 1 ) max i Λ d i ˇ + p 2 p max i Λ z i ˇ J i 2 L 3 2 + q ˜ ( p 1 ) max i Λ z i ˇ J i L 3 2 ζ + L 1 ( p 1 ) max i Λ j = 1 n w i j J i + L 1 q ˜ i = 1 n max j Λ w i j ζ + L 2 ( p 1 ) max i Λ j = 1 n s i j J i + L 2 q ˜ i = 1 n max j Λ s i j ζ + L 2 ( p 1 ) max i Λ j = 1 n v i j J i + L 2 q ˜ i = 1 n max j Λ v i j ζ p min i Λ χ i < 0 , L 1 p j = 1 n h i j + L 2 p j = 1 n m i j + L 2 p j = 1 n l i j p j = 1 n ϱ i j 0 .
Proof. 
Initially, a proposed Lyapunov function is constructed as V ( t , e ( t ) ) = i = 1 n e i ( t ) p , where e ( t ) = ( e 1 ( t ) , e 2 ( t ) e n ( t ) ) signifies the solution to system (4). From Lemma 2, it follows that
e p ( n ) i = 1 n e i ( t ) 2 p 2 V ( t , e ( t ) ) i = 1 n e i ( t ) 2 p 2 ,
then, we can deduce c 2 | e | p V ( t , e ) c 1 | e | p , in which, c 1 = 1 , c 2 = e p ( n ) .
Besides, we know
V t , e ( t ) e i = p e i ( t ) p 1 sgn e i ( t ) , V 2 t , e ( t ) e i 2 = p ( p 1 ) | e i ( t ) | p 2 sgn e i ( t ) .
The L V can be derived using the Itô formula,
L V = i = 1 n { p e i ( t ) p 1 sgn e i ( t ) [ α i e i ( t ) + j = 1 n k i j F ˇ e j ( t ) + j = 1 n h i j F ˇ e j ( t τ ) + j = 1 n w i j t q j ( t s ) F ˇ e j ( s ) d s + j = 1 n m i j G ˇ e j ( t τ ) + j = 1 n l i j G ˇ e j ( t τ ) + j = 1 n s i j t q j ( t s ) G ˇ e j ( s ) d s + j = 1 n v i j t q j ( t s ) G ˇ e j ( s ) d s + u i ( t ) ] } + 1 2 p ( p 1 ) i = 1 n e i ( t ) p 2 sgn e i ( t ) σ i 2 ( t , e i ( t ) , t q i ( t s ) h e i ( s ) d s ) .
In which,
i = 1 n p e i ( t ) p 1 sgn e i ( t ) α i e i ( t ) p min i Λ α i i = 1 n e i ( t ) p .
By using Lemma 3, we can obtain
i = 1 n p e i ( t ) p 1 sgn e i ( t ) j = 1 n k i j F ˇ e j ( t ) i , j = 1 n L 1 p k i j e i ( t ) p 1 | e j ( t ) | = i , j = 1 n L 1 p k i j ( | e i ( t ) | p ) p 1 p ( | e j ( t ) | p ) 1 p i , j = 1 n L 1 p k i j p 1 p e i ( t ) p + 1 p | e j ( t ) | p = ( p 1 ) i , j = 1 n L 1 k i j e i ( t ) p + i , j = 1 n L 1 k i j | e j ( t ) | p L 1 ( p 1 ) max i Λ j = 1 n k i j + i = 1 n max j Λ k i j i = 1 n | e i ( t ) | p ,
and
i = 1 n p e i ( t ) p 1 sgn ( e i ( t ) ) j = 1 n h i j F ˇ e j ( t τ ) L 1 p i , j = 1 n h i j e i ( t ) p 1 | e j ( t τ ) | .
From the Cauchy Schwartz inequality, we have
1 2 p ( p 1 ) i = 1 n | e i ( t ) | p 2 sgn e i ( t ) σ i 2 t , e i ( t ) , t q i ( t s ) h e i ( s ) d s 1 2 p ( p 1 ) i = 1 n e i ( t ) p 2 d i ˇ e i 2 ( t ) + z i ˇ t q i ( t s ) h e i ( s ) d s 2 1 2 p ( p 1 ) i = 1 n e i ( t ) p 2 { d i ˇ e i 2 ( t ) + z i ˇ t q i ( t v ) d v t q i ( t s ) h 2 e i ( s ) d s } 1 2 p ( p 1 ) i = 1 n z i ˇ e i ( t ) p 2 L 3 2 J i t q i ( t s ) e i 2 ( s ) d s + 1 2 p ( p 1 ) max i Λ d i ˇ i = 1 n e i ( t ) p 1 2 p ( p 1 ) i = 1 n z i ˇ L 3 2 J i t q i ( t s ) | e i ( t ) | p p 2 p e i ( s ) p 2 p d s + 1 2 p ( p 1 ) max i Λ d i ˇ i = 1 n e i ( t ) p 1 2 p ( p 1 ) max i Λ d i ˇ + p 2 p max i Λ z i ˇ J i 2 L 3 2 i = 1 n e i ( t ) p + L 3 2 ( p 1 ) max i Λ z i ˇ J i t Q ( t s ) i = 1 n e i ( s ) p d s .
Based on Lemma 4 and Lemma 3, it follows that
i = 1 n p e i ( t ) p 1 sgn e i ( t ) j = 1 n m i j G ˇ e j ( t τ ) i = 1 n p e i ( t ) p 1 j = 1 n m i j g ( y j ( t τ ) ) j = 1 n m i j g ( x j ( t τ ) ) L 2 p i , j = 1 n m i j e i ( t ) p 1 e j ( t τ ) ,
and
i = 1 n p e i ( t ) p 1 sgn e i ( t ) j = 1 n l i j G ˇ e j ( t τ ) i = 1 n p e i ( t ) p 1 j = 1 n l i j g ( y j ( t τ ) ) j = 1 n l i j g ( x j ( t τ ) ) L 2 p i , j = 1 n l i j e i ( t ) p 1 e j ( t τ ) ,
and
i = 1 n p e i ( t ) p 1 sgn e i ( t ) u i ( t ) = i = 1 n p e i ( t ) p 1 sgn e i ( t ) χ i e i ( t ) j = 1 n ϱ i j e j ( t τ ) sgn e i ( t ) p min i Λ χ i i = 1 n e i ( t ) p p i , j = 1 n ϱ i j e i ( t ) p 1 e j ( t τ ) .
According to Lemma 3, we can obtain
i = 1 n p e i ( t ) p 1 sgn e i ( t ) j = 1 n w i j t q j ( t s ) F ˇ e j ( s ) d s i , j = 1 n L 1 p w i j t q j ( t s ) e j ( s ) e i ( t ) p 1 d s = i , j = 1 n L 1 p w i j t q j ( t s ) e j ( s ) p 1 p e i ( t ) p p 1 p d s i , j = 1 n L 1 p w i j t q j ( t s ) 1 p e j ( s ) p + p 1 p e i ( t ) p d s L 1 ( p 1 ) i , j = 1 n w i j e i ( t ) p t q j ( t s ) d s + L 1 i , j = 1 n w i j t q j ( t s ) e j ( s ) p d s L 1 ( p 1 ) max i Λ j = 1 n w i j J j i = 1 n e i ( t ) p + L 1 i = 1 n max j Λ w i j t Q ( t s ) j = 1 n e j ( s ) p d s ,
and
i = 1 n p e i ( t ) p 1 sgn e i ( t ) j = 1 n s i j t q j ( t s ) G ˇ e j ( s ) d s i = 1 n p e i ( t ) p 1 j = 1 n L 2 s i j t q j ( t s ) e j ( s ) d s i , j = 1 n L 2 p s i j t q j ( t s ) 1 p e j ( s ) p + p 1 p e i ( t ) p d s L 2 ( p 1 ) max i Λ j = 1 n s i j J j i = 1 n e i ( t ) p + L 2 i = 1 n max j Λ s i j t Q ( t s ) j = 1 n e j ( s ) p d s ,
and
i = 1 n p e i ( t ) p 1 sgn ( e i ( t ) ) j = 1 n v i j t q j ( t s ) G ˇ e j ( s ) d s L 2 ( p 1 ) max i Λ j = 1 n v i j J j i = 1 n e i ( t ) p + L 2 i = 1 n max j Λ v i j t Q ( t s ) j = 1 n e j ( s ) p d s .
From the above inequality (8) to (17), we can derive
L V p min i Λ χ i i = 1 n e i ( t ) p p min i Λ α i i = 1 n e i ( t ) p + L 1 ( p 1 ) max i Λ j = 1 n k i j + i = 1 n max j Λ k i j i = 1 n | e i ( t ) | p + L 1 ( p 1 ) max i Λ j = 1 n w i j J j i = 1 n e i ( t ) p + L 1 i = 1 n max j Λ w i j t Q ( t s ) j = 1 n e j ( s ) p d s + L 2 ( p 1 ) max i Λ j = 1 n s i j J j i = 1 n e i ( t ) p + L 2 i = 1 n max j Λ s i j t Q ( t s ) j = 1 n e j ( s ) p d s + L 2 ( p 1 ) max i Λ j = 1 n v i j J j i = 1 n e i ( t ) p + L 2 i = 1 n max j Λ v i j t Q ( t s ) j = 1 n e j ( s ) p d s + 1 2 p ( p 1 ) max i Λ d i ˇ + p 2 p max i Λ z i ˇ J i 2 L 3 2 i = 1 n e i ( t ) p + L 3 2 ( p 1 ) max i Λ z i ˇ J i t Q ( t s ) i = 1 n e i ( s ) p d s + i = 1 n ( L 1 p j = 1 n h i j + L 2 p j = 1 n m i j + L 2 p j = 1 n l i j p j = 1 n ϱ i j ) e i ( t ) p 1 e j ( t τ ) .
Based on (6), we can then take the mathematical expectation and obtain
E L V E { p min i Λ χ i i = 1 n e i ( t ) p p min i Λ α i i = 1 n e i ( t ) p + L 1 ( p 1 ) max i Λ j = 1 n k i j + i = 1 n max j Λ k i j i = 1 n | e i ( t ) | p + L 1 ( p 1 ) max i Λ j = 1 n w i j J j i = 1 n e i ( t ) p + L 2 ( p 1 ) max i Λ j = 1 n s i j J j i = 1 n e i ( t ) p + L 2 ( p 1 ) max i Λ j = 1 n v i j J j i = 1 n e i ( t ) p + 1 2 p ( p 1 ) max i Λ d i ˇ + p 2 p max i Λ z i ˇ J i 2 L 3 2 i = 1 n e i ( t ) p } + E L 1 i = 1 n max j Λ w i j t Q ( t s ) j = 1 n e j ( s ) p d s + E L 2 i = 1 n max j Λ s i j t Q ( t s ) j = 1 n e j ( s ) p d s + E L 2 i = 1 n max j Λ v i j t Q ( t s ) j = 1 n e j ( s ) p d s + E L 3 2 ( p 1 ) max i Λ z i ˇ J i t Q ( t s ) i = 1 n e i ( s ) p d s .
Whenever e η ˜ θ E V ( t + θ , φ ( θ ) ) < q ˜ E V ( t , φ ( 0 ) ) , for all α θ 0 , we can obtain
E i = 1 n e i ( s ) p < E q ˜ e η ˜ ( t s ) i = 1 n e i ( t ) p , s t .
Substituting (19) into the terms containing infinite delays in (18), we have
E L 1 i = 1 n max j Λ w i j t Q ( t s ) j = 1 n e j ( s ) p d s L 1 q ˜ i = 1 n max j Λ w i j ζ E i = 1 n e i ( t ) p ,
and
E L 2 i = 1 n max j Λ s i j t Q ( t s ) j = 1 n e j ( s ) p d s L 2 q ˜ i = 1 n max j Λ s i j ζ E i = 1 n | e i ( t ) | p ,
and
E L 2 i = 1 n max j Λ v i j t Q ( t s ) j = 1 n e j ( s ) p d s L 2 q ˜ i = 1 n max j Λ v i j ζ E i = 1 n e i ( t ) p ,
and
    E L 3 2 ( p 1 ) max i Λ z i ˇ J i t Q ( t s ) i = 1 n e i ( s ) p d s L 3 2 q ˜ p 1 max i Λ z i ˇ J i ζ E i = 1 n e i ( t ) p .
From the above inequality, we can derive
E L V { p min i Λ α i + L 1 ( p 1 ) max i Λ j = 1 n k i j + L 1 i = 1 n max j Λ k i j + 1 2 p ( p 1 ) max i Λ d i ˇ + p 2 p max i Λ z i ˇ J i 2 L 3 2 + L 3 2 q ˜ ( p 1 ) max i Λ z i ˇ J i ζ + L 1 ( p 1 ) max i Λ j = 1 n w i j J i + L 1 q ˜ i = 1 n max j Λ w i j ζ + L 2 ( p 1 ) max i Λ j = 1 n s i j J i + L 2 q ˜ i = 1 n max j Λ s i j ζ + L 2 ( p 1 ) max i Λ j = 1 n v i j J i + L 2 q ˜ i = 1 n max j Λ v i j ζ p min i Λ χ i } E i = 1 n e i ( t ) p .
When condition (6) is satisfied, we take the positive scalars λ * to satisfy
λ * = { p min i Λ α i + L 1 ( p 1 ) max i Λ j = 1 n k i j + L 1 i = 1 n max j Λ k i j + 1 2 p ( p 1 ) max i Λ d i ˇ + p 2 p max i Λ z i ˇ J i 2 L 3 2 + L 3 2 q ˜ ( p 1 ) max i Λ z i ˇ J i ζ + L 1 ( p 1 ) max i Λ j = 1 n w i j J i + L 1 q ˜ i = 1 n max j Λ w i j ζ + L 2 ( p 1 ) max i Λ j = 1 n s i j J i + L 2 q ˜ i = 1 n max j Λ s i j ζ + L 2 ( p 1 ) max i Λ j = 1 n v i j J i + L 2 q ˜ i = 1 n max j Λ v i j ζ p min i Λ χ i } .
At this time, we obtain E L V λ * E V ( t , e ( t ) ) . According to Lemma 1, system (4) satisfies pth-moment exponential stability, indicating that system (2) and system (3) are synchronized with pth-moment exponents.

4. Numerical Simulation

To achieve pth-moment exponential synchronization, a feedback controller for FSCNNs with discrete and infinite delays is designed in the previous section. This section provides a numerical simulation to validate the effectiveness of the proposed control strategy. By choosing Λ = { 1 , 2 , , 8 } , the drive system can be described as follows:
d x i ( t ) = [ α i x i ( t ) + j = 1 8 k i j f ( x j ( t ) ) + j = 1 8 h i j f ( x j ( t τ ) ) + j = 1 8 w i j t q j t s f ( x j ( s ) ) d s + j = 1 8 m i j g ( x j ( t τ ) ) + j = 1 8 l i j g ( x j ( t τ ) ) + j = 1 8 s i j t q j t s g ( x j ( s ) ) d s + j = 1 8 v i j t q j ( t s ) g ( x j ( s ) ) d s + j = 1 8 C i j γ j + j = 1 8 R i j γ j + A i ] d t + σ i ( t , x i ( t ) , t q i t s h ( x i ( s ) ) d s ) d B ( t ) .
For all i , j Λ , α i = 1.6 , f ( · ) = g ( · ) = tanh ( · ) , L 1 = L 2 = L 3 = 1 , A i = 0 , γ j = 0.1 , C i j = R i j = 1 . Let σ i ( t , x i ( t ) , t q i t s h ( x i ( s ) ) d s ) = σ x i , then σ x 1 = 1.8 x 1 ( t ) , σ x 2 = 2.1 x 2 ( t ) , σ x 3 = 1.8 x 3 ( t ) , σ x 4 = 2.7 x 4 ( t ) , σ x 5 = 2.4 x 5 ( t ) , σ x 6 = 2.8 x 6 ( t ) , σ x 7 = 3.2 x 7 ( t ) , σ x 8 = 3.6 x 8 ( t ) . The kernel delay function q j ( s ) can be taken as q 1 ( s ) = ( 1 1 + s 2 ) e 7 s , q 2 ( s ) = ( 1 1 + s 2 ) e 7 s , q 3 ( s ) = ( 2 1 + s 2 ) e 7 s , q 4 ( s ) = ( 3 1 + s 2 ) e 7 s , q 5 ( s ) = ( 4 1 + s 2 ) e 7 s , q 6 ( s ) = ( 5 1 + s 2 ) e 7 s , q 7 ( s ) = ( 6 1 + s 2 ) e 7 s , q 8 ( s ) = ( 7 1 + s 2 ) e 7 s . Let parameters p = 3 , η ˜ = 7 , q ˜ = 1.3 , and it can be concluded that ζ = 0 + 7 1 + s 2 d s . σ i satisfies Assumption 2 when d i ˇ = 1 , z i ˇ = 0 . Across coefficients v i j , v 12 = v 23 = v 24 = v 31 = v 68 = v 75 = v 87 = 0.39 , v 37 = v 43 = v 76 = 0.26 , v 46 = v 63 = 0.13 , and the rest is equated to 0. The values of k i j , h i j , w i j , m i j , l i j , and s i j , are in Table 1, and any unmentioned values are zero.
The following is the response system:
d y i ( t ) = [ α i y i ( t ) + j = 1 8 k i j f ( y j ( t ) ) + j = 1 8 h i j f ( y j ( t τ ) ) + j = 1 8 w i j t q j t s f ( y j ( s ) ) d s + j = 1 8 m i j g ( y j ( t τ ) ) + j = 1 8 l i j g ( y j ( t τ ) ) + j = 1 8 s i j t q j t s g ( y j ( s ) ) d s + j = 1 8 v i j t q j ( t s ) g ( y j ( s ) ) d s + j = 1 8 C i j γ j + j = 1 8 R i j γ j + A i ] d t + σ i ( t , y i ( t ) , t q i t s h ( y i ( s ) ) d s ) d B ( t ) .
Let σ i ( t , y i ( t ) , t q i t s h ( y i ( s ) ) d s ) = σ y i , then σ y 1 = 1.8 y 1 ( t ) , σ y 2 = 2.1 y 2 ( t ) , σ y 3 = 1.8 y 3 ( t ) , σ y 4 = 2.7 y 4 ( t ) , σ y 5 = 2.4 y 5 ( t ) , σ y 6 = 2.8 y 6 ( t ) , σ y 7 = 3.2 y 7 ( t ) , σ y 8 = 3.6 y 8 ( t ) . Through the system (24) and (25), we can obtain the expression of the error system
d e i ( t ) = [ α i e i ( t ) + j = 1 8 k i j F ˇ ( e j ( t ) ) + j = 1 8 h i j F ˇ ( e j ( t τ ) ) + j = 1 8 w i j t q j t s F ˇ ( e j ( s ) ) d s + j = 1 8 m i j G ˇ ( e j ( t τ ) ) + j = 1 8 l i j G ˇ ( e j ( t τ ) ) + j = 1 8 s i j t q j t s G ˇ ( e j ( s ) ) d s + j = 1 8 v i j t q j ( t s ) G ˇ ( e j ( s ) ) d s + u i ( t ) ] d t + σ i ( t , e i ( t ) , t q i t s h ( e i ( s ) ) d s ) d B ( t ) .
The design of the feedback controller is as follows:
u i ( t ) = χ i e i ( t ) j = 1 8 ϱ i j | e j ( t τ ) | sgn ( e i ( t ) ) , i f e i ( t ) 0 , 0 , i f e i ( t ) = 0 ,
in which, χ i = 50 , ϱ 24 = ϱ 37 = ϱ 43 = ϱ 76 = 2.4 , ϱ 46 = ϱ 62 = 1.2 , ϱ 12 = ϱ 23 = ϱ 31 = ϱ 53 = ϱ 68 = ϱ 75 = ϱ 87 = 3.6 and other quantities not mentioned are 0.
By computing the values for the aforementioned parameters, one can verify the conditions stated in Theorem 1,
p min i Λ α i + L 1 ( p 1 ) max i Λ j = 1 8 k i j + L 1 i = 1 8 max j Λ k i j + 1 2 p ( p 1 ) max i Λ d i ˇ + p 2 p max i Λ z i ˇ J i 2 L 3 2 + q ˜ ( p 1 ) max i Λ z i ˇ J i L 3 2 ζ + L 1 ( p 1 ) max i Λ j = 1 8 w i j J i + L 1 q ˜ i = 1 8 max j Λ w i j ζ + L 2 ( p 1 ) max i Λ j = 1 8 s i j J i + L 2 q ˜ i = 1 8 max j Λ s i j ζ + L 2 ( p 1 ) max i Λ j = 1 8 v i j J i + L 2 q ˜ i = 1 8 max j Λ v i j ζ p min i Λ χ i < 0 , L 1 p j = 1 8 h i j + L 2 p j = 1 8 m i j + L 2 p j = 1 8 l i j p j = 1 8 ϱ i j 0 .
The trajectories of the drive system (24) and response system (25) are shown in Figure 1 and Figure 2, respectively. Figure 3 shows that the error system (26) in the absence of control does not tend to zero, which implies that drive system (24) and response system (25) can not achieve synchronization without control. Obviously, the drive system (24) and the response system (25) are gradually synchronized under the action of the feedback controller, because the trajectories of error system (26) with control in Figure 4 gradually drops to zero. The validity of Theorem 1 is verified.

5. Conclusions

In this paper, we investigate the synchronization problem of FSCNNs with discrete and infinite delays. By using a feedback controller, we obtain some pth-moment exponential synchronization criterion for the neural networks. Moreover, we provide a numerical simulation example to verify the effectiveness of our results. At present, the research on the synchronization of neural networks with delays is mainly focused on the network with finite delays, and there is not much research on the neural networks with infinite delays. Our paper provides some new results on infinite delay networks.
Through Theorem 1, we can limit the coefficient values of the controller so that the network achieves synchronization. However, the form of the decision conditions and the calculation of some values in Theorem 1, such as ζ , are more complicated. On the basis of this study, perhaps we can try to use adaptive controller, fuzzy controller, state feedback controller, and other means to study the synchronization control of FSCNNs with infinite delays, so as to obtain a conclusion with a lower computational complexity. At the same time, we can also try to consider the topological structure of FSCNNs on the basis of the original research, so as to better optimize the control strategy and improve the synchronization control efficiency.
There are many interesting questions that deserve to be investigated for FSCNNs with infinite delays. The neural network in this paper is affected by continuous random perturbations (white noise). In fact, discontinuous random perturbations (Levy noise) should also be considered that can be used to describe the sudden external influences. Moreover, we obtain the asymptotic synchronization of FSCNNs with infinite delays, but it is not clear whether FSCNNs can achieve synchronization at a finite or fixed time.

Author Contributions

K.X.: writing—original draft preparation, writing—review and editing. X.X.: writing—review and editing. M.L.: Writing—review and editing. All authors participated in the writing and coordination of the manuscript. All authors have read and agreed to the published version of the manuscript.

Funding

This work is supported by the Northeast Forestry University College Student Innovation and Entrepreneurship Training Program Project (No. DCLXY-2025017), the Natural Science Foundation of Heilongjiang Province (No. LH2022A002), and the National Natural Science Foundation of China (No. 12371160).

Data Availability Statement

No new data were created or analyzed in this study.

Conflicts of Interest

The authors declare no conflict of interest.

Abbreviations

PMESpth moment exponential synchronization
FSCNNsfuzzy stochastic cellular neural networks
CNNscellular neural networks
FCNNsfuzzy cellular neural networks

References

  1. Ayrulu, B.; Barshan, B. Neural networks for improved target differentiation and localization with sonar. Neural Netw. 2001, 14, 355–373. [Google Scholar] [CrossRef] [PubMed]
  2. Han, Q.; Cao, R.; Liu, J.; Huang, J.J.; Yi, J.; Liu, C.; Weng, T.F. Analysis of associative memories based on cellular neural networks with value-varying templates. Int. J. Comput. Math. 2019, 96, 2024–2038. [Google Scholar] [CrossRef]
  3. Li, C.; Xu, X.F.; Liu, M. The Stochastic fixed-time synchronization of delays neural networks driven by lévy noise. Syst. Control Lett. 2024, 190, 105839. [Google Scholar] [CrossRef]
  4. Park, J.H. Synchronization of cellular neural networks of neutral type via dynamic feedback controller. Chaos Soliton Fract. 2009, 42, 1299–1304. [Google Scholar] [CrossRef]
  5. Hou, L.L.; Ma, P.F.; Ma, X.; Sun, H.B. H exponential synchronization of switched cellular neural networks based on disturbance observer-based control. Int. J. Control Autom. Syst. 2024, 22, 1430–1441. [Google Scholar] [CrossRef]
  6. Skrzypek, L.; You, Y.C. Feedback synchronization of FHN cellular neural networks. Discret. Contin. Dyn. Syst.-Ser. B 2021, 26, 6047–6056. [Google Scholar] [CrossRef]
  7. Yang, T.; Yang, L.B.; Wu, C.W.; Chua, L.O. Fuzzy cellular neural networks: Applications. In Proceedings of the 1996 Fourth IEEE International Workshop on Cellular Neural Networks and their Applications Proceedings (CNNA-96), Seville, Spain, 24–26 June 1996; pp. 225–230. [Google Scholar]
  8. Abdurahman, A.; Jiang, H.J.; Teng, Z.D. Finite-time synchronization for fuzzy cellular neural networks with time-varying delays. Fuzzy Sets Syst. 2016, 297, 96–111. [Google Scholar] [CrossRef]
  9. Ma, W.Y.; Li, C.P.; Wu, Y.J. Synchronization of fractional fuzzy cellular neural networks with interactions. Chaos: Interdiscip. J. Nonlinear Sci. 2017, 27, 103106. [Google Scholar] [CrossRef]
  10. Yu, J.; Hu, C.; Jiang, H.J.; Teng, Z.D. Exponential lag synchronization for delayed fuzzy cellular neural networks via periodically intermittent control. Math. Comput. Simul. 2012, 82, 895–908. [Google Scholar] [CrossRef]
  11. Roska, T.; Chua, L.O. Cellular neural networks with nonlinear and delay-type template elements. In Proceedings of the IEEE International Workshop on Cellular Neural Networks and their Applications, Budapest, Hungary, 16–19 December 1990; pp. 12–25. [Google Scholar]
  12. Ding, W.; Han, M.A. Synchronization of delayed fuzzy cellular neural networks based on adaptive control. Phys. Lett. 2008, 372, 4674–4681. [Google Scholar] [CrossRef]
  13. Chen, L.; Zhao, H.Y. Stability analysis of stochastic fuzzy cellular neural networks with delays. Neurocomputing 2008, 72, 436–444. [Google Scholar] [CrossRef]
  14. Zhang, Q.H.; Lin, F.B.; Wang, G.Y.; Long, Z.Q. Existence and stability of periodic solutions for stochastic fuzzy cellular neural networks with time-varying delay on time scales. Dyn. Syst. Appl. 2018, 27, 851–871. [Google Scholar]
  15. Liu, Y.; Liu, M.; Xu, X.F. Adaptive control design for fixed-time synchronization of fuzzy stochastic cellular neural networks with discrete and distributed delay. Iran. J. Fuzzy Syst. 2021, 18, 13–28. [Google Scholar]
  16. Xu, D.S.; Liu, Y.; Liu, M. Finite-time synchronization of multi-coupling stochastic fuzzy neural networks with mixed delays via feedback control. Fuzzy Sets Syst. 2021, 411, 85–104. [Google Scholar] [CrossRef]
  17. Xu, D.S.; Wang, T.; Liu, M. Finite-time synchronization of fuzzy cellular neural networks with stochastic perturbations and mixed delays. Circuits Syst. Signal Process. 2021, 40, 3244–3265. [Google Scholar] [CrossRef]
  18. Rakkiyappan, P.; Balasubramaniam, R. Global asymptotic stability of stochastic recurrent neural networks with multiple discrete delays and unbounded distributed delays. Appl. Math. Comput. 2008, 204, 680–686. [Google Scholar]
  19. Wei, Z.; Xu, D.Y. Global exponential stability of fuzzy cellular neural networks with impulses and infinite delays. J. Math. Res. Expo. 2008, 28, 1–10. [Google Scholar]
  20. Li, W.X.; Pang, L.S.; Su, H.; Wang, K. Global stability for discrete cohen–grossberg neural networks with finite and infinite delays. Appl. Math. Lett. 2012, 25, 2246–2251. [Google Scholar] [CrossRef]
  21. Jiang, H.J.; Teng, Z.D. Boundedness, periodic solutions and global stability for cellular neural networks with variable coefficients and infinite delays. Neurocomputing 2009, 72, 2455–2463. [Google Scholar] [CrossRef]
  22. Zhang, H.; Zeng, Z.G. Synchronization of recurrent neural networks with unbounded delays and time-varying coefficients via generalized differential inequalities. Neural Netw. 2021, 143, 161–170. [Google Scholar] [CrossRef]
  23. He, P.; Li, H.; Luo, X.C.; Xing, M.L. Exponential synchronisation of linearly coupled reaction-diffusion neural networks with discrete and infinite distributed delays. Int. J. Syst. Sci. 2020, 51, 1174–1187. [Google Scholar] [CrossRef]
  24. Li, X.; Fu, X. Stability analysis of stochastic functional differential equations with infinite delay and its application to recurrent neural networks. J. Comput. Appl. Math. 2010, 234, 407–417. [Google Scholar] [CrossRef]
  25. Wang, X.B.; Wu, X.F.; Nie, Z.; Yan, Z.X. The pth moment exponential synchronization of drive-response memristor neural networks subject to stochastic perturbations. Complexity 2023, 2023, 1335184. [Google Scholar] [CrossRef]
  26. Zhu, Q.X.; Cao, D.J. pth moment exponential synchronization for stochastic delayed cohen–grossberg neural networks with markovian switching. Nonlinear Dyn. 2011, 67, 829–845. [Google Scholar] [CrossRef]
  27. Luo, J.W. Stability of stochastic partial differential equations with infinite delays. J. Comput. Appl. Math. 2008, 222, 364–371. [Google Scholar] [CrossRef]
  28. Mao, X.R. Stochastic Differential Equations and Applications; Horwood: Chichester, UK, 1997. [Google Scholar]
  29. Beckenbach, E.; Bellman, R. Inequalities; Springer: New York, NY, USA, 1961. [Google Scholar]
Figure 1. Drive system’s trajectories.
Figure 1. Drive system’s trajectories.
Axioms 14 00142 g001
Figure 2. Response system’s trajectories under controller.
Figure 2. Response system’s trajectories under controller.
Axioms 14 00142 g002
Figure 3. Error system’s trajectories without controller.
Figure 3. Error system’s trajectories without controller.
Axioms 14 00142 g003
Figure 4. Error system’s trajectories under controller action.
Figure 4. Error system’s trajectories under controller action.
Axioms 14 00142 g004
Table 1. The values of k i j , h i j , w i j , m i j , l i j and s i j .
Table 1. The values of k i j , h i j , w i j , m i j , l i j and s i j .
k i j h i j w i j m i j l i j s i j
k 13 = 0.5 h 13 = 0.6 w 13 = 0.3 m 13 = 0.18 l 12 = 0.14 s 12 = 0.12
k 64 = 0.5 h 35 = 0.6 w 21 = 0.36 m 21 = 0.18 l 37 = 0.14 s 24 = 0.12
k 67 = 0.5 h 64 = 0.6 w 32 = 0.36 m 57 = 0.18 l 43 = 0.14 s 46 = 0.12
k 21 = 0.6 h 67 = 0.6 w 76 = 0.36 m 64 = 0.18 l 75 = 0.14 s 53 = 0.12
k 25 = 0.6 h 86 = 0.6 w 24 = 0.4 m 78 = 0.18 l 23 = 0.1 s 76 = 0.12
k 42 = 0.6 h 23 = 0.4 w 36 = 0.42 m 86 = 0.18 l 31 = 0.1 s 37 = 0.14
k 32 = 0.4 h 26 = 0.5 w 43 = 0.42 m 26 = 0.15 l 62 = 0.1 s 43 = 0.14
k 86 = 0.4 h 31 = 0.5 w 62 = 0.42 m 35 = 0.15 l 24 = 0.12 s 75 = 0.14
k 36 = 0.7 h 57 = 0.5 w 74 = 0.42 m 42 = 0.15 l 46 = 0.12 s 23 = 0.08
k 57 = 0.7 h 73 = 0.5 w 46 = 0.49 m 67 = 0.15 l 76 = 0.12 s 31 = 0.08
k 74 = 0.7 h 76 = 0.7 w 54 = 0.24 m 73 = 0.15 l 53 = 0.16 s 62 = 0.1
k 78 = 0.7 w 67 = 0.25 m 32 = 0.21 l 87 = 0.16 s 87 = 0.1
w 88 = 0.35
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

Xu, K.; Liu, M.; Xu, X. pth Moment Exponential Synchronization of Fuzzy Stochastic Cellular Neural Networks with Discrete and Infinite Delays. Axioms 2025, 14, 142. https://doi.org/10.3390/axioms14020142

AMA Style

Xu K, Liu M, Xu X. pth Moment Exponential Synchronization of Fuzzy Stochastic Cellular Neural Networks with Discrete and Infinite Delays. Axioms. 2025; 14(2):142. https://doi.org/10.3390/axioms14020142

Chicago/Turabian Style

Xu, Keyu, Ming Liu, and Xiaofeng Xu. 2025. "pth Moment Exponential Synchronization of Fuzzy Stochastic Cellular Neural Networks with Discrete and Infinite Delays" Axioms 14, no. 2: 142. https://doi.org/10.3390/axioms14020142

APA Style

Xu, K., Liu, M., & Xu, X. (2025). pth Moment Exponential Synchronization of Fuzzy Stochastic Cellular Neural Networks with Discrete and Infinite Delays. Axioms, 14(2), 142. https://doi.org/10.3390/axioms14020142

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