Next Article in Journal
Navigation Route Planning for Tourism Intelligent Connected Vehicle Based on the Symmetrical Spatial Clustering and Improved Fruit Fly Optimization Algorithm
Previous Article in Journal
Overview and Modeling Capabilities of an Event-Based Signal Controller
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Robustness Analysis of Exponential Synchronization in Complex Dynamic Networks with Deviating Argumentsand Parameter Uncertainties

School of Mathematics and Statistics, Hubei Normal University, Huangshi 435002, China
*
Author to whom correspondence should be addressed.
Symmetry 2024, 16(2), 158; https://doi.org/10.3390/sym16020158
Submission received: 28 December 2023 / Revised: 10 January 2024 / Accepted: 22 January 2024 / Published: 29 January 2024

Abstract

:
In the paper, we study the robust synchronization of complex dynamic networks (CDNs) with deviating arguments and parameter uncertainties via self-feedback control, the model involves both advanced and delayed arguments. In addition, based on the Gronwall inequality and inequality techniques, we derive upper bounds on the length of the arguments and the magnitude of the parameters, when the parameters and arguments of CDNs are below the upper bounds, the CDNs continue to exhibit exponential synchronization. In comparison to linear matrix inequalities and Lyapunov’s method in the existing literature, we obtain elaborate bounds. Finally, Several simple examples can demonstrate the effectiveness of the results.

1. Introduction

Complex dynamic networks (CDNs) are neural networks with a complex structure composed of many nodes coupled with edges, and each node is a basic element of CDNs. Consequently, the entire networks exhibit different dynamic behaviors than isolated nodes. CDN models have been widely used to describe many natural and artificial systems, such as the internet networks, power grids, neural networks and biological networks [1,2,3,4,5,6,7,8].
In fact, synchronization is a common phenomenon in nature. For example, the clustering activity of bees in the forest can be considered as a synchronized behavior. In recent years, the synchronization problem of CDNs has become an emerging research field and attracted substantial attentions [9,10,11,12]. In order to achieve synchronization of CDNs, many scholars have proposed many control schemes, such as pinning control, impulsive control and event-triggered control [13,14,15,16].
The above investigations concentrate on the synchronization or stability analysis of delayed CDNs. In the fields of economics, biology, and physics, the past and future events serve as references for current decision-making. Therefore, it is significant to discuss models involving delay and advanced alternating differential equations. CDNs with deviating arguments (DAs) are considered to be the unification of delayed and advanced systems. In addition, it is also the combination of continuous and discrete system [17,18,19,20,21]. By substituting the time delays of CDNs with DAs, the system will have more sophisticated structure and widespread applications. Hence, it is significant and meaningful to investigate the robust synchronization of CDNs with DAs. In [18], the Mittag-Leffler stability of fractional-order neural networks with generalized piecewise constant arguments is investigated. The impulsive control strategy is employed to achieve synchronization of CDNs with DAs in [19]. In [20], the robust stability of fuzzy cellular neural networks with DAs is investigated by designing suitable controllers.
On the one hand, the coupling weights between CDNs depend on the resistance and capacitance values, due to the variation of charge flow in the systems, the resistance and capacitance of the systems will also evolve. On the other hand, neural networks exhibit parameter uncertainty due to modeling uncertainty, which makes it challenging to describe the system with constant parameters [22,23,24,25]. Consequently, the parameter uncertainties (PUs) of the connection weights are inevitable. Models of CDNs with arguments and uncertainties can lead to chaotic, oscillatory, and instability, and how much argument length and parameter magnitude can cause the systems to unsynchronized systems, the subject rarely discussed in previous literatures.
It is well known that if DAs and PUs exceed the certain thresholds, it will lead to system instability, oscillation or performance degradation. How much longer argument and parameter scales will maintain the exponential synchronization of the system? The main contributions of this paper include the following aspects:
  • In the paper, we study the robust synchronization of CDNs with DAs. Compared with systems with ordinary time delays, the system discussed in this paper involves both delayed and advanced coupling, and we employ an unified model to describe the finite speed of signal propagation and to predict the behavior of nodes.
  • We introduce upper bounds for the argument length and parameter size in CDNs by employing Gronwall inequalities and inequality techniques.
  • Massive complex networks are scale-free, meaning that most nodes are disconnected, but a few have many connections. In addition, the connection matrix in the model of CDNs are all symmetric, i.e., if nodes i and j are connected and disconnected, the adjacency matrix parameters are 0 and 1, respectively. This matrix is described in the model establishment in Section 2 and the simulation in Section 4.
The rest of this paper is arranged as follows. In Section 2, some preliminaries on the model of complex dynamic networks and lemmas are presented. In Section 3, we transform systems with arguments into ordinary systems. Furthermore, upper bounds on the length of the arguments and the magnitude of the parameters were derived utilising Grunwald inequality. Two numerical examples are exhibited to illustrate the effectiveness of the obtained results in Section 4. This paper is concluded and future possible works are given in Section 5.

2. Preliminaries

2.1. Notation

The following are the standard notations used in this article. Let R n is n-dimensional Euclidean space, R be the space of real numbers, the superscript T represents the transpose of vector or matrix. R + is the set of positive real number, N represents integers, | | χ ( t ) | | is the norm of vector χ ( t ) , where χ ( t ) R n and | | χ ( t ) | | = p = 1 n | χ ( t ) | , the norm | | A | | of the matrix A is given by | | A | | , where A = max 1 q n p = 1 n | a p q | .
The interactions of CDNs can be characterized by graph G = ( V , E , A ) , where V are a set of CDNs. E V × V represents a series of interaction edges, and A is a coupling matrix.
For two real-valued sequences ϱ k , ξ k , k N . ϱ k < ϱ k + 1 ,   ϱ k ξ k ϱ k + 1 for all k N with ϱ k as k .

2.2. Preliminary Preparation

Consider a complex dynamical network with mixed coupling as follow,
x ˙ p ( t ) = f x p ( t ) + c q = 1 n ( a p q + a p q ( t ) ) x q ( t ) + c q = 1 n b p q x q ( γ ( t ) ) + ϖ p , x p ( t 0 ) = w 0 ,
where p = 1 , , n is the state vector of the ith dynamical node, the nonlinear function f ( · ) C 1 ( [ t 0 , + ] , R ) is continuous activation function, ϖ p is control input, c is a coupling strength, the Laplacian matrix A ˜ = ( a i j ) , B ˜ = ( b i j ) R n × n describes the topological structure of the network with
a p p = q = 1 n a p q , b p p = q = 1 n b p q , p q .
If ( x p , x q ) E , then a p q = ± 1 , otherwise, a p q = 0 . There isn’t self-loops in G , i.e., a p p = 0 . Moreover, a p q = a q p 0 , p , q . The choice of configuration matrices for complex dynamic networks is related to the direct links between nodes, and the topology of the network may have a certain symmetry.
We always set γ ( t ) = ξ k on ( ϱ k , ϱ k + 1 ] , when t ( t k , t k + 1 ] , if ξ k > t , then the coupling is advanced, and if ξ k < t , then the coupling is delayed. In this paper, the deviation parameter γ ( t ) is discontinuous. Consequently, the right-hand side of the CDNs (1) has a discontinuity at the moment ϱ k , k N . Therefore, we make the solution function of the equation continuous and continuously differentiable in the interval ( ϱ k , ϱ k + 1 ] .
The initial conditions are as follows
x p ( t 0 ) = ϕ ,
where t 0 [ ρ , t 0 ] .
Remark 1. 
In [19], the CDNs (1) is demonstrated to have a unique solution x ( t ) on the interval [ ϱ k , ϱ k + 1 ] . Moreover, k can take any value on N . Consequently, the solution of system (1) exists on R .
The s ( t ) is an arbitrary state, which is also an isolated node of the CDN (1) such that
s ˙ ( t ) = f ( s ( t ) ) .
The linear controller is designed as
ϖ p ( t ) = ς p ( x p ( t ) s ( t ) ) , p = 1 , , n ,
where ς p is positive constant.
Combining ( 1 ) and ( 2 ) , the e p ( t ) = x p ( t ) s ( t ) represents the errors relative to the isolated node, then,
e ˙ p ( t ) = f ( e p ( t ) ) + c q = 1 n ( a p q + a p q ( t ) ) e q ( t ) + c q = 1 n b p q e q ( γ ( t ) ) + ς p e p ( t ) ,
in which f ( e p ( t ) ) = f ( x p ( t ) ) f ( s ( t ) ) , the initial values are as follows
e p ( t 0 ) = φ .
Then CDNs (4) can be rewritten in a compact matrix form
e ˙ ( t ) = F ( e ( t ) ) + c ( A + A ^ ( t ) ) e ( t ) + c B e ( γ ( t ) ) + W e ( t ) . e ( t 0 ) = e 0
e ( t ) = ( e 1 ( t ) , , e n ( t ) ) T , e ( γ ( t ) ) = ( e 1 ( t ) , , e n ( t ) ) T , F ( e ( t ) ) = ( f ( e 1 ( t ) ) , , f ( e n ( t ) ) ) T , t 0 R + , e 0 is the initial condition. A = I n A ˜ , B = I n B ˜ , W = ( ς p ) n × n is a diagonal matrix, A ^ ( t ) = ( a p q ( t ) ) R n × n .
In addition, the function f in (4) satisfies the following global Lipschitz condition and f ( 0 ) = 0 .
Assumption 1. 
Assume that there exists a nonnegative constant p, such that
| f ( v p ) f ( w p ) | l p | v p w p | ,
where the activation function f p ( p 1 , 2 , , n ) is global Lipschitz-continuous, w p , v p R .
The original system with the controller is
z ˙ ( t ) = F ( z ( t ) ) + c A z ( t ) + c B z ( t ) + W e ( t ) . z ( t 0 ) = z 0
where z ( t ) = ( z 1 ( t ) , , z n ( t ) ) T , e 0 is the initial condition of (6).
The following lemmas and assumptions will be needed through out the paper:
Definition 1 
([26]). If we have the following inequality,
| x ( t ) s ( t ) | θ | φ | exp ( ϑ ( t t 0 ) ) ,
where t > t 0 , φ is initial conditions, θ , ϑ > 0 . Then, the state of system (5) is said to be globally exponentially stable (ESt).
The symmetry of CDNs topology can influence the dynamical behaviour of the networks. For example, the symmetric networks structure may lead to the emergence of group synchronisation phenomena in which nodes in the network exhibit coordinated behaviour. We focus on ESy between nodes of complex networks in this paper.
Assumption 2. 
There exists a positive constant ξ that satisfies ϱ k + 1 ϱ k ϱ , for all k N .
Assumption 3. 
The parameter uncertainties and bounded, defined by
a p q ( t ) M p q ( 1 ) ,
where M p q ( 1 ) > 0 .
Assumption 4. 
h 2 ϱ h 1 ϱ ( 1 + h 2 ϱ ) exp { h 1 ϱ } < 1 .
Assumption 5. 
c ϱ | B | + ϱ ( c ( | A | + | A * | ) + | K ¯ ) ( 1 + c ϱ | B | ) exp { ϱ ( c ( | A | + | A * | ) + | K ¯ ) } < 1 .
Lemma 1 
([27]). Suppose ϑ ( t ) , θ ( t ) , and e ( t ) are continuous real-valued functions, and θ ( t ) is integrable over the interval I = [ t 0 , t ] , if ϑ ( t ) 0 and u ( t ) satisfies
e ( t ) θ ( t ) + t 0 t ϑ ( s ) e ( s ) d s ,
then,
e ( t ) θ ( t ) + t 0 t θ ( s ) ϑ ( s ) exp s t ϑ ( r ) d r d s ,
where t > t 0 .
In addition, if θ ( t ) is non-decreasing, then
e ( t ) θ ( t ) exp t 0 t ϑ ( s ) d s .
Lemma 2. 
Under Assumption 1, if e ( t ) is the solution of system (5), then
| e ( γ ( t ) ) | λ | e ( t ) | ,
holds on t R + , where λ = ( 1 h 2 ϱ h 1 ϱ ( 1 + h 2 ϱ ) exp { h 1 ϱ } ) 1 , h 1 = | L | + c ( | A | + | A * | ) + | W | , h 2 = c | B | , L = ( l p ) n × n is a diagonal weight, A * = sup t t 0 A ^ ( t ) .
Proof. 
For γ ( t ) = ξ k , and t ϱ k , ϱ k + 1 ,
e ( t ) = e ( ξ k ) + ξ k t F ( e ( s ) ) + c ( A + A ^ ( s ) ) e ( s ) + c B e ( ξ k ) + W e ( s ) d s .
For t [ ξ k , ϱ k + 1 ] ,
| e ( t ) | | e ( ξ k ) | + ξ k t ( | F ( e ( s ) ) | + c ( | A | + | A ^ ( s ) | ) | e ( s ) | + c | B | | e ( ξ k ) | + | W | | e ( s ) | ) d s ( 1 + h 2 ϱ ) | e ( ξ k ) | + ξ k t h 1 | e ( s ) | d s ,
where h 1 = | L | + c ( | A | + | A * | ) + | W | , h 2 = c | B | . □
According to Lemma 1,
| e ( t ) | ( 1 + h 2 ϱ ) | e ( ξ k ) | exp ( h 1 ϱ ) .
By the similar method above,
| e ( ξ k ) | | e ( t ) | + ξ k t ( | F ( e ( s ) ) | + c ( | A | + | A ^ ( s ) | ) | e ( s ) | + c | B | | e ( ξ k ) | + | W | | e ( s ) | ) d s | e ( t ) | + h 2 ϱ | e ( ξ k ) | + ξ k t h 1 | e ( s ) | d s | e ( t ) | + h 2 ϱ | e ( ξ k ) | + h 1 ϱ ( 1 + h 2 ϱ ) | e ( ξ k ) | exp ( h 1 ϱ ) .
From (9), we have
1 h 2 ϱ h 1 ϱ ( 1 + h 2 ϱ ) exp { h 1 ϱ } | x ( ξ k ) | | x ( t ) | .
From Assumption 4,
| z ( ξ k ) | λ | x ( t ) | ,
where λ = 1 / ( 1 h 2 ϱ h 1 ϱ ( 1 + h 2 ϱ ) exp { h 1 ϱ } ) , for t ( ϱ k , ϱ k + 1 ] . By the randomness of t and k, it follows that (11) holds for all t R + .
Remark 2. 
When considering CDN (1) on the interval ( ϱ k , ϱ k + 1 ] , where k N , if ϱ k t < ξ k , CDN (1) behaves as an advanced system. Conversely, if ξ k < t ϱ k + 1 , CDN (1) behaves as a retarded system. In other words, Equation (1) can alternate between advanced and retarded arguments.
Remark 3. 
By virtue of Lemma 1, we have obtained a method to transform state vector x ( γ ( t ) ) into regular state vector x ( t ) .

3. Main Results

The CDNs with parameter uncertainty are as follows:
e ˙ ( t ) = F ( e ( t ) ) + c ( A + A ^ ( t ) ) e ( t ) + W e ( t ) ,
where e ( t ) = ( e 1 ( t ) , , e n ( t ) ) T R n is the state vector of the nodes, e 0 R n is the initial condition, A, A ^ , W and F ( · ) are the same as in Section 2, The activation function f ( · ) satisfies Assumption 1 and f ( 0 ) = 0 .
The original system is
z ˙ ( t ) = F ( z ( t ) ) + c A z ( t ) + W z ( t ) ,
where z ( t ) = ( z 1 ( t ) , , z n ( t ) ) T R n is the state variable without uncertainty.
In order to explore the effect of the PUs on the synchronization of the systems. That is, how large parameter matrices will desynchronize the system. Consequently, we have the following theorem.
Theorem 1. 
The Assumptions 1 and 3 hold. If the CDNs (13) is globally exponentially stability (ESt), | A * | < min { , | M ( 1 ) | } , then CDNs (12) still remains to be globally ESt, the CDNs (1) to isolated node (2) is globally exponential synchronization (ESy), where ℶ is the unique nonnegative solution of the transcendental equation:
Υ 1 exp ( 2 Υ 2 T ) + θ exp ( ϑ T ) = 1 ,
where Υ 1 = c | A * | θ / ϑ , Υ 2 = | L | + c ( | A | + | A * | ) + | W | , M ( 1 ) = ( M p q ( 1 ) ) R n × n , T > ( ln θ ) / ϑ .
Proof. 
Assume e 0 = z 0 , e 0 and z 0 are (12) and (13) initial conditions, respectively.
| z ( t ) e ( t ) | = | t 0 t ( ( F ( z ( s ) ) F ( e ( s ) ) ) + c ( A + A ^ ( s ) ) ( z ( s ) e ( s ) ) + W ( z ( s ) e ( s ) ) ) d s | t 0 t ( | F ( z ( s ) ) F ( e ( s ) ) | + c | A | | | z ( s ) e ( s ) | + | A ^ | | z ( s ) | + | W | | z ( s ) e ( s ) | ) d s .
Then, t 0 t t 0 + 2 T ,
| z ( t ) e ( t ) | t 0 t ( | L | | z ( s ) e ( s ) | + c | A | | z ( s ) e ( s ) | + c | A ^ ( s ) | | z ( s ) e ( s ) | + c | A ^ ( t ) | z ( s ) | + | W | | z ( s ) e ( s ) | ) d s t 0 t ( ( | L | + c ( | A | + | A * | ) + | W | ) | z ( s ) e ( s ) | + c | A * | | z ( s ) | ) d s
Then, (13) is locally ESt,
| z ( t ) e ( t ) | ( | L | + c ( | A | + | A * | ) + | W | ) t 0 t | z ( s ) e ( s ) | d s + c | A * | | z 0 | θ / ϑ .
From the Lemma 1,
| z ( t ) e ( t ) | Υ 1 | z 0 | exp ( 2 T Υ 2 ) ,
where Υ 1 = c | A * | θ / ϑ , Υ 2 = | L | + c ( | A | + A * ) + | W | . □
Due to z ( t ) is ESt, on the interval [ t 0 + T , t 0 + 2 T ] ,
| e ( t ) | | z ( t ) e ( t ) | + | z ( t ) | Υ 1 | z 0 | exp ( 2 Υ 2 T ) + θ | z 0 | exp ( ϑ T ) Υ 3 sup t 0 t t 0 + T | z ( t ) | ,
where Υ 3 = Υ 1 exp ( 2 Υ 2 T ) + θ exp ( ϑ T ) . Thus,
Υ 3 = Υ 1 exp ( 2 Υ 2 T ) + θ exp ( ϑ T ) < 1 .
For | A * | < max { , | M ( 1 ) | } , T > ln ( θ ) / ϑ . Let ψ = ( ln Υ 3 ) / T > 0 ,
| z ( t ) | exp ( ψ T ) | z ( t ) | .
Then, for any positive integer m = 1 , 2 , , from the existence and uniqueness of (12), when t t 0 + ( m 1 ) T , it holds,
e ( t , t 0 , e 0 ) = e ( t , t 0 + ( m 1 ) T , e ( t 0 + ( m 1 ) T , t 0 , e 0 ) ) .
From (15) and (16),
sup t 0 + m T t t 0 + ( m + 1 ) T | e ( t , t 0 , e 0 ) | = sup t 0 + ( m 1 ) T t t 0 + m T | e ( t , t 0 + ( m 1 ) T , z ( t 0 + ( m 1 ) T , t 0 , e 0 ) ) | exp ( ψ T ) sup t 0 + ( m 1 ) T t t 0 + m T | e ( t , t 0 , e 0 ) | exp ( ψ m T ) sup t 0 t t 0 + T | e ( t , t 0 , e 0 ) | = ω exp ( ψ m T ) ,
where ω = sup t 0 t t 0 + T | e ( t , t 0 , e 0 ) | .
Furthermore, for any t t 0 + T , there is a positive integer m such that t 0 + ( m 1 ) T t t 0 + m T ,
| y ( t ; t 0 , z 0 ) | ω exp ( ψ m T ) ω exp ( ψ ( t t 0 ) + ψ T ) ω exp ( ψ T ) exp ( ψ ( t t 0 ) ) .
Clearly, (17) also holds for t 0 t t 0 + T . Therefore, (12) is ESt.
Theorem 2. 
The Assumptions 1–4 hold, the CDNs (6) is globally ESt, then CDN (1) and (2) stil remain to be globally ESy, if ϱ < ϱ ¯ , | A * | < min { , | M ( 1 ) | } , where ϱ is the unique nonnegative root of the transcendental equation:
c ( 1 + λ ) | B | + θ / ϑ exp { 2 ( | L | + | W | + c ( | A | + + λ | B | ) T ) } + θ exp { ϑ T } = 1 ,
where ℶ os the unique nonnegative root of the transcendental equation:
c ( | A * | + | B | ) θ / ϑ exp { 2 ( | L | + | W | + c ( | A | + | A * | + | B | ) ) } + θ exp { ϑ T } = 1 ,
where λ = ( 1 h 2 ϱ h 1 ϱ ( 1 + h 2 ϱ ) exp { h 1 ϱ } ) 1 , T > max { ( ln θ ) / ϑ , ϱ ¯ } .
Proof. 
Assume e 0 = z 0 ,
| z ( t ) e ( t ) | = | t 0 t ( ( F ( z ( s ) ) F ( e ( s ) ) ) + c A ( z ( s ) e ( s ) ) c A ^ e ( s ) + c B ( z ( s ) e ( γ ( s ) ) ) + W ( z ( s ) e ( s ) ) ) d s t 0 t ( ( | L | + c ( | A | + | A ^ ( s ) | ) + | W | ) | z ( s ) e ( s ) | + c ( | B | + | A ^ ( s ) ) | | z ( s ) | + c | B | | e ( γ ( s ) ) | ) d s
According to Lemma 2,
| z ( t ) e ( t ) | t 0 t ( ( | L | + c ( | A | + | A * | + | W | ) ) | z ( s ) e ( s ) | + c ( | B | + | A * | ) | z ( s ) | + c λ | B | | e ( s ) | ) d s t 0 t ( ( | L | + | W | + c ( | A | + | A * | + λ | B | ) ) | z ( s ) e ( s ) | + c ( ( 1 + λ ) | B | + | A * | ) | z ( s ) | ) d s .
Due to the system (6) is ESt, then,
| x ( t ) e ( t ) | t 0 t ( ( | L | + | W | + c ( | A | + | A * | + λ | B | ) ) | z ( s ) e ( s ) | + c ( ( 1 + λ ) | B | + | A * | ) | z 0 | θ / ϑ ) d s = Φ 1 t 0 t | z ( s ) e ( s ) | d s + Φ 2 | z 0 | ,
where Φ 1 = | L | + | W | + c ( | A | + | A * | + λ | B | ) , Φ 2 = c ( ( 1 + λ ) | B | + | A * | ) θ / ϑ . □
From Lemma 1, one has when t 0 + T ϱ t t 0 + 2 T ,
| x ( t ) e ( t ) | Φ 2 | z 0 | exp ( 2 Φ 1 T ) .
For t 0 ϱ + T t t 0 + 2 T ,
| e ( t ) | = | e ( t ) z ( t ) + z ( t ) | | z ( t ) e ( t ) | + | z ( t ) | Φ 2 | z 0 | exp { 2 Φ 1 T } + θ | z 0 | exp { ϑ T } Φ 3 sup t 0 ξ t t 0 ξ + T | x ( t ) | ,
where Φ 3 = Φ 2 exp { 2 Φ 1 T } + θ exp { ϑ T } . From (21), we obtain Φ 3 < 1 , when ϱ < ϱ ¯ , | A * | < . The result of the following proof is the same as the previous one.
Generally, the nonlinear controllers have a more complicated structure than linear controllers and have more extensive applications, in order to achieve synchronization, in the following we have designed a nonlinear controller,
ϖ p = f ( x p ( t ) ) + f ( s ( t ) ) + κ p ( x p ( t ) s ( t ) ) ,
where κ p is positive constant.
The CDNs (1) with the nonlinear controller (22) is
e ˙ p ( t ) = c q = 1 n ( a p q + a p q ( t ) ) e q ( t ) + c q = 1 n b p q e q ( γ ( t ) ) + κ p e ( t ) ,
where a p q , a p q ( t ) , b p q and f ( · ) are as the same as in Section 2, the deviating function γ ( t ) = ξ k , if t [ ϱ k , ϱ k + 1 ) , k N . The activation function f ( · ) satisfies Assumption 1 and f ( 0 ) = 0 .
Then CDNs (23) can be rewritten in a compact matrix form
e ˙ ( t ) = c ( A + A ˜ ( t ) ) e ( t ) + c B e ( γ ( t ) ) + K ¯ e ( t ) ,
where e ( t ) = ( e 1 ( t ) , , e n ( t ) ) T R n is the state vector of the nodes, e 0 R n is the initial condition, K ¯ = ( κ p ) R n × n is diagonal weight.
The original system is
z ˙ ( t ) = c A z ( t ) + c B z ( t ) + K ¯ z ( t ) ,
Lemma 3. 
If Assumptions 1, 2 and 5 establish, The following inequality be derived:
| e ( γ ( t ) ) | μ | e ( t ) | ,
where μ = ( 1 ν ) 1 , μ = c ϱ | B | + ϱ ( c ( | A | + | A * | ) + | K ¯ ) ( 1 + c ϱ | B | ) exp { ϱ ( c ( | A | + | A * | ) + | K ¯ ) } .
Proof. 
For the deviation term γ ( t ) = ξ k , ϱ k t ϱ k + 1 ,
| e ( t ) | | e ( ξ k ) | + ξ k t ( c ( | A | + | A ^ ( s ) | ) | e ( s ) | + c | B | | e ( ξ k ) | + | K ¯ | | e ( s ) | ) d s | e ( ξ k ) | + ξ k t c ( | A | + | A * | ) + | K ¯ | | e ( s ) | d s + ξ k t c | B | | e ( ξ k ) | d s ( 1 + c ϱ | B | ) | e ( ξ k ) | + ξ k t ( c ( | A | + | A * | ) + | K ¯ | ) | e ( s ) | d s .
According to Lemma 1, one has
| e ( t ) | ( 1 + c ϱ | B | ) | e ( ξ k ) | exp { ϱ ( c ( | A | + | A * | ) + | K ¯ | ) } .
Similarly, for ϱ k t ϱ k + 1 ,
| e ( ξ k ) | | e ( t ) | + ξ k t ( c ( | A | + | A ^ ( s ) | ) | e ( s ) | + c | B | | e ( ξ k ) | + | K ¯ | | e ( s ) | ) d s | e ( t ) | + c ϱ | B | | e ( ξ k ) | + ξ k t ( c ( | A | + | A * | ) + | K ¯ | ) | e ( s ) | d s | e ( t ) | + c ϱ | B | | e ( ξ k ) | + ϱ ( c ( | A | + | A * | ) + | K ¯ | ) 1 + c ϱ | B | | e ( ξ k ) | exp { ϱ ( c ( | A | + | A * | ) + | K ¯ | ) } | e ( t ) | + ν | e ( ξ k ) | ,
where ν = c ϱ | B | + ϱ ( c ( | A | + | A * | ) + | K ¯ ) ( 1 + c ϱ | B | ) exp { ϱ ( c ( | A | + | A * | ) + | K ¯ ) } . □
According to Assumption 5,
( 1 ν ) | e ( ξ k ) | | e ( t ) | .
Then, for t [ ϱ k , ξ q + 1 ] ,
| e ( ξ k ) | ( 1 ν ) 1 | e ( t ) | = μ | e ( t ) | .
By the randomicities of t and k, (27) holds for t R + .
Theorem 3. 
If Assumptions 1–3 hold, the CDN (25) is globally ESt, then the CDN (24) remains to be globally ESt, if ϱ < ϱ ¯ , | A * | < min { , | M ( 1 ) | } , where ϱ ¯ is the only nonnegative solution of the transcendental equation:
Ψ 2 θ / ϑ exp { 2 Ψ 1 T } + θ exp { ϑ T } = 1
where Ψ 1 = c ( | A | + | A * | + μ | B | ) + K ¯ , Ψ 2 = c ( 1 + μ ) | B | , T > max { ( ln θ ) / ϑ , ϱ ¯ } .
Proof. 
From (24) and (25), for t > t 0 ,
| z ( t ) e ( t ) | = | t 0 t ( c A ( z ( s ) e ( s ) ) c A ^ ( s ) e ( s ) + c B ( z ( s ) e ( γ ( s ) ) ) + K ¯ ( z ( s ) e ( s ) ) ) d s | t 0 t ( ( c | A | + c | A * | + K ¯ ) | z ( s ) e ( s ) | + c | B | | z ( s ) | + c μ | B | | e ( s ) | ) d s t 0 t ( ( c ( | A | + | A * | + μ | B | ) + K ¯ ) | z ( s ) e ( s ) | + c ( 1 + μ ) | B | | z ( s ) | ) d s = t 0 t Ψ 1 | e ( s ) e ( s ) | + Ψ 2 t 0 t | e ( s ) | ,
where Ψ 1 = c ( | A | + | A * | + μ | B | ) + K ¯ , Ψ 2 = c ( 1 + μ ) | B | . □
Applied Lemma 1, when t 0 + T ϱ t t 0 + 2 T ,
| z ( t ) e ( t ) | Ψ 1 t 0 t | e ( s ) e ( s ) | + Ψ 2 | z 0 | θ / ϑ Ψ 2 θ / ϑ | z 0 | exp { 2 Ψ 1 T } ,
Then,
| e ( t ) | | z ( t ) e ( t ) | + | e ( t ) | Ψ 2 θ / ϑ | z 0 | exp ( 2 Ψ 1 T ) + θ | z 0 | exp { ϑ T } Ψ 3 sup t 0 ϱ t t 0 + T | e ( t ) | ,
where Ψ 3 = Ψ 2 θ / ϑ exp { 2 Ψ 1 T } + θ exp { ϑ T } .
From (8), we see Ψ 3 < 1 when ϱ < ϱ ¯ and | A * | < min { , | M ( 1 ) | } .

4. Simulations

In this section, two numerical examples are given to illustrate the validity of the theoretical results.
Example 1. 
Consider the following model of CDNs
x ˙ p ( t ) = f x p ( t ) + c q = 1 3 ( a p q + a p q ( t ) ) x q ( t ) + ϖ p ( t ) .
CDNs (29) is composed of three nodes, V = 1 , 2 , 3 . x p ( t ) = ( x p 1 ( t ) , x p 2 ( t ) , x p 3 ( t ) ) T . The activation function is as follows
f ( x P ( t ) , t ) = I ^ x p ( t ) + T g ( x p ( t ) , t )
where x p ( t ) = ( x p 1 ( t ) , x p 2 ( t ) , x p 3 ( t ) ) T R 3 .
g ( x p ( t ) , t ) = ( ( | x p 1 ( t ) + 1 | | x p 1 ( t ) 1 | ) / 2 , ( | x p 2 ( t ) + 1 | | x p 2 ( t ) 1 | ) / 2 , ( | x p 13 + 1 | | x p 3 ( t ) 1 | ) / 2 ) T ,
where
T = 1.25 3.2 3.2 3.2 1.1 4.4 3.2 4.4 1 .
The dynamical equation for the isolated node is
s ˙ ( t ) = f ( s ( t ) ) .
Let x p = x p ( t ) s ( t ) , l p = 1 , I ^ = 1 Then, the error systems as follow,
e ˙ p ( t ) = f e p ( t ) + c q = 1 3 ( a p q + a p q ( t ) ) e q ( t ) + ϖ p ( t ) .
In order to achieve ESy between the system (29) and (30), the following feedback controller is designed:
ϖ p ( t ) = ς p ( x p ( t ) s ( t ) ) ,
where ς p = 1 . Coupling matrix A are defined as
A = B = 1 1 0 1 1 0 0 0 1 .
W = 1 0 0 0 1 0 0 0 1 .
The parameters a p q ( t ) = 0.1 cos ( t ) , the coupling strength c = 1 and M p q ( 1 ) = 0.1 .
Let T = 0.4 > ln ( 1 ) / 0.5 = 0.1806 , Solving the transcendental Equation (14) results in = 0.031 . When | A * | = 0.01 , the synchronization errors of CDNs (29) and (30) under the controllers are plotted in Figure 1, Figure 2 and Figure 3.
Example 2. 
Consider the following model of CDNs,
x ˙ p ( t ) = f ( x p ( t ) ) + c q = 1 3 ( a p q + a p q ( t ) ) x q ( t ) + c q = 1 3 b p q x q ( γ ( t ) ) + ϖ p ( t ) ,
where x p ( t ) = ( x p 1 ( t ) , x p 2 ( t ) , x p 3 ( t ) ) T . The dynamical equation for the isolated node is
s ˙ ( t ) = f ( s ( t ) ) .
Then, the error systems as follow,
e ˙ p ( t ) = f e p ( t ) + c q = 1 3 ( a p q + a p q ( t ) ) e q ( t ) + c q = 1 3 a p q e q ( γ ( t ) ) + ϖ p ( t ) ,
where e p ( t ) = ( e p 1 ( t ) , e p 2 ( t ) , e p 3 ( t ) ) T .
The Parameters are the same as in Example 1. Setting γ ( t ) = t k 1 + ϱ k / 2 as t t k 1 , t k , c = 0.1 , ϱ k = 0.01 . The number of iteration is set to be m = 150 . According Theorem 2, we obtain that ϱ ¯ = 0.021 , = 0.074 . Initial states of CDNs (32) are randomly chosen on interval [ 1 , 1 ] . When | A * | = 0.01 , | ϱ | = 0.01 , Assumption 4 is satisfied, the synchronization errors of CDNs (32) under the controllers are plotted in Figure 4, Figure 5 and Figure 6.

5. Conclusions

In the paper, we investigate the robustness of synchronisation of complex dynamic networks with deviating arguments and parameter uncertainties. Different from conventional linear matrix inequality and Lyapunov theory, this paper makes use of Grunwall’s inequality to derive upper bounds on the lengths of arguments and the size of the parameters. The results of this paper can be further investigated. To begin with, the theory of synchronised robustness of complex networks of integer order can be extended to fractional order. In addition, for right-hand side discontinuous systems such as memristor-based neural networks and neural networks with discontinuous activation functions, synchronisation robustness has been less discussion.

Author Contributions

Conceptualization, T.X. and X.X.; methodology, T.X. and X.X.; software, X.X.; validation, T.X. and X.X.; formal analysis, T.X.; investigation, X.X.; resources, T.X.; data curation, X.X.; writing—original draft preparation, X.X.; writing—review and editing, T.X. and X.X.; visualization, X.X.; supervision, T.X.; project administration, T.X. and X.X.; funding acquisition, T.X. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Data Availability Statement

Data are contained within the article.

Acknowledgments

The author thanks those who contributed to this article.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Zhou, J.; Xiang, L.; Liu, Z. Synchronization in complex delayed dynamical networks with impulsive effects. Physica A 2007, 384, 684–692. [Google Scholar] [CrossRef]
  2. Yu, W.; Chen, G.; Lü, J. On pinning synchronization of complex dynamical networks. Automatica 2009, 45, 429–435. [Google Scholar] [CrossRef]
  3. Ali, M.S.; Usha, M.; Orman, Z.; Arik, S. Improved result on state estimation for complex dynamical networks with time varying delays and stochastic sampling via sampled-data control. Neural Netw. 2019, 114, 28–37. [Google Scholar]
  4. Wang, L.; Sun, Y.-X. Robustness of pinning a general complex dynamical network. Phys. Lett. A 2010, 374, 1699–1703. [Google Scholar] [CrossRef]
  5. Boccaletti, S.; Latora, V.; Moreno, Y.; Chavez, M.; Hwang, D.-U. Complex networks: Structure and dynamics. Phys. Rep. 2023, 424, 175–308. [Google Scholar] [CrossRef]
  6. Gao, P.; Wang, Y.; Zhao, J.; Zhang, L.; Peng, Y. Links synchronization control for the complex dynamical network. Neurocomputing 2023, 515, 59–67. [Google Scholar] [CrossRef]
  7. Weng, T.; Chen, X.; Ren, Z.; Xu, J.; Yang, H. Multiple moving agents on complex networks: From intermittent synchronization to complete synchronization. Physica A 2023, 614, 128562. [Google Scholar] [CrossRef]
  8. Li, Y.; Zhang, J.; Lu, J.; Lou, J. Finite-time synchronization of complex networks with partial communication channels failure. Inf. Sci. 2023, 634, 539–549. [Google Scholar] [CrossRef]
  9. Li, B. Finite-time synchronization for complex dynamical networks with hybrid coupling and time-varying delay. Nonlinear Dyn. 2014, 76, 1603–1610. [Google Scholar] [CrossRef]
  10. Wang, J.; Ru, T.; Xia, J.; Wei, Y.; Wang, Z. Finite-time synchronization for complex dynamic networks with semi-markov switching topologies: An h∞ event-triggered control scheme. Appl. Math. Comput. 2019, 356, 235–251. [Google Scholar] [CrossRef]
  11. Shi, L.; Zhu, H.; Zhong, S.; Zeng, Y.; Cheng, J. Synchronization for time-varying complex networks based on control. J. Comput. Appl. Math. 2016, 301, 178–187. [Google Scholar] [CrossRef]
  12. Arbi, A.; Cao, J.; Alsaedi, A. Improved synchronization analysis of competitive neural networks with time-varying delays. Nonlinear Anal. Model. 2018, 23, 82–107. [Google Scholar] [CrossRef]
  13. Liu, X.; Yu, X.; Xi, H. Finite-time synchronization of neutral complex networks with markovian switching based on pinning controller. Neurocomputing 2015, 153, 148–158. [Google Scholar] [CrossRef]
  14. Xu, Z.; Li, X.; Duan, P. Synchronization of complex networks with time-varying delay of unknown bound via delayed impulsive control. Neural Netw. 2020, 125, 224–232. [Google Scholar] [CrossRef]
  15. Wu, Y.; Shen, B.; Ahn, C.K.; Li, W. Intermittent dynamic event-triggered control for synchronization of stochastic complex networks. IEEE Trans. Circuits Syst. I Regul. Pap. 2021, 68, 2639–2650. [Google Scholar] [CrossRef]
  16. Zhu, Q.; Cao, J. Stability analysis of markovian jump stochastic bam neural networks with impulse control and mixed time delays. IEEE Trans. Neural Netw. Learn. Syst. 2012, 23, 467–479. [Google Scholar]
  17. Akhmet, M.U.; Aruğaslan, D.; Yılmaz, E. Stability analysis of recurrent neural networks with piecewise constant argument of generalized type. Neural Netw. 2010, 23, 805–811. [Google Scholar] [CrossRef] [PubMed]
  18. Wu, A.; Liu, L.; Huang, T.; Zeng, Z. Mittag-leffler stability of fractional-order neural networks in the presence of generalized piecewise constant arguments. Neural Netw. 2017, 85, 118–127. [Google Scholar] [CrossRef] [PubMed]
  19. Shen, W.; Zeng, Z.; Wen, S. Synchronization of complex dynamical network with piecewise constant argument of generalized type. Neurocomputing 2016, 173, 671–675. [Google Scholar] [CrossRef]
  20. Fang, W.; Xie, T.; Li, B. Robustness analysis of fuzzy cellular neural network with deviating argument and stochastic disturbances. IEEE Access 2023, 11, 3717–3728. [Google Scholar]
  21. Fang, W.; Xie, T.; Li, B. Robustness analysis of bam cellular neural network with deviating arguments of generalized type. Discret. Dyn. Nat. Soc. 2023, 2023, 9570805. [Google Scholar] [CrossRef]
  22. Zhu, S.; Shen, Y. Robustness analysis for connection weight matrix of global exponential stability recurrent neural networks. Neurocomputing 2013, 101, 370–374. [Google Scholar] [CrossRef]
  23. Liu, S.; Yu, Y.; Zhang, S. Robust synchronization of memristor-based fractional-order hopfield neural networks with parameter uncertainties. Neural Comput. Appl. 2019, 31, 3533–3542. [Google Scholar] [CrossRef]
  24. Wong, W.K.; Li, H.; Leung, S. Robust synchronization of fractional-order complex dynamical networks with parametric uncertainties. Commun. Nonlinear Sci. Numer. Simul. 2012, 17, 4877–4890. [Google Scholar] [CrossRef]
  25. Arbi, A. Robust model predictive control for fractional-order descriptor systems with uncertainty. Fract. Calc. Appl. Anal. 2023, 1–17. [Google Scholar] [CrossRef]
  26. Zeng, Z.; Wang, J.; Liao, X. Global exponential stability of a general class of recurrent neural networks with time-varying delays. IEEE Trans. Circuits Syst. 2003, 50, 1353–1358. [Google Scholar] [CrossRef]
  27. Bellman, R. The stability of solutions of linear differential equations. Duke Math. J. 1943, 10, 643–647. [Google Scholar] [CrossRef]
Figure 1. The state of e 1 with | A * | = 0.01 under the controller (32).
Figure 1. The state of e 1 with | A * | = 0.01 under the controller (32).
Symmetry 16 00158 g001
Figure 2. The state of e 2 with | A * | = 0.01 under the controller (32).
Figure 2. The state of e 2 with | A * | = 0.01 under the controller (32).
Symmetry 16 00158 g002
Figure 3. The state of e 3 with | A * | = 0.01 under the controller (32).
Figure 3. The state of e 3 with | A * | = 0.01 under the controller (32).
Symmetry 16 00158 g003
Figure 4. The state of e 1 with | A * | = 0.01 and | ϱ | = 0.01 under the controller (32).
Figure 4. The state of e 1 with | A * | = 0.01 and | ϱ | = 0.01 under the controller (32).
Symmetry 16 00158 g004
Figure 5. The state of e 2 with | A * | = 0.01 and | ϱ | = 0.01 under the controller (32).
Figure 5. The state of e 2 with | A * | = 0.01 and | ϱ | = 0.01 under the controller (32).
Symmetry 16 00158 g005
Figure 6. The state of e 3 with | A * | = 0.01 and | ϱ | = 0.01 under the controller (32).
Figure 6. The state of e 3 with | A * | = 0.01 and | ϱ | = 0.01 under the controller (32).
Symmetry 16 00158 g006
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

Xie, T.; Xiong, X. Robustness Analysis of Exponential Synchronization in Complex Dynamic Networks with Deviating Argumentsand Parameter Uncertainties. Symmetry 2024, 16, 158. https://doi.org/10.3390/sym16020158

AMA Style

Xie T, Xiong X. Robustness Analysis of Exponential Synchronization in Complex Dynamic Networks with Deviating Argumentsand Parameter Uncertainties. Symmetry. 2024; 16(2):158. https://doi.org/10.3390/sym16020158

Chicago/Turabian Style

Xie, Tao, and Xing Xiong. 2024. "Robustness Analysis of Exponential Synchronization in Complex Dynamic Networks with Deviating Argumentsand Parameter Uncertainties" Symmetry 16, no. 2: 158. https://doi.org/10.3390/sym16020158

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