Next Article in Journal
A Novel Conservative Chaotic System Involved in Hyperbolic Functions and Its Application to Design an Efficient Colour Image Encryption Scheme
Previous Article in Journal
A Dynamic Behavior Analysis of a Rolling Mill’s Main Drive System with Fractional Derivative and Stochastic Disturbance
 
 
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 Time-Varying Delays and Random Disturbances

School of Mathematics and Statistics, Hubei Normal University, Huangshi 435002, China
*
Author to whom correspondence should be addressed.
Symmetry 2023, 15(8), 1510; https://doi.org/10.3390/sym15081510
Submission received: 28 June 2023 / Revised: 21 July 2023 / Accepted: 26 July 2023 / Published: 31 July 2023
(This article belongs to the Section Mathematics)

Abstract

:
This paper aims to investigate the robustness of exponential synchronization in complex dynamic networks (CDNs) with time-varying delays and random disturbances. Via the Gronwall–Bellman lemma and partial inequality methods, by calculating the transcendental equations, the delays limits and maximum disturbance size of the CDNs are estimated. This means that the perturbed system achieves exponential synchronization if the disturbance strength is within our estimation range. The theoretical results are illustrated by several simulations.

1. Introduction

Complex dynamic networks (CDNs) consist of a large number of nodes or edges; each node or edge represents a basic dynamic system with a specific content. CDNs have become an interesting research field in various fields, such as ecological networks [1], biological neural networks [2], and communication networks [3,4]. With the continuous exploration of the dynamic behavior of CDNs, the analysis of complex behavior of CDNs has been recognized as a research hotspot [5,6,7,8].
Synchronization, as one of the topics worth thinking about in CDNs, has been used in various industries, such as face recognition, information security, and so on [9,10]. The earliest research on synchronization dates back to the time of Huygens in 1655 [11]. In recent years, synchronization control of CDNs, such as global Mittag–Leffler synchronization [2], adaptive synchronization [12] and lag synchronization [13], etc., has attracted great attention as an interesting direction of control systems.
Generally speaking, because of the different characteristics of CDN nodes, it is difficult to realize synchronization. Then, the synchronous implementation of the CDNs still needs some control strategy. Therefore, many scholars have produced some effective controllers to synchronize CDNs. To the best of our knowledge, controllers are divided into linear controllers [14,15] and nonlinear controllers [16,17,18,19]. The synchronization problem of the CDN is studied using a hierarchical controller in [20]. The authors of [21,22] studied the synchronization of a CDN with delays under the adaptive control strategy.
Because of the limitation of information transmission rate between nodes, CDNs are inevitably affected by time-varying delays and random noises [19]. The existence of time-varying delays may cause delays in information transfer between CDN nodes, and may cause the CDN to lose synchronization [23]. In general, the main types of time delays are leakage delays [24], discrete delays [25], and state-dependent delays [26], etc. For the random disturbances, the disturbance process is complex, and noise interference may lead to the deviation of information transmission in CDNs. For CDNs interfered by time-varying delays and external noise, the synchronization phenomenon has attracted the attention of scholars at home and abroad in recent years [19,27,28,29].
It is noted that CDNs may lose synchronization if the time-varying delays and noise intensity exceed certain limits [30]. We know that CDNs may still have exponential synchronization (ESy) if the intensity of time-varying delays and random noise disturbance is small when ESy has been achieved in CDNs [31]. Many interesting results were obtained for CDN synchronization interfered by time-varying delays [32,33,34] and random noise in [16,19,21,23,28,35,36,37]. It should be noted that the above work pays little attention to the robustness of ESy in CDNs. Therefore, how much time-varying delay and noise intensity CDNs can withstand without losing synchronization is an interesting question.
Robustness means that the system maintains certain characteristics under the certain disturbance of external factors. It has important reference value for the analysis and design of complex systems. In [38], the robustness of exponential stability in recurrent neural networks is explored for the first time. In recent years, there have been many interesting results on the robustness of stability [39]. In addition, with the development of CDNs, the Lyapunov stability theory and the linear matrix inequality methods have been used to analyze the synchronization of CDNs extensively, but the robustness of ESy is rarely studied by estimating the upper bound of noise intensity and delays. The robustness of ESy in CDNs with piecewise constant parameters is studied for the first time in [40]. In addition, in [41], Zhang et al. investigated the robustness of ESy in CDNs with random disturbances.
Inspired by the above works, this paper discusses the robustness of ESy in CDNs with time-varying delays and noise interference. The main works are as follows.
  • Using the Gronwall–Bellman lemma and inequality methods, the upper bound of a CDN subject to both delays and random noise intensity is obtained. By calculating the transcendental equations, The allowable ESy range of a CDN with both delay and external noise is estimated.
  • In the systems discussed in this paper, the parameter configuration matrices without delay and with delay are not necessarily symmetric.
  • Compared with the [23,41], this article comprehensively considers the influence of time-varying delays and random disturbance on ESy of CDNs. This paper provides a judgment basis for the analysis and designs of CDNs.
  • In [39], the robustness of neural network stability was thoroughly studied. Unlike the aforementioned paper, we investigate the robustness of ESy in CDNs with time-varying delays and random disturbances.
The structure of this paper is as follows: Section 2 introduces the preparatory knowledge. Section 3 is the results. In Section 4, some simulations are given. In Section 5 is the summary of this paper.

2. Problem Statement and Model

2.1. Notation

In this paper, R m is sets of m-dimensional Euclidean spaces, and R m × m represents m × m -dimensional matrices composed of spaces or sets. I m is an identity matrix of m × m . θ ϑ is the Kronecker product of matrices θ and ϑ . Let ( Ω , F , F t t 0 ) be a complete probability space with filtering F t t 0 , and the filter contains all P-null sets and is right-continuous. ϱ ( t ) stands for time delays. B ( t ) is a Brownian motion. | | | | is the Euclidean norm. E stands for a mathematical expectation operator in probability measure P.
A graph G = ( V , E , A ) has three elements. V = { 1 , , m } is the node set, and the edge set E V × V . Coupling matrix is A = ( a i j ) m × m , where a i j represents the coupling weight from the i-th node to the j-th node. If the information is from the j-th node to the i-th node ( i j ), then the a i j 0 ; otherwise, a i j = 0 .

2.2. Problem Formulation

Consider the following CDN model consisting of m nodes with time delays
z ˙ i ( t ) = Θ ( z i ( t ) , t ) + k j = 1 m a i j z j ( t ) + k j = 1 m b i j z j ( t ϱ ( t ) ) + c i ( t ) , z i ( t 0 ) = z i 0 R m ,
where z i ( t ) = ( z i 1 , , z i m ) T R m is the state vector of the i-th node; Θ : R m R m is vector-valued function; k is called the coupling strength; c i ( t ) R m is the latter needed the design of the controllers. a i j , b i j represents the matrix A , B , and satisfying a i i = j = 1 , j i m a i j and b i i = j = 1 , j i m b i j ; ϱ ( t ) are delays that satisfy ϱ ( t ) : [ t 0 , + ) , ϱ ( t ) ϑ < 1 , ψ = ψ ( s ) : ϱ ˜ s 0 C ( [ ϱ ˜ , 0 ] , R m ) .
The dynamic equation of isolated nodes of CDN (1) is
χ ˙ ( t ) = Θ ( χ ( t ) , t ) ,
where χ ( t ) is any expected state.
In addition, when CDN (1) has no time delay interference, the following form is obtained:
z ^ ˙ i ( t ) = Θ ( z ^ i ( t ) , t ) + k j = 1 m a i j z ^ j ( t ) + k j = 1 m b i j z ^ j ( t ) + c i ( t ) , z ^ i ( t 0 ) = z ^ i 0 R m .
Defining system (2) and (3), the error is l i ( t ) = z ^ i ( t ) χ ( t ) , and subtracting (2) from system (3) gives the following error system:
l ˙ i ( t ) = Υ ( l i ( t ) , t ) + k j = 1 m a i j l j ( t ) + k j = 1 m b i j l j ( t ) + c i ( t ) , l i ( t 0 ) = l i 0 R m ,
where Υ ( l i ( t ) , t ) = Θ ( z ^ i ( t ) , t ) Θ ( χ ( t ) , t ) , and the function Υ ( l i ( t ) , t ) satisfies the following assumptions.
( H 1 ) The function Υ ( , t ) will satisfy the following condition:
| | Υ ( l ( t ) , t ) Υ ( q ( t ) , t ) | | Φ | | l ( t ) q ( t ) | | ,
where Φ is a known constant.
To obtain synchronization of (1) and (2), the linear controller is expressed as
c i ( t ) = S ˘ l i ( t ) , i = 1 , , m ,
where S ˘ R m × m is the feedback gain matrix.
Substitute (6) into (4):
l ˙ i ( t ) = Υ ( l i ( t ) , t ) + k j = 1 m a i j l j ( t ) + k j = 1 m b i j l j ( t ) + S ˘ l i ( t ) , l i ( t 0 ) = l i 0 R m .
Denote l ( t ) = ( l 1 ( t ) , l 2 ( t ) , , l m ( t ) ) T , l ( t ϱ ( t ) ) = ( l 1 ( t ϱ ( t ) ) , , l m ( t ϱ ( t ) ) ) T , Υ ( l ( t ) , t ) = ( Υ ( l 1 ( t ) , t ) T , , Υ ( l m ( t ) , t ) T ) T , A = ( a i j ) m × m , B = ( b i j ) m × m , A = I m A , B = I m B , S = I m S ˘ .
Then, CDN (7) can be rewritten into the following matrix form:
l ˙ ( t ) = Υ ( l ( t ) , t ) + k A l ( t ) + k B l ( t ) + S l ( t ) , l ( t 0 ) = l 0 R m × m .
Define system (1) and (2); the synchronization error is q i ( t ) = z i ( t ) χ ( t ) . Subtracting (2) from (1) gives the following error system:
q ˙ i ( t ) = Υ ( q i ( t ) , t ) + k j = 1 m a i j q i ( t ) + k j = 1 m b i j q i ( t ϱ ( t ) ) + S ˘ q i ( t ) , q i ( t 0 ) = q i 0 R m .
The matrix form of the error system (9) is
q ˙ ( t ) = Υ ( q ( t ) , t ) + k A q ( t ) + k B q ( t ϱ ( t ) ) + S q ( t ) , q ( t 0 ) = q 0 R m × m ,
For the convenience of the analysis, this paper first provides some basic definitions, and abbreviates some nouns (see Table 1).
Definition 1.
If the error system (8) achieved ESt (Table 1), then the CDN (2) and (3) said to achieve ESy. That is, for l 0 R m , L > 0 , D > 0 , such that for any t R + , satisfying
| | l ( t ) | | L | | l 0 | | exp ( D ( t t 0 ) ) .

3. Main Results

A controller is an algorithm or rule that makes the system reach the desired state under certain control rules. Next, we discuss the robustness of ESy of CDNs with time delays and noise interference under linear and nonlinear controllers, respectively.
We first discuss how much time delay CDN can withstand without losing synchronization under linear and nonlinear controllers.

3.1. Effect of Time Delays on CDN Synchronization

3.1.1. The Linear Controller

In this section, we will investigate the robustness of ESy for CDNs with time delays under linear controllers. For CDNs that have reached ESy, how much external time delay can the system withstand without losing synchronization? That is, the CDN is still synchronous if the limits of the system being disturbed by external time delays is within our estimate. From this, we can obtain the following theorem:
Theorem 1.
If Assumption H 1 is trues, and (8) is ESt, then (10) is ESt. That is, systems (1) and (2) can realize ESy under (6), if ϱ ˜ < min ( Δ / 2 , ϱ ˘ ) , where ϱ ˘ is the only nonnegative solution of the following transcendental equation.
L exp ( D ( Δ ϱ ˜ ) ) + L 4 exp ( 2 Δ L 3 ) = 1 ,
where
Δ > ln L / D , L 3 = ( Φ + k | | A | | + | | S | | + k | | B | | ) + k | | B | | Φ + k | | A | | + | | S | | + k | | B | | ( 1 ϑ ) 1 ϱ ˘ , L 4 = k | | B | | [ ϱ ˘ + ϱ ˘ ( 1 ϑ ) 1 + k | | B | | ϱ ˘ 2 ( 1 ϑ ) 1 ] + k ϱ ˘ | | B | | [ Φ + k | | A | | + | | S | | + k | | B | | ( 1 ϑ ) 1 ] L / D .
Proof. 
Denote l ( t ; t 0 , ψ ( 0 ) ) , p ( t ; t 0 , ψ ( 0 ) ) is l ( t ) , q ( t ) and l 0 = q 0 . According to the systems (8) and (10), the differential equation is transformed into an integral equation, and we have
| | l ( t ) q ( t ) | | = | | t 0 t ( Υ ( l ( s ) , s ) Υ ( q ( s ) , s ) ) + k A ( l ( s ) q ( s ) ) + k B ( l ( s ) q ( s ϱ ( s ) ) ) + S ( l ( s ) q ( s ) ) d s | | t 0 t | | ( Υ ( l ( s ) , s ) Υ ( q ( s ) , s ) ) | | + | | k A ( l ( s ) q ( s ) ) | | + | | k B ( l ( s ) q ( s ϱ ( s ) ) ) | | + | | S ( l ( s ) q ( s ) ) | | d s .
From (5),
| | l ( t ) q ( t ) | | t 0 t Φ | | l ( s ) q ( s ) | | + k | | A | | | | l ( s ) q ( s ) | | + k | | B | | | | l ( s ) q ( s ϱ ( s ) ) | | + | | S | | | | ( l ( s ) q ( s ) ) | | d s t 0 t ( Φ + k | | A | | + k | | B | | + | | S | | ) | | l ( s ) q ( s ) | | + k | | B | | | | q ( s ) q ( s ϱ ( s ) ) | | d s = ( Φ + k | | A | | + k | | B | | + | | S | | ) × t 0 t | | l ( s ) q ( s ) | | d s + k | | B | | t 0 t | | q ( s ) q ( s ϱ ( s ) ) | | d s .
Furthermore, when t t 0 + ϱ ˜ , from (5) and (9),
t 0 + ϱ ˜ t | | q ( s ) q ( s ϱ ( s ) ) | | d s t 0 + ϱ ˜ t d s s ϱ ˜ s [ ( Φ + k | | A | | + | | S | | ) | | q ( r ) | | + k | | B | | | | q ( r ϱ ( r ) ) | | ] d r .
Exchange integration order, one has
t 0 + ϱ ˜ t d s s ϱ ˜ s ( Φ + k | | A | | + | | S | | ) | | q ( r ) | | d r = t 0 t d r max ( t 0 + ϱ ˜ , r ) min ( r + ϱ ˜ , t ) ( Φ + k | | A | | + | | S | | ) | | q ( r ) | | d s ( Φ + k | | A | | + | | S | | ) ϱ ˜ t 0 t | | q ( r ) | | d r .
Similarly, one has
t 0 + ϱ ˜ t d s s ϱ ˜ s k | | B | | | | q ( r ϱ ( r ) ) | | d r = t 0 t d r max ( t 0 + ϱ ˜ , r ) min ( r + ϱ ˜ , t ) k | | B | | | | q ( r ϱ ( r ) ) | | d s k | | B | | ϱ ˜ ( 1 ϑ ) 1 ϱ ˜ sup t 0 ϱ ˜ s t 0 | | q ( s ) | | + t 0 t | | q ( u ) | | d u .
When t t 0 + ϱ ˜ , substitute (14) and (15) into (13), and one has
t 0 + ϱ ˜ t | | q ( s ) q ( s ϱ ( s ) ) | | d s k | | B | | ϱ ˜ 2 ( 1 ϑ ) 1 sup t 0 ϱ ˜ s t 0 | | q ( s ) | | + ( Φ + k | | A | | + | | S | | + k | | B | | ϱ ˜ ( 1 ϑ ) 1 ) × t 0 t | | q ( s ) | | d s .
When t t 0 + ϱ ˜ , substitute (16) into (12), and one has
| | l ( t ) q ( t ) | | ( Φ + k | | A | | + | | S | | + k | | B | | ) t 0 t | | l ( s ) q ( s ) | | d s + k | | B | | ϱ ˜ + ϱ ˜ ( 1 ϑ ) 1 sup t 0 ϱ ˜ s t 0 + ϱ ˜ | | q ( s ) | | + k 2 | | B | | 2 ϱ ˜ 2 ( 1 ϑ ) 1 sup t 0 ϱ ˜ s t 0 | | q ( s ) | | + k | | B | | Φ + k | | A | | + | | S | | + k | | B | | ( 1 ϑ ) 1 ϱ ˜ t 0 t | | q ( s ) | | d s .
By Definition 1, further available is
| | l ( t ) q ( t ) | | { ( Φ + k | | A | | + | | S | | + k | | B | | ) + k | | B | | Φ + k | | A | | + | | S | | + k | | B | | ( 1 ϑ ) 1 ϱ ˜ } t 0 t | | l ( s ) q ( s ) | | d s + k | | B | | ϱ ˜ + ϱ ˜ ( 1 ϑ ) 1 + k | | B | | ϱ ˜ 2 ( 1 ϑ ) 1 × sup t 0 ϱ ˜ s t 0 + ϱ ˜ | | q ( s ) | | + k ϱ ˜ | | B | | Φ + k | | A | | + | | S | | + k | | B | | ( 1 ϑ ) 1 L / D | | l 0 | | L 1 t 0 t | | l ( s ) q ( s ) | | d s + L 2 sup t 0 ϱ ˜ s t 0 + ϱ ˜ | | q ( s ) | | ,
where
L 1 = ( Φ + k | | A | | + | | S | | + k | | B | | ) + k | | B | | Φ + k | | A | | + | | S | | + k | | B | | ( 1 ϑ ) 1 ϱ ˜ , L 2 = k | | B | | [ ϱ ˜ + ϱ ˜ ( 1 ϑ ) 1 + k | | B | | ϱ ˜ 2 ( 1 ϑ ) 1 ] + k ϱ ˜ | | B | | [ Φ + k | | A | | + | | S | | + k | | B | | ( 1 ϑ ) 1 ] L / D .
Using the Gronwall–Bellman lemma [42], when t t 0 + 2 Δ ,
| | l ( t ) q ( t ) | | L 2 exp ( 2 Δ L 1 ) sup t 0 ϱ ˜ s t 0 + ϱ ˜ | | q ( s ) | | .
Hence, when t 0 + ϱ ˜ t t 0 + 2 Δ ,
| | q ( t ) | | | | l ( t ) | | + | | l ( t ) q ( t ) | | | | l ( t ) | | + L 2 exp ( 2 Δ L 1 ) sup t 0 ϱ ˜ s t 0 + ϱ ˜ | | q ( s ) | | .
Notice ϱ ˜ < min ( Δ / 2 , ϱ ˘ ) , due to t 0 ϱ ˜ + Δ t t 0 ϱ ˜ + 2 Δ ,
| | q ( t ) | | L exp ( D ( Δ ϱ ˜ ) ) + L 2 exp ( 2 Δ L 1 ) sup t 0 ϱ ˜ s t 0 + ϱ ˜ | | q ( s ) | | = C ^ sup t 0 ϱ ˜ s t 0 + ϱ ˜ | | q ( s ) | | ,
where C ^ = L exp ( D ( Δ ϱ ˜ ) ) + L 2 exp ( 2 Δ L 1 ) .
From (10), when ϱ ˜ < min ( Δ / 2 , ϱ ˘ ) , C ^ < 1 .
Choose
Ξ = ln C ^ / Δ .
From (21), one has
sup t 0 ϱ ˜ t t 0 ϱ ˜ + Δ | | q ( t ; t 0 , ψ ) | | exp ( Ξ Δ ) sup t 0 ϱ ˜ t t 0 ϱ ˜ + Δ | | q ( t ; t 0 , ψ ) | | .
Then, for any nonnegative integer d = 1 , 2 , , when t t 0 + ( d 1 ) Δ , one has
q ( t ; t 0 , ψ ) = q ( t ; t 0 + ( d 1 ) Δ , q ( t 0 + ( d 1 ) Δ ; t 0 , ψ ) ) .
From (22) and (23),
sup t 0 + d Δ t t 0 + ( d + 1 ) Δ | q ( t ; t 0 , ψ ) | = sup t 0 + ( d 1 ) Δ + Δ t t 0 + ( d 1 ) Δ + 2 Δ | q t ; t 0 + ( d 1 ) Δ , q ( t 0 + ( d 1 ) Δ ; t 0 , ψ ) | exp ( Ξ Δ ) sup t 0 + ( d 1 ) Δ t t 0 + 2 d Δ | q ( t ; t 0 , ψ ) | exp ( Ξ d Δ ) sup t 0 t t 0 + Δ | q ( t ; t 0 , ψ ) | = ˜ c exp ( Ξ d Δ ) ,
where c = sup t 0 t t 0 + Δ | q ( t ; t 0 , ψ ) | . So, for t > t 0 + Δ , there is a nonnegative integer d, such than t 0 + d Δ t t 0 + ( d + 1 ) Δ , and we have
| p ( t ; t 0 , q 0 ) | c exp ( Ξ t + Ξ t 0 + 2 Ξ Δ ) = ( c exp ( 2 Ξ Δ ) ) exp ( Ξ ( t t 0 ) ) .
The condition is also trues when t 0 t t 0 + Δ . So, the error system (10) achieves ESt. Thus, systems (1) and (2) achieve ESy under linear controller (6). □
Remark 1.
Theorem 1 shows that the error system (10) still achieves ESt when the magnitude of delays is within the range of our derivation. Thus, systems (1) and (2) are ESy under linear controller (6).

3.1.2. The Nonlinear Controller

In the previous section, we discussed for how much time delay the CDN is still ESy under linear controllers. Now, we discuss the robustness of ESy in CDNs with time delays under nonlinear controllers.
To obtain synchronization of (1) and (2), the nonlinear controllers are expressed as
c i ( t ) = Θ ( l i ( t ) , t ) + Θ ( χ ( t ) , t ) + O ˘ l i ( t ) , i = 1 , , m ,
Combining (4) and (25), one has
l ˙ i ( t ) = k j = 1 m a i j l j ( t ) + k j = 1 m b i j l j ( t ) + O ˘ l i ( t ) , l i ( t 0 ) = l i 0 R m ,
The matrix form is
l ˙ ( t ) = k A l ( t ) + k B l ( t ) + O l ( t ) , l ( t 0 ) = l 0 R m × m ,
where O = I m O ˘ .
The system (27) disturbed by the time delays will take the following form:
q ˙ ( t ) = k A q ( t ) + k B q ( t ϱ ( t ) ) + O q ( t ) , q ( t 0 ) = q 0 R m × m ,
where q ( t ) = ( q 1 ( t ) , , q m ( t ) ) T , q ( t ϱ ( t ) ) = ( q 1 ( t ϱ ( t ) ) , , q m ( t ϱ ( t ) ) ) T , O = I m O ˘ .
The following theorem describes how much time delay CDN can withstand under a nonlinear controller that is ESy.
Theorem 2.
If Assumption H 1 is trues, and (27) is ESt, then (26) is ESt. That is, systems (1) and (2) can realize ESy under (25), if ϱ ˜ < min ( Δ / 2 , ϱ ˘ ) , where ϱ ˘ is the only nonnegative solution of the following transcendental equation.
L exp ( D ( Δ ϱ ˜ ) ) + T 4 exp ( 2 Δ T 3 ) = 1 ,
where
Δ > ln L / D > 0 , T 3 = ( k | | A | | + | | O | | + k | | B | | ) + k | | B | | k | | A | | + | | O | | + k | | B | | ( 1 ϑ ) 1 ϱ ˘ , T 4 = k | | B | | [ ϱ ˘ + ϱ ˘ ( 1 ϑ ) 1 + k | | B | | ϱ ˘ 2 ( 1 ϑ ) 1 ] + k ϱ ˘ | | B | | [ k | | A | | + | | O | | + k | | B | | ( 1 ϑ ) 1 ] L / D .
Proof. 
Similar to Theorem 1, from (8) and (10), we have
| | l ( t ) q ( t ) | | t 0 t k | | A | | | | l ( s ) q ( s ) | | + k | | B | | | | l ( s ) q ( s ϱ ( s ) ) | | + | | O | | | | l ( s ) q ( s ) | | d s = t 0 t ( k | | A | | + | | O | | ) | | l ( s ) q ( s ) | | + k | | B | | | | l ( s ) q ( s ϱ ( s ) ) | | d s ( k | | A | | + k | | B | | + | | O | | ) t 0 t | | l ( s ) q ( s ) | | d s + k | | B | | t 0 t | | q ( s ) q ( s ϱ ( s ) ) | | d s .
In addition, when t t 0 + ϱ ˜ , from (28) and (5),
t 0 + ϱ ˜ t | | q ( s ) q ( s ϱ ( s ) ) | | d s t 0 + ϱ ˜ t d s s ϱ ˜ s ( k | | A | | + | | O | | ) | | q ( r ) | | + k | | B | | | | q ( r ϱ ( r ) ) | | d r .
Similarly to (15),
t 0 + ϱ ˜ t d s s ϱ ˜ s ( k | | A | | + | | O | | ) | | q ( r ) | | d r = t 0 t d r max ( t 0 + ϱ ˜ , s ) min ( s + ϱ ˜ , t ) ( k | | A | | + | | O | | ) | | q ( r ) | | d s ( k | | A | | + | | O | | ) ϱ ˜ t 0 t | | q ( r ) | | d r .
Similarly to (16),
t 0 + ϱ ˜ t d s s ϱ ˜ s k | | B | | | | p ( r ϱ ( r ) ) | | d r = t 0 t d r max ( t 0 + ϱ ˜ , s ) min ( s + ϱ ˜ , t ) k | | B | | | | q ( r ϱ ( r ) ) | | d s k | | B | | ϱ ˜ ( 1 ϑ ) 1 ϱ ˜ sup t 0 ϱ ˜ s t 0 | | q ( s ) | | + t 0 t | | q ( u ) | | d u .
When t t 0 + ϱ ˜ , substitute (32) and (33) into (31):
t 0 + ϱ ˜ t | | q ( s ) q ( s ϱ ( s ) ) | | d s k | | B | | ϱ ˜ 2 ( 1 ϑ ) 1 sup t 0 ϱ ˜ s t 0 | | q ( s ) | | + ( k | | A | | + | | O | | + k | | B | | ϱ ˜ ( 1 ϑ ) 1 ) t 0 t | | q ( s ) | | d s .
For t t 0 + ϱ ˜ , substitute (34) into (30):
| | l ( s ) q ( s ) | | ( k | | A | | + | | O | | + k | | B | | ) t 0 t | | l ( s ) q ( s ) | | d s + k | | B | | ϱ ˜ + ϱ ˜ ( 1 ϑ ) 1 sup t 0 ϱ ˜ s t 0 + ϱ ˜ | | q ( s ) | | + k 2 | | B | | 2 ϱ ˜ 2 ( 1 ϑ ) 1 sup t 0 ϱ ˜ s t 0 | | q ( s ) | | + k | | B | | k | | A | | + | | O | | + k | | B | | ( 1 ϑ ) 1 ϱ ˜ t 0 t | | q ( s ) | | d s .
By Definition 1, one has
| | l ( s ) q ( s ) | | k | | A | | + | | O | | + k | | B | | + k | | B | | [ k | | A | | + | | O | | + k | | B | | ( 1 ϑ ) 1 ] ϱ ˜ t 0 t | | l ( s ) q ( s ) | | d s + k | | B | | ϱ ˜ + ϱ ˜ ( 1 ϑ ) 1 sup t 0 ϱ ˜ s t 0 + ϱ ˜ | | q ( s ) | | + k 2 | | B | | 2 ϱ ˜ 2 ( 1 ϑ ) 1 sup t 0 ϱ ˜ s t 0 | | q ( s ) | | + k | | B | | k | | A | | + | | O | | + k | | B | | ( 1 ϑ ) 1 ϱ ˜ t 0 t | | l ( s ) | | d s T 1 t 0 t | | l ( s ) q ( s ) | | d s + T 2 sup t 0 ϱ ˜ s t 0 + ϱ ˜ | | q ( s ) | | ,
where
T 1 = ( k | | A | | + | | O | | + k | | B | | ) + k | | B | | k | | A | | + | | O | | + k | | B | | ( 1 ϑ ) 1 ϱ ˜ , T 2 = k | | B | | [ ϱ ˜ + ϱ ˜ ( 1 ϑ ) 1 + k | | B | | ϱ ˜ 2 ( 1 ϑ ) 1 ] + k ϱ ˜ | | B | | [ k | | A | | + | | O | | + k | | B | | ( 1 ϑ ) 1 ] L / D .
For t t 0 + 2 Δ , using the Gronwall–Bellman lemma [42],
| | l ( t ) q ( t ) | | T 2 exp ( 2 Δ T 1 ) sup t 0 ϱ ˜ s t 0 + ϱ ˜ | | q ( s ) | | .
Due to ϱ ˜ < min ( Δ / 2 , ϱ ˘ ) , and t 0 ϱ ˜ + Δ t t 0 ϱ ˜ + 2 Δ ,
| | q ( t ) | | L exp ( D ( Δ ϱ ˜ ) ) + T 2 exp ( 2 Δ T 1 ) sup t 0 ϱ ˜ s t 0 + ϱ ˜ | | q ( s ) | | = H ^ sup t 0 ϱ ˜ s t 0 + ϱ ˜ | | q ( s ) | | ,
where H ^ = L exp ( D ( Δ ϱ ˜ ) ) + T 2 exp ( 2 Δ T 1 ) . From (29), when ϱ ˜ < min ( Δ / 2 , ϱ ˘ ) , H ^ < 1 .
Select
C = ln H ^ / Δ .
From (37), one has
sup t 0 ϱ ˜ + Δ t t 0 ϱ ˜ + 2 Δ | | q ( t ; t 0 , ψ ) | | exp ( C Δ ) sup t 0 ϱ ˜ t t 0 ϱ ˜ + Δ | | q ( t ; t 0 , ψ ) | | .
The following proof is similar to Theorem 1. □
Remark 2.
Theorem 2 shows that CDNs achieve ESy under nonlinear controllers. When the time delays does not exceed the deduced range, the CDNs (1) and (2) are still exponentially synchronized.
Remark 3.
Theorems 1 and 2 show that CDNs achieve ESy under the controllers. When the time delays of external interference is within the range we deduced, that is, ϱ ˜ < min ( Δ / 2 , ϱ ˘ ) , CDNs still remain ESy.

3.2. Effect of Time Delays and Random Disturbances on CDN Synchronization

Consider the following CDN model consisting of m nodes with time delays and random disturbances:
d z i ( t ) = Θ ( z i ( t ) , t ) + k j = 1 m a i j z j ( t ) + c i ( t ) + k j = 1 m b i j z j ( t ϱ ( t ) ) d t + δ j = 1 m v i j z j ( t ) d B ( t ) , z i ( t 0 ) = z i 0 R m ,
where δ is the random interference intensity, and v i j represents the coupling matrix V , satisfying v i i = j = 1 , j i m v i j .
When CDN (39) is not interfered by time delays and external noise, system (39) will become the following form:
z ^ ˙ i ( t ) = Θ ( z ^ i ( t ) , t ) + k j = 1 m a i j z ^ j ( t ) + k j = 1 m b i j z ^ j ( t ) + c i ( t ) , z ^ i ( t 0 ) = z ^ i 0 R m .
Similarly, (2) is defined as the isolated node equation of CDN (39) and (40).
Similar to system (4), we have
l ˙ i ( t ) = Υ ( l i ( t ) , t ) + k j = 1 m a i j l j ( t ) + k j = 1 m b i j l j ( t ) + c i ( t ) , l i ( t 0 ) = l i 0 R m ,
where Υ ( l i ( t ) , t ) is defined in (4).
Substituting the linear controller (6) into (41), we have
l ˙ i ( t ) = Υ ( l i ( t ) , t ) + k j = 1 m a i j l j ( t ) + k j = 1 m b i j l j ( t ) + S ˘ l i ( t ) , l i ( t 0 ) = l i 0 R m .
The matrix form of system (42) is
l ˙ ( t ) = Υ ( l ( t ) , t ) + k A l ( t ) + k B l ( t ) + S l ( t ) , l ( t 0 ) = l 0 R m × m .
Similar to system (9), we have
d q ( t ) = Υ ( q ( t ) , t ) + k A q ( t ) + k B q ( t ϱ ( t ) ) + S q ( t ) d t + δ V q ( t ) d B ( t ) , q ( t 0 ) = q 0 R m × m ,
where V = I m V , V = ( v i j ) m × m .
For the error system (39), we have the following definitions.
Definition 2
([42,43]). CDN (44) is called to be ASESt, if t 0 R + , q 0 R m , the Lyapunov exponent
lim sup t 1 t ( ln | | q i ( t ; t 0 , q 0 ) | | ) < 0 , i = 1 , 2 , , m ,
then, the CDN (39) with (2) is called to be ASESy. That is, if M > 0 , and the > 0 , ς > 0 , such that
| | q i ( t ) | | exp ( ς ( t t 0 ) ) , i = 1 , 2 , , m ,
where > 0 is constant.
Definition 3
([29,42]). CDN (44) is called to be MSESt, if t 0 R + , q 0 R m , the Lyapunov exponent
lim sup t ( ln 1 t ( E | | q i ( t ; t 0 , q 0 ) | | 2 ) ) < 0 , i = 1 , 2 , , m ,
then, the CDN (39) with (2) is called to be MSESy, That is, if G > 0 , and the > 0 , ς > 0 , such that
E | | l i ( t ) | | 2 1 exp ( ς ( t t 0 ) ) , i = 1 , 2 , , m ,
where 1 > 0 is constant.
From Definitions 2 and 3, MSESt can be derived from ASESt, but vice versa is not trues. However, if (5) is assumed to hold, the MSESt of (44) implies the ASESt of the CDN (44) [42].

3.2.1. The Linear Controller

In this section, we will analyze the effects of time delays and random disturbance on ESy of CDNs under linear controllers. For CDNs that have reached ESy, how much external delay and random noise interference can the system withstand without losing synchronization? In other words, if the disturbance of the system by external delays and random noise is within the range of our estimation, the CDNs are still ESy.
Theorem 3.
If assumption H 1 is trues, and (43) is ESt, then (44) is ESt. That is, systems (39) and (2) can realize ESy under (6), if | δ | δ ˜ , ϱ ˜ < min ( Δ / 2 , ϱ ˘ ) , where δ ˜ is the only nonnegative solution of the following transcendental equation.
2 L 2 exp ( 2 D Δ ) + 4 L 2 δ ˜ 2 | | V | | 2 / D exp { 8 Δ [ 4 Δ ( | | Φ | | 2 + k 2 | | A | | 2 + k 2 | | B | | 2 + | | S | | 2 ) + δ ˜ | | V | | 2 ] } = 1 ,
and ϱ ˘ is the only nonnegative solution of the following transcendental equation.
2 N 2 exp ( Δ N 1 ) + 2 L 2 exp ( 2 D ( Δ ϱ ˜ ) ) = 1 ,
where
Δ > ln ( 2 L 2 ) / ( 2 D ) , N 1 = 16 Δ ( | | Φ | | 2 + k 2 | | A | | 2 + 2 k 2 | | B | | 2 + | | S | | 2 ) + 2 δ ˜ 2 | | V | | 2 + 64 Δ k 2 | | B | | 2 ( 8 ϱ ˜ 2 [ | | Φ | | 2 + k 2 | | A | | 2 + | | S | | 2 + k 2 | | B | | 2 ( 1 ϑ ) 1 ] + 2 ϱ ˜ δ ˜ 2 | | V | | 2 ) , N 2 = 64 Δ k 2 | | B | | 2 ϱ ˜ + ϱ ˜ ( 1 ϑ ) 1 + 2 Δ k 2 | | B | | 2 [ 8 ϱ ˜ 3 k 2 | | B | | 2 ( 1 ϑ ) 1 + ( 8 ϱ ˜ 2 [ | | Φ | | 2 + k 2 | | A | | 2 + | | S | | 2 + k 2 | | B | | 2 ( 1 ϑ ) 1 ] + 2 ϱ ˜ δ ˜ 2 | | V | | 2 ) | | V | | 2 L 2 / D ] + 2 δ ˜ 2 L 2 / D .
Proof. 
Similar to Theorem 1, from (43) and (44), we have
l ( t ) q ( t ) = t 0 t [ ( Υ ( l ( s ) , s ) Υ ( q ( s ) , s ) ) + k A ( l ( s ) q ( s ) ) + k B ( l ( s ) q ( s ϱ ( s ) ) ) + S ( l ( s ) q ( s ) ) ] d s t 0 t δ V q ( s ) d B ( s ) .
For t t 0 + Δ , based on the H o ¨ l d e r inequality, combine (5) and the ESt of (43):
E | | l ( t ) q ( t ) | | 2 2 E | | t 0 t ( Υ ( l ( s ) , s ) Υ ( q ( s ) , s ) ) + k A ( l ( s ) q ( s ) ) + k B ( l ( s ) q ( s ϱ ( s ) ) ) + S ( l ( s ) q ( s ) ) d s | | 2 + 2 E | | t 0 t δ V q ( s ) d B ( s ) | | 2 16 Δ ( | | Φ | | 2 + k 2 | | A | | 2 + 2 k 2 | | B | | 2 + | | S | | 2 ) + 4 δ 2 | | V | | 2 × t 0 t E | | l ( s ) q ( s ) | | 2 d s + 2 Δ k 2 | | B | | 2 t 0 t E | | q ( s ) q ( s ϱ ( s ) ) | | 2 d s + 4 δ 2 | | V | | 2 t 0 t E | | l ( s ) | | 2 d s .
In addition, when t t 0 + ϱ ˜ , from (44) and (5), one has
t 0 + ϱ ˜ t E | | q ( s ) q ( s ϱ ( s ) ) | | 2 d s t 0 + ϱ ˜ t d s s ϱ ˜ s { [ 8 ϱ ˜ ( | | Φ | | 2 + k 2 | | A | | 2 + | | S | | 2 ) + 2 δ 2 | | V | | 2 ] E | | q ( r ) | | 2 + 8 ϱ ˜ k 2 | | B | | 2 E | | q ( r ϱ ( r ) ) | | 2 } d r .
Like (14) and (15), combined with (49),
t 0 + ϱ ˜ t E | | q ( s ) q ( s ϱ ( s ) ) | | 2 d s 8 ϱ ˜ 3 k 2 | | B | | 2 ( 1 ϑ ) 1 sup t 0 ϱ ˜ s t 0 E | | q ( s ) | | 2 + { 8 ϱ ˜ 2 [ | | Φ | | 2 + k 2 | | A | | 2 + | | S | | 2 + k 2 | | B | | 2 ( 1 ϑ ) 1 ] + 2 ϱ ˜ δ 2 | | V | | 2 } × t 0 t E | | q ( s ) | | 2 d s .
Substituting (50) into (48),
E | | l ( t ) q ( t ) | | 2 16 Δ ( | | Φ | | 2 + k 2 | | A | | 2 + 2 k 2 | | B | | 2 + | | S | | 2 ) + 4 δ 2 | | V | | 2 × t 0 t E | | l ( s ) q ( s ) | | 2 d s + 64 Δ k 2 | | B | | 2 ϱ ˜ + ϱ ˜ ( 1 ϑ ) 1 sup t 0 ϱ ˜ s t 0 + ϱ ˜ E | | q ( s ) | | 2 + 2 Δ k 2 | | B | | 2 { 8 ϱ ˜ 3 k 2 | | B | | 2 ( 1 ϑ ) 1 sup t 0 ϱ ˜ s t 0 E | | q ( s ) | | 2 + ( 8 ϱ ˜ 2 [ | | Φ | | 2 + k 2 | | A | | 2 + | | S | | 2 + k 2 | | B | | 2 ( 1 ϑ ) 1 ] + 2 ϱ ˜ δ 2 | | V | | 2 ) × t 0 t E | | l ( s ) q ( s ) + l ( s ) | | 2 d s } + 2 δ 2 | | V | | 2 L 2 / D sup t 0 ϱ ˜ s t 0 E | | q ( s ) | | 2 .
Further obtained by (51),
E | | l ( t ) q ( t ) | | 2 N 3 t 0 t E | | l ( s ) q ( s ) | | 2 d s + N 4 sup t 0 ϱ ˜ s t 0 + ϱ ˜ E | | q ( s ) | | 2 ,
where
N 3 = 16 Δ ( | | Φ | | 2 + k 2 | | A | | 2 + 2 k 2 | | B | | 2 + | | S | | 2 ) + 4 δ 2 | | V | | 2 + 64 Δ k 2 | | B | | 2 8 ϱ ˜ 2 | | Φ | | 2 + k 2 | | A | | 2 + | | S | | 2 + k 2 | | B | | 2 ( 1 ϑ ) 1 + 2 ϱ ˜ δ 2 | | V | | 2 , N 4 = 64 Δ k 2 | | B | | 2 ϱ ˜ + ϱ ˜ ( 1 ϑ ) 1 + 2 Δ k 2 | | B | | 2 × [ 8 ϱ ˜ 3 k 2 | | B | | 2 ( 1 ϑ ) 1 + ( 8 ϱ ˜ 2 | | Φ | | 2 + k 2 | | A | | 2 + | | S | | 2 + k 2 | | B | | 2 ( 1 ϑ ) 1 + 2 ϱ ˜ δ 2 | | V | | 2 ) L 2 / D ] + 2 δ 2 | | V | | 2 L 2 / D .
For t + ϱ ˜ t 0 + Δ , using the Gronwall–Bellman lemma [42],
E | | l ( t ) q ( t ) | | 2 N 4 exp ( Δ N 3 ) sup t 0 ϱ ˜ s t 0 + ϱ ˜ E | | q ( s ) | | 2 .
Hence,
E | | q ( t ) | | 2 2 E | | l ( t ) q ( t ) | | 2 + 2 E | | l ( t ) | | 2 2 N 4 exp ( Δ N 3 ) + 2 L 2 exp ( 2 D ( t t 0 ) ) sup t 0 ϱ ˜ s t 0 + ϱ ˜ E | | q ( s ) | | 2 .
When t 0 ϱ ˜ + Δ t t 0 ϱ ˜ + Δ ,
E | | q ( t ) | | 2 2 N 4 exp ( 2 Δ N 3 ) + 2 L 2 exp ( 2 D ( Δ ϱ ˜ ) ) sup t 0 ϱ ˜ s t 0 ϱ ˜ + Δ E | | q ( s ) | | 2 = : ( δ , ϱ ˜ ) sup t 0 ϱ ˜ s t 0 ϱ ˜ + Δ E | | q ( s ) | | 2 ,
where ( δ , ϱ ˜ ) = 2 N 4 exp ( Δ N 3 ) + 2 L 2 exp ( 2 D ( Δ ϱ ˜ ) ) .
Due to ( 0 , 0 ) < 1 , ( , 0 ) > 1 and ( δ , 0 ) is strictly monotonically increasing with respect to δ , there is a only solution δ ˜ such that ( δ ˜ , 0 ) = 1 , that is (45) is trues. When | δ | < δ ˜ , ( δ , ) > 1 , ( δ , 0 ) < 1 , and ( δ , ϱ ˜ ) is strictly monotonically increasing with respect to ϱ ˜ , there is a only ϱ ˘ , such that ( δ ˜ , ϱ ˘ ) = 1 , that is, (46) is trues. From (45) and (46), for | δ | < δ ˜ and ϱ ˜ < min ( Δ / 2 , ϱ ˘ ) , then ( δ , ϱ ˜ ) < 1 .
Choose
ð = ln ( δ , ϱ ˜ ) / Δ ,
From (55), we have
sup t 0 ϱ ˜ + Δ t t 0 ϱ ˜ + Δ E | q ( t ; t 0 , ψ ) | 2 exp ( ð Δ ) sup t 0 ϱ ˜ t t 0 ϱ ˜ + Δ E | q ( t ; t 0 , ψ ) | 2 .
The rest of the proof is exactly like Theorem 1. □
Remark 4.
According to Theorem 3, the CDN can realize ESy under (6). When the delays and random disturbances intensity are satisfied, | δ | < δ ˜ and ϱ ˜ < min ( Δ / 2 , ϱ ˘ ) , that is, the CDN is still ESy within the range of time delays and noise intensity.

3.2.2. The Nonlinear Controller

In the previous section, we discussed the effect of time delays and random disturbances on the ESy of CDNs under linear controllers. In this section, we will explore the influence of nonlinear controllers on the ESy of CDNs.
To obtain synchronization of systems (39) and (2), (25) is still the nonlinear controller.
Substitute (25) into (41):
l ˙ i ( t ) = k j = 1 m a i j l j ( t ) + k j = 1 m b i j l j ( t ) + O ˘ l i ( t ) , l i ( t 0 ) = l i 0 R m .
Written in matrix form is as follows:
l ˙ ( t ) = k A l ( t ) + k B l ( t ) + O l ( t ) , l ( t 0 ) = l 0 R m × m .
Similarly, subtract (2) from (39) and write in matrix form
d q ( t ) = [ k A q ( t ) + k B q ( t ϱ ( t ) ) + O q ( t ) ] d t + δ V q ( t ) d B ( t ) , q ( t 0 ) = q 0 R m × m ,
the definition of ESy of the (58) is similar to Definition 1.
The following theorem describes how much time delay and random disturbance a CDN can withstand under a nonlinear controller that is ESy.
Theorem 4.
If Assumption H 1 is trues, and (58) is ESt, then (59) is ESt. That is, systems (39) and (2) can realize ESy under (25), if | δ | δ ˜ , ϱ ˜ < min ( Δ / 2 , ϱ ˘ ) , where δ ˜ is the only solution to the following transcendental equation.
2 L 2 exp ( 2 D Δ ) + 4 L 2 δ ˜ 2 | | B | | 2 / D exp { 2 Δ [ 6 Δ ( k 2 | | A | | 2 + 2 k 2 | | B | | 2 + | | O | | 2 ) + 2 δ ˜ | | B | | 2 ] } = 1 ,
and ϱ ˘ is the only solution to the following transcendental equation.
2 N 6 exp ( 2 Δ N 5 ) + 2 L 2 exp ( 2 D ( Δ ϱ ˜ ) ) = 1 ,
where
Δ > ln ( 2 L 2 ) / ( 2 D ) , N 5 = 12 Δ ( k 2 | | A | | 2 + 2 k 2 | | B | | 2 + | | O | | 2 ) + 2 δ ˜ 2 | | V | | 2 + 48 Δ k 2 | | B | | 2 6 ϱ ˜ 2 k 2 | | A | | 2 + | | S | | 2 + k 2 | | B | | 2 ( 1 ϑ ) 1 + 2 ϱ ˜ δ ˜ 2 | | V | | 2 , N 6 = 48 Δ k 2 | | B | | 2 ϱ ˜ + ϱ ˜ ( 1 ϑ ) 1 + 24 Δ k 2 | | B | | 2 [ 4 ϱ ˜ 3 k 2 | | B | | 2 ( 1 ϑ ) 1 + ( 4 ϱ ˜ 2 k 2 | | A | | 2 + | | O | | 2 + k 2 | | B | | 2 ( 1 ϑ ) 1 + 2 ϱ ˜ δ ˜ 2 | | V | | 2 ) | | V | | 2 L 2 / D ] + 2 δ ˜ 2 | | V | | 2 L 2 / D .
Proof. 
Similar to Theorem 1, from (58) and (59), one has
l ( t ) q ( t ) = t 0 t k A ( l ( s ) q ( s ) ) + k B ( l ( s ) q ( s ϱ ( s ) ) ) + O ( l ( s ) q ( s ) ) d s t 0 t δ V q ( s ) d B ( s ) .
For t t 0 + 2 Δ , using the H o ¨ l d e r inequality, define the ESt of system (58):
E | | l ( t ) q ( t ) | | 2 12 Δ ( k 2 | | A | | 2 + 2 k 2 | | B | | 2 + | | O | | 2 ) + 4 δ 2 | | V | | 2 t 0 t E | | l ( s ) q ( s ) | | d s + 24 Δ k 2 | | B | | 2 t 0 t E | | q ( s ) q ( s ϱ ( s ) ) | | 2 d s + 4 δ 2 | | V | | 2 t 0 t E | | l ( s ) | | 2 d s .
Furthermore, when t t 0 + ϱ ˜ , from (59),
t 0 + ϱ ˜ t E | | q ( s ) q ( s ϱ ( s ) ) | | 2 d s t 0 + ϱ ˜ t d s s ϱ ˜ s { [ 4 ϱ ˜ k 2 | | A | | 2 + | | O | | 2 + 2 δ 2 | | V | | 2 ] E | | q ( r ) | | 2 + 4 ϱ ˜ k 2 | | B | | 2 E | | q ( r ϱ ( r ) ) | | 2 } d r .
Similarly to (14) and (15),
E | | l ( t ) q ( t ) | | 2 N 7 t 0 t E | | l ( s ) q ( s ) | | 2 d s + N 8 sup t 0 ϱ ˜ s t 0 + ϱ ˜ E | | q ( s ) | | 2 ,
where
N 7 = 12 Δ ( k 2 | | A | | 2 + 2 k 2 | | B | | 2 + | | O | | 2 ) + 4 δ 2 | | V | | 2 + 48 Δ k 2 | | B | | 2 ( 4 ϱ ˜ 2 [ k 2 | | A | | 2 + | | O | | 2 + k 2 | | B | | 2 ( 1 ϑ ) 1 ] + 2 ϱ ˜ δ 2 | | V | | 2 ) , N 8 = 48 Δ k 2 | | B | | 2 ϱ ˜ + ϱ ˜ ( 1 ϑ ) 1 + 24 Δ k 2 | | B | | 2 [ 4 ϱ ˜ 3 k 2 | | B | | 2 ( 1 ϑ ) 1 + ( 4 ϱ ˜ 2 k 2 | | A | | 2 + | | O | | 2 + k 2 | | B | | 2 ( 1 ϑ ) 1 + 2 ϱ ˜ δ 2 | | V | | 2 ) | | V | | 2 L 2 / D ] + 2 δ 2 | | V | | 2 L 2 / D .
For t + ϱ ˜ t 0 + 2 Δ , using the Gronwall–Bellman lemma [42],
E | | l ( t ) q ( t ) | | 2 N 8 exp ( 2 Δ N 7 ) sup t 0 ϱ ˜ s t 0 + ϱ ˜ E | | q ( s ) | | 2 .
Like (54), (55), and when t 0 ϱ ˜ + Δ t t 0 ϱ ˜ + 2 Δ ,
E | | q ( t ) | | 2 2 N 8 exp ( 2 Δ N 7 ) + 2 L 2 exp ( 2 D ( Δ ϱ ˜ ) ) sup t 0 ϱ ˜ s t 0 ϱ ˜ + Δ E | | q ( s ) | | 2 = : 0 ( δ , ϱ ˜ ) sup t 0 ϱ ˜ s t 0 ϱ ˜ + Δ E | | q ( s ) | | 2 ,
where 0 ( δ , ϱ ˜ ) = 2 N 8 exp ( 2 Δ N 7 ) + 2 L 2 exp ( 2 D ( Δ ϱ ˜ ) ) .
Similar to Theorem 3, 0 ( δ , ϱ ˜ ) is strictly monotonically increasing in terms of δ and ϱ ˜ . Therefore, there exist only solutions δ ˜ and ϱ ˘ , such that 0 ( δ ˜ , 0 ) = 1 , 0 ( δ ˜ , ϱ ˘ ) = 1 , that is, (60) and (61) hold. For | δ | < δ ˜ and ϱ ˜ < min ( Δ / 2 , ϱ ˘ ) , then 0 ( δ , ϱ ˜ ) < 1 .
Select
= ln 0 ( δ , ϱ ˜ ) / Δ ,
from (67),
sup t 0 ϱ ˜ + Δ t t 0 ϱ ˜ + 2 Δ E | q ( t ; t 0 , ψ ) | 2 exp ( Δ ) sup t 0 ϱ ˜ t t 0 ϱ ˜ + Δ E | q ( t ; t 0 , ψ ) | 2 .
The rest of the proof is exactly like Theorem 1. □
Remark 5.
From Theorem 4, when the external delays and random interference intensity are satisfied, | δ | < δ ˜ and ϱ ˜ < min ( Δ / 2 , ϱ ˘ ) , that is, the CDN is still ESy within the range of external delays and random interference intensity.
Remark 6.
Theorems 3 and 4 show that CDNs achieve ESy under the controllers. As long as the external delays and the random interference are within the range of our derivation, the CDNs can still achieve ESy.

4. Numerical

In this section, some examples are given to illustrate the correctness of the results in this paper.
Remark 7.
In Table 2, we represent random disturbances as RD, deviating argument as DAr, time-varying delays as TvD and asymptotic synchronization as AsSy, respectively.
Example 1.
Consider CDN consisting of three nodes with time delays in the linear controller
z ^ ˙ i ( t ) = Θ ( z ^ i ( t ) , t ) + k j = 1 3 a i j z ^ j ( t ) + k j = 1 3 b i j z ^ j ( t ϱ ( t ) ) + c i ( t ) , z ^ i ( t 0 ) = z ^ i 0 R 3 × 3 , c i ( t ) = S ˘ l i ( t ) , χ ˙ ( t ) = Θ ( χ ( t ) , t ) ,
without delay interference, system (69) becomes
z ^ ˙ i ( t ) = Θ ( z ^ i ( t ) , t ) + k j = 1 3 a i j z ^ j ( t ) + k j = 1 3 b i j z ^ j ( t ) + c i ( t ) , z ^ i ( t 0 ) = z ^ i 0 R 3 × 3 , c i ( t ) = S ˘ l i ( t ) , χ ˙ ( t ) = Θ ( χ ( t ) , t ) ,
where i 1 , 2 , 3 , define the error as l i ( t ) = z ^ i ( t ) χ ( t ) , and l i ( t ) = ( l i 1 ( t ) , l i 2 ( t ) , l i 3 ( t ) ) T R 3 × 3 is the i state vector of the CDN. ϱ ( t ) is time delays and satisfies ϱ ( t ) : [ t 0 , + ) , ϱ ( t ) ϑ < 1 , ψ = ψ ( s ) : ϱ ˙ s 0 C ( [ ϱ ˜ , 0 ] , R m ) . The matrix forms of system (69) and (70) are, respectively,
l ˙ ( t ) = Υ ( l ( t ) , t ) + k A l ( t ) + k B h ( t ϱ ( t ) ) + S l ( t ) , l ( t 0 ) = l 0 R 3 × 3 ,
and
l ˙ ( t ) = Υ ( l ( t ) , t ) + k A l ( t ) + k B l ( t ) + S l ( t ) , l ( t 0 ) = l 0 R 3 × 3 .
Suppose the coupling matrix is
A = 0.4 0.1 1 0.1 0.4 1 0.1 0.16 0.064 , B = 0.08 0.01 0.6 0.01 0.08 0.1 0.01 0.06 0.3 ,
S = 0.006 0 0 0 0.006 0 0 0 1 .
The coupling coefficient is k = 1.5 . The activation function is Υ ( · ) = sin ( · ) and satisfies that | | Υ ( h ) Υ ( p ) | | | | l p | | holds, so that means Φ = 1 . The initial value of the three-nodes and isolated node is l 1 = ( 1 , 1 , 0 ) T , l 2 = ( 1 , 1 , 0 ) T , l 3 = ( 1 , 1 , 1 ) T and χ ( t ) = ( 0.3 , 0.3 , 0 ) T . When L = 2 , D = 2.2 , the error system (71) is ESt.
Choose Δ = 0.4 , ϑ = 0 , through calculation L 3 = 0.6658 , L 4 = 0.0236 . Hence, from (10), we can obtain ϱ ˘ = 0.0604 , and solve the following transcendental equation by MATLAB:
2 exp ( 2.2 × ( 0.4 ϱ ˘ ) ) + 0.0236 exp ( 2 × 0.4 × 0.6658 ) = 1 .
Thus, by Theorem 1, when ϱ ˜ < min ( Δ / 2 , ϱ ˘ ) , the system (71) is ESt. In Figure 1, we take ϱ ˘ = 0.0280 < 0.0604 ; the state in Figure 1 is ESt, That is, systems (1) and (2) are ESy. In addition, Figure 2 shows the state of the system without delay interference under a linear controller.
In Figure 3, we select ϱ ˘ = 0.0350 < 0.0604 ; the state in Figure 3 is not ESt, that is, systems (1) and (2) are not ESy.
Example 2.
A CDN consisting of three nodes with time delays under the nonlinear controller is considered:
z ^ ˙ i ( t ) = Θ ( z ^ i ( t ) , t ) + k j = 1 3 a i j z ^ j ( t ) + k j = 1 3 b i j z ^ j ( t ϱ ( t ) ) + c i ( t ) , z ^ i ( t 0 ) = z ^ i 0 R 3 × 3 , c i ( t ) = Θ ( l i ( t ) , t ) + Θ ( χ ( t ) , t ) + O ˘ l i ( t ) , χ ˙ ( t ) = Θ ( χ ( t ) , t ) .
Without delay interference, system (74) becomes
z ^ ˙ i ( t ) = Θ ( z ^ i ( t ) , t ) + k j = 1 3 a i j z ^ j ( t ) + k j = 1 3 b i j z ^ j ( t ) + c i ( t ) , z ^ i ( t 0 ) = z ^ i 0 R 3 × 3 , c i ( t ) = Θ ( l i ( t ) , t ) + Θ ( χ ( t ) , t ) + O ˘ l i ( t ) , χ ˙ ( t ) = Θ ( χ ( t ) , t ) ,
where i 1 , 2 , 3 , let the synchronization error be
l i ( t ) = z ^ i ( t ) χ ( t ) ,
and l i ( t ) = ( l i 1 ( t ) , l i 2 ( t ) , l i 3 ( t ) ) T R 3 × 3 is the i state vector of the CDN. ϱ ( t ) is the time delays and satisfies ϱ ( t ) : [ t 0 , + ) , ϱ ( t ) ϑ < 1 , ψ = ψ ( s ) : ϱ ˙ s 0 C ( [ ϱ ˜ , 0 ] , R m ) .
The error system is obtained from system (74) and system (75) and expressed in matrix form as
l ˙ ( t ) = k A l ( t ) + k B h ( t ϱ ( t ) ) + O l ( t ) , l ( t 0 ) = l 0 R 3 × 3 ,
and
l ˙ ( t ) = k A l ( t ) + k B l ( t ) + O l ( t ) , l ( t 0 ) = l 0 R 3 × 3 .
Suppose the coupling coefficient is k = 1.5 . The coupling matrix is
A = 0.750 0.001 0 0.001 0.750 0.1 0 0.8 0.01 , B = 0.8 0.02 0 0.02 0.8 0.1 0 0 0.8 ,
O = 1.105 0 0 0 1.105 0 0 0 1.105 .
The activation function is Υ ( · ) = sin ( · ) . The initial value of the three nodes and isolated node is l 1 = ( 1 , 0 , 1 ) T , l 2 = ( 1 , 1 , 0 ) T , l 3 = ( 1 , 1 , 1 ) T and χ ( t ) = ( 0.1 , 0.1 , 0.1 ) T . When L = 1.4 , D = 1.2 , the system (77) is ESt.
Choose Δ = 0.3 , ϑ = 0 . By calculation T 3 = 0.3559 , T 4 = 0.1147 . Hence, from (29), we have ϱ ˘ = 0.2804 , and solve the following transcendental equation by MATLAB:
1.4 exp ( 1.2 × ( 0.3 ϱ ˘ ) ) + 0.1147 exp ( 3 × 0.3 × 0.3559 ) = 1 .
According to Theorem 2, when ϱ ˜ < min ( Δ / 2 , ϱ ˘ ) , the system (77) is ESt. In Figure 4, we take ϱ ˘ = 0.2250 < 0.2804 ; the state in Figure 4 is ESt, which means that systems (1) and (2) are ESy. In addition, Figure 5 shows the state of the system (77) without delay interference under a nonlinear controller.
In Figure 6, we select ϱ ˘ = 0.0350 < 0.0604 ; the state in Figure 6 is not ESt, which means that systems (1) and (2) are not ESy.
Example 3.
Consider CDN model consisting of three nodes with time delays and random disturbances under the linear controller
d z i ( t ) = Θ ( z i ( t ) , t ) + k j = 1 3 a i j z j ( t ) + k j = 1 3 b i j z j ( t ϱ ( t ) ) + c i ( t ) d t + δ j = 1 3 v i j z j ( t ) d B ( t ) , z i ( t 0 ) = z i 0 R 3 × 3 , c i ( t ) = S ˘ l i ( t ) , χ ˙ ( t ) = Θ ( χ ( t ) , t ) ,
where i 1 , 2 , 3 , let the synchronization error be
l i ( t ) = z ^ i ( t ) χ ( t ) ,
and l i ( t ) = ( l i 1 ( t ) , l i 2 ( t ) , l i 3 ( t ) ) T R 3 × 3 be the i-th state vector of the CDN. ϱ ( t ) is time delay, and satisfies ϱ ( t ) : [ t 0 , + ) , ϱ ( t ) ϑ < 1 , ψ = ψ ( s ) : ϱ ˙ s 0 C ( [ ϱ ˜ , 0 ] , R m ) .
Without delay and random disturbance, system (79) becomes
z ^ ˙ i ( t ) = Θ ( z ^ i ( t ) , t ) + k j = 1 3 a i j z ^ j ( t ) + k j = 1 3 b i j z ^ j ( t ) + c i ( t ) d t z ^ i ( t 0 ) = z i 0 R 3 × 3 , c i ( t ) = S ˘ l i ( t ) , χ ˙ ( t ) = Θ ( χ ( t ) , t ) .
The matrix forms of systems (79) and (80) are, respectively,
d q ( t ) = [ Υ ( q ( t ) , t ) + k A q ( t ) + k B q ( t ϱ ( t ) ) + S q ( t ) ] d t + δ V q ( t ) d B ( t ) , q ( t 0 ) = q 0 R 3 × 3 ,
and
l ˙ ( t ) = Υ ( l ( t ) , t ) + k A l ( t ) + k B l ( t ) + S l ( t ) , l ( t 0 ) = l 0 R 3 × 3 .
Suppose the coupling matrix
A = 1 0.01 0.01 0.05 0.5 1 0.1 0.1 1 , B = 0.2 0.1 0.1 0.2 0.1 0.2 ,
S = 1 0 0 0 1 0 0 0 1 , V = 1 0 0 0 1 0 0 0 1 .
The coupling coefficient is k = 1.2 . The activation function is Υ ( · ) = sin ( · ) . Select Φ = 1 , that is, | | Υ ( h ) Υ ( p ) | | | | l p | | . The initial value of the three nodes and isolated node is l 1 = ( 2 , 2 , 2 ) T , l 2 = ( 1.6 , 0 , 1.6 ) T , l 3 = ( 1.6 , 1.6 , 0 ) T and χ ( t ) = ( 0.1 , 0.1 , 0.1 ) T . For L = 0.8 , D = 0.5 , system (82) is ESt.
Let Δ = 0.3 , ϑ = 0 . From Theorem 3, we obtain the following two equations:
1.28 exp ( 0.3 ) + 0.0512 exp ( 10.073088 + 0.024 δ ˜ ) = 1 ,
and
2 N 2 exp ( 0.6 N 1 ) + 1.28 exp ( ( 0.3 ϱ ˘ ) ) = 1 .
Combine Theorem 3 in N 1 , N 2 . We have δ ˜ = 0.0024 , ϱ ˘ = 0.0403 . From Theorem 3, if the time delays and random disturbance are less than the above-derived bound, which is | δ | δ ˜ , ϱ ˜ < min ( Δ / 2 , ϱ ˘ ) , then CDN (39) disturbed by noise is MSESt. Thus, CDN (39) and (2) are MSESy.
In Figure 7, said CDNs under linear controller (39) and (2) have been implemented as ESy. Meanwhile, Figure 7 shows CDN (39) and (2) under the linear controller ϱ ˘ = 0.0303 , δ ˜ = 0.002 . Because both the time delays and the strength of random disturbances are smaller than the bound derived from Theorem 3, error system (81) is stable. Therefore, CDNs (39) and (2) are MSESy and ASESy. In addition, Figure 8 shows the state of the system (81) without delay and random perturbations under a nonlinear controller.
In Figure 9 describes the state of time delays and excessive noise intensity, i.e., ϱ ˘ = 0.403 , δ ˜ = 0.024 . It is easy to obtain that the limits of the time delays and noise intensity are greater than the theoretical results derived from Theorem 3. Therefore, error system (82) is unstable, that is, error system (81) is unstable, so CDNs (39) and (2) are not ESy.
Example 4.
Consider a CDN with three nodes with time delays and random disturbances under the nonlinear controller
d z i ( t ) = Θ ( z i ( t ) , t ) + k j = 1 3 a i j z j ( t ) + k j = 1 3 b i j z j ( t ϱ ( t ) ) + c i ( t ) d t + δ j = 1 m v i j z j ( t ) d B ( t ) , z i ( t 0 ) = z i 0 R 3 × 3 , c i ( t ) = Θ ( l i ( t ) , t ) + Θ ( χ ( t ) , t ) + O ˘ l i ( t ) , χ ˙ ( t ) = Θ ( χ ( t ) , t ) ,
where i 1 , 2 , 3 , the synchronization error is
l i ( t ) = z ^ i ( t ) χ ( t ) ,
and l i ( t ) = ( l i 1 ( t ) , l i 2 ( t ) , l i 3 ( t ) ) T R 3 × 3 is the i-th state vector of the CDN. ϱ ( t ) is a time delay that satisfies ϱ ( t ) : [ t 0 , + ) , ϱ ( t ) ϑ < 1 , ψ = ψ ( s ) : ϱ ˙ s 0 C ( [ ϱ ˜ , 0 ] , R m ) .
Without time delays and random disturbances, system (85) becomes
z ^ ˙ i ( t ) = Θ ( z ^ i ( t ) , t ) + k j = 1 3 a i j z ^ j ( t ) + k j = 1 3 b i j z ^ j ( t ) + c i ( t ) d t z ^ i ( t 0 ) = z i 0 R 3 × 3 , c i ( t ) = Θ ( l i ( t ) , t ) + Θ ( χ ( t ) , t ) + O ˘ l i ( t ) , χ ˙ ( t ) = Θ ( χ ( t ) , t ) .
The matrix forms of systems (85) and (86) are, respectively,
d q ( t ) = k A q ( t ) + k B q ( t ϱ ( t ) ) + O q ( t ) d t + δ V q ( t ) d B ( t ) , q ( t 0 ) = q 0 R 3 × 3 ,
and
l ˙ ( t ) = k A l ( t ) + k B l ( t ) + O l ( t ) , l ( t 0 ) = l 0 R 3 × 3 .
Suppose the coupling matrix
A = 0.2 0.01 0 0.01 0.2 0 0.2 0.1 0.01 , B = 0.12 0.1 0 0.12 0.1 0 0 0 0.2 ,
O = 1 0 0 0 1 0 0 0 1 , V = 1 0 0 0 1 0 0 0 1 .
The coupling coefficient is k = 1.1 . The activation function is Υ ( · ) = sin ( · ) , the initial value of the three nodes and isolated node is l 1 = ( 2 , 2 , 2 ) T , l 2 = ( 1 , 1 , 1 ) T , l 3 = ( 2 , 2 , 2 ) T and χ ( t ) = ( 0.2 , 0.2 , 0.2 ) T . When L = 1.1 , D = 1 , system (88) is ESt.
Select Δ = 0.5 , ϑ = 0 . From Theorem 4, we can obtain the following two equations.
2.42 exp ( 1 ) + 0.069696 δ ˜ 2 exp ( 5.3246 + 0.0432 δ ˜ ) = 1 ,
and
2 N 6 exp ( 1.5 N 5 ) + 2.42 exp ( 2 ( 0.5 ϱ ˘ ) ) = 1 .
According to Theorem 4, N 5 , N 6 , we can obtain δ ˜ = 0.0876 , ϱ ˘ = 0.0351 . According to Theorem 4, if the time delays and random disturbances are less than the bounds derived above, that is, | δ | δ ˜ , ϱ ˜ < min ( Δ / 2 , ϱ ˘ ) , then the CDN (39) disturbed by noise is MSESt. Thus, CDNs (39) and (2) are MSESy.
In Figure 10 shows the state of CDN (39) and (2) under nonlinear controller ϱ ˘ = 0.0303 , δ ˜ = 0.002 . In addition, Figure 11 shows the state of the system (88) without delay and random perturbations under a nonlinear controller. Because both the time delays and the strength of random disturbances are smaller than the bound derived from Theorem 3. Hence, error system (88) is stable and error system (87) is stable, Therefore, CDNs (39) and (2) are MSESy and ASESy under the nonlinear controller.
Figure 12 shows the status of ϱ ˘ = 0.5 , δ ˜ = 0.094 . Obviously, the time delays and noise intensity are greater than the bounds derived from Theorem 4. Therefore, error system (88) is unstable, that is, error system (87) is unstable, so CDN (38) and (2) are not ESy.
Remark 8.
The proof and calculation process involved in this paper is complex. For the proof process, the Gronwall–Bellman lemma and some inequality techniques are used to analyze the results of this paper. The calculation process was performed by MATLAB calculation of the involved matrices and numerical simulations.

5. Conclusions

This paper explores the robustness of ESy with time delays and random disturbances in the CDNs that the have realized the ESy under the controllers. However, the information of the CDN is inevitably disturbed by external time delay and the noise in the process of transmission between nodes. Hence, to what extent CDN can withstand external time delays and noise interference without losing synchronization has become the research hotspot of this paper. By applying the Gronwall–Bellman lemma and some inequality methods, the maximum intensities of CDNS with external time delays and noise interference are estimated by calculating transcendental equations, and sufficient conditions to ensure the ESy of CDNs with time delays and random disturbances are obtained. It is shown that (9), (28), (44) and (59) are ESt when the time delay limits and the size of random disturbances are less than the upper bound we derive, and therefore, systems (1), (39) and (2) are ESy. The results of this paper provide theoretical support for the analysis and design of CDN. In the future, we try to use less conservative inequality techniques to expand the upper limit of the delays and random disturbance strength. In view of the methods and techniques utilized in this article, we will further study the inequality techniques, which are less conservative, to analyze the upper bounds of delays and random interference in the next stage, so that the obtained results are less conservative, so that the synchronization of CDN is easier, or consider other systems, for example, generalized synchronization of delayed CDNs.

Author Contributions

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

Funding

This work was supported by the National Natural Science Foundation of China, 12101213.

Data Availability Statement

Not applicable.

Acknowledgments

The author thanks those who contributed to this article.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Pocock, M.J.; Evans, D.M.; Memmott, J. The robustness and restoration of a network of ecological networks. Science 2012, 335, 973–977. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  2. Zhang, X.L.; HLi, L.; Kao, Y.G.; Zhang, L.; Jiang, H.J. Global mittag-leffler synchronization of discrete-time fractional-order neural networks with time delays. Appl. Math. Comput. 2022, 43, 127417. [Google Scholar] [CrossRef]
  3. Strogatz, S.H. Exploring complex networks. Nature 2001, 410, 268–276. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  4. Newman, M.E. The structure and function of complex networks. SIAM Rev. 2003, 45, 167–256. [Google Scholar] [CrossRef] [Green Version]
  5. Watts, D.J.; Strogatz, S.H. Collective dynamics of ‘small-world’ networks. Nature 1998, 393, 440–442. [Google Scholar] [CrossRef]
  6. Barabási, A.L.; Albert, R. Emergence of scaling in random networks. Science 1999, 286, 509–512. [Google Scholar] [CrossRef] [Green Version]
  7. Albert, R.; Barabási, A.L. Statistical mechanics of complex networks. Rev. Modern Phys. 2002, 74, 47. [Google Scholar] [CrossRef] [Green Version]
  8. Wang, X.F.; Chen, G.R. Complex networks: Small-world, scale-free and beyond. IEEE Circuits Syst. Mag. 2003, 3, 6–20. [Google Scholar] [CrossRef] [Green Version]
  9. Blekhman, I. The problem of synchronization of dynamical systems. J. Appl. Math. Mech. 1964, 28, 239–265. [Google Scholar] [CrossRef]
  10. Arenas, A.; Díaz-Guilera, A.; Kurths, J.; Moreno, Y.; Zhou, C. Synchronization in complex networks. Phys. Rep. 2008, 469, 93–153. [Google Scholar] [CrossRef] [Green Version]
  11. Huygens, C.; Oscillatorium, H. The pendulum clock. In Trans RJ Blackwell; The Iowa State University Press: Ames, IA, USA, 1986. [Google Scholar]
  12. Zhou, J.; Lu, J.A.; Lu, J.H. Adaptive synchronization of an uncertain complex dynamical network. IEEE Trans. Automat. Control. 2006, 51, 652–656. [Google Scholar] [CrossRef] [Green Version]
  13. Cheng, H.; Zhong, S.; Zhong, Q.S.; Shi, K.B.; Wang, X. Lag exponential synchronization of delayed memristor-based neural networks via robust analysis. IEEE Access 2018, 7, 173–182. [Google Scholar] [CrossRef]
  14. 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]
  15. Cheng, R.R.; Peng, M.S.; Yu, W.B. Pinning synchronization of delayed complex dynamical networks with nonlinear coupling. Phys. A Stat. Mech. Its Appl. 2014, 413, 426–431. [Google Scholar] [CrossRef]
  16. Shen, W.W.; Zeng, Z.G.; Wen, S.P. Synchronization of complex dynamical network with piecewise constant argument of generalized type. Neurocomputing 2016, 173, 671–675. [Google Scholar] [CrossRef]
  17. Shi, C.X.; Yang, G.H.; Li, X.J. Event-triggered output feedback synchronization control of complex dynamical networks. Neurocomputing 2018, 275, 29–39. [Google Scholar] [CrossRef]
  18. Liu, S.X.; Yu, Y.G.; 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]
  19. Dong, Q.; Shi, S.L.; Ma, Y.C. Non-fragile synchronization of complex dynamical networks with hybrid delays and stochastic disturbance via sampled-data control. ISA Trans. 2020, 105, 174–189. [Google Scholar] [CrossRef]
  20. Wang, Y.; Li, T.Z. Synchronization of fractional order complex dynamical networks. Phys. A Stat. Mech. Its Appl. 2015, 428, 1–12. [Google Scholar] [CrossRef]
  21. Liang, S.; Wu, R.C.; Chen, L.P. Adaptive pinning synchronization in fractional-order uncertain complex dynamical networks with delay. Phys. A Stat. Mech. Its Appl. 2016, 444, 49–62. [Google Scholar] [CrossRef]
  22. Du, L.; Yang, Y.; Lei, Y.M. Synchronization in a fractional-order dynamic network with uncertain parameters using an adaptive control strategy. Appl. Math. Mech. 2018, 39, 353–364. [Google Scholar] [CrossRef]
  23. Zhang, Q.J.; Chen, G.R.; Wan, L. Exponential synchronization of discrete-time impulsive dynamical networks with time-varying delays and stochastic disturbances. Neurocomputing 2018, 309, 62–69. [Google Scholar] [CrossRef]
  24. Popa, C.A.; Kaslik, E. Finite-time mittag-leffler synchronization of neutral-type fractional-order neural networks with leakage delay and time-varying delays. Mathematics 2020, 8, 1146. [Google Scholar] [CrossRef]
  25. Zhou, J.; Bao, H.B. Fixed-time synchronization for competitive neural networks with gaussian-wavelet-type activation functions and discrete delays. J. Appl. Math. Comput. 2020, 64, 103–118. [Google Scholar] [CrossRef]
  26. Wang, Z.C.; Chen, G.L.; Ning, Z.P.; Xia, J.W. Stability analysis of impulsive switched nonlinear systems with double state-dependent delays. J. IEEE Trans. Circuits Syst. II Express Briefs 2022, 69, 5014–5018. [Google Scholar] [CrossRef]
  27. Zhou, W.N.; Wang, T.B.; Mou, J.P. Mean square exponential synchronization in lagrange sense for uncertain complex dynamical networks. J. Frankl. Inst. 2012, 349, 1267–1282. [Google Scholar] [CrossRef]
  28. Zhang, Y.J.; Gu, D.W.; Xu, S.Y. Global exponential adaptive synchronization of complex dynamical networks with neutral-type neural network nodes and stochastic disturbances. IEEE Trans. Circuits Syst. I Regul. Pap. 2013, 60, 2709–2718. [Google Scholar] [CrossRef]
  29. Wang, Y.N.; Ma, Y.C.; Chen, A.H. Exponential synchronization of markovian jump complex dynamical networks with partially uncertain transition rates and stochastic disturbances. Neurocomputing 2018, 304, 30–46. [Google Scholar] [CrossRef]
  30. Sipahi, R.; Niculescu, S.I.; Abdallah, C.T.; Michiels, W.; Gu, K. Stability and stabilization of systems with time delay. IEEE Control Syst. Mag. 2011, 31, 38–65. [Google Scholar]
  31. Mao, X.R. Stabilization of continuous-time hybrid stochastic differential equations by discrete-time feedback control. Automatica 2013, 49, 3677–3681. [Google Scholar] [CrossRef] [Green Version]
  32. Samidurai, R.; Sriraman, R. Non-fragile sampled-data stabilization analysis for linear systems with probabilistic time-varying delays. J. Frankl. Inst. 2019, 356, 4335–4357. [Google Scholar] [CrossRef]
  33. Samidurai, R.; Sriraman, R.; Zhu, S. Stability and dissipativity analysis for uncertain markovian jump systems with random delays via new approach. Int. J. Syst. Sci. 2019, 50, 1609–1625. [Google Scholar] [CrossRef]
  34. Samidurai, R.; Sriraman, R.; Cao, J.; Tu, Z. Nonfragile stabilization for uncertain system with interval time-varying delays via a new double integral inequality. Math. Methods Appl. Sci. 2018, 41, 6272–6287. [Google Scholar] [CrossRef]
  35. Kaviarasan, B.; Kwon, O.M.; Park, M.J.; Sakthivel, R. Composite synchronization control for delayed coupling complex dynamical networks via a disturbance observer-based method. Nonlinear Dynam. 2020, 99, 1601–1619. [Google Scholar] [CrossRef]
  36. Zhu, J.W.; Yang, G.H. Robust H∞ dynamic output feedback synchronization for complex dynamical networks with disturbances. Neurocomputing 2016, 175, 287–292. [Google Scholar] [CrossRef]
  37. Qin, Z.; Wang, J.L.; Huang, Y.L.; Ren, S.Y. Analysis and adaptive control for robust synchronization and H∞ synchronization of complex dynamical networks with multiple time-delays. Neurocomputing 2018, 289, 241–251. [Google Scholar] [CrossRef]
  38. Shen, Y.; Wang, J. Robustness analysis of global exponential stability of recurrent neural networks in the presence of time delays and random disturbances. IEEE Trans. Neural Netw. Learn. Syst. 2011, 23, 87–96. [Google Scholar] [CrossRef]
  39. Si, W.X.; Xie, T.; Li, B.W. Robustness analysis of exponential stability of neutral-type nonlinear systems with multi-interference. IEEE Access 2021, 9, 116015–116032. [Google Scholar] [CrossRef]
  40. Lia, B.W.; Huang, J.J.; Wang, D.L. Robustness analysis of control laws in complex dynamical networks evoked by deviating argument. Discrete Dyn. Nat. Soc. 2022, 2022. [Google Scholar] [CrossRef]
  41. Zhang, Q.K.; Fang, W.X.; Xie, T. Robustness analysis of exponential synchronization in complex dynamic networks with random perturbations. AIMS Math. 2023, 8, 20487–20509. [Google Scholar] [CrossRef]
  42. Mao, X.R. Stochastic Differential Equations and Applications, 2nd ed.; Publishing House—Woodhead Publishing: Sawston, UK, 2008. [Google Scholar]
  43. Li, N.; Sun, H.Y.; Jing, X.; Zhang, Q.L. Exponential synchronisation of united complex dynamical networks with multi-links via adaptive periodically intermittent control. IET Control Theory Appl. 2013, 7, 1725–1736. [Google Scholar] [CrossRef]
Figure 1. Convergence state of CDN (71) ϱ ˘ = 0.0280 under linear controller.
Figure 1. Convergence state of CDN (71) ϱ ˘ = 0.0280 under linear controller.
Symmetry 15 01510 g001
Figure 2. The state of CDN (72) without time delays under the linear controller.
Figure 2. The state of CDN (72) without time delays under the linear controller.
Symmetry 15 01510 g002
Figure 3. The state of CDN (71) at ϱ ˘ = 0.0350 under linear controller.
Figure 3. The state of CDN (71) at ϱ ˘ = 0.0350 under linear controller.
Symmetry 15 01510 g003
Figure 4. Convergence state of CDN (76) ϱ ˘ = 0.2250 under linear controller.
Figure 4. Convergence state of CDN (76) ϱ ˘ = 0.2250 under linear controller.
Symmetry 15 01510 g004
Figure 5. The state of CDN (77) without time delays under the linear controller.
Figure 5. The state of CDN (77) without time delays under the linear controller.
Symmetry 15 01510 g005
Figure 6. The state of CDN (76) at ϱ ˘ = 0.3300 under linear controller.
Figure 6. The state of CDN (76) at ϱ ˘ = 0.3300 under linear controller.
Symmetry 15 01510 g006
Figure 7. The state of CDN (81) with ϱ ˘ = 0.0303 and δ ˜ = 0.002 under linear controller.
Figure 7. The state of CDN (81) with ϱ ˘ = 0.0303 and δ ˜ = 0.002 under linear controller.
Symmetry 15 01510 g007
Figure 8. The state of CDN (81) without delay and disturbance under linear controller.
Figure 8. The state of CDN (81) without delay and disturbance under linear controller.
Symmetry 15 01510 g008
Figure 9. The state of CDN (82) with ϱ ˘ = 0.403 and δ ˜ = 0.024 under linear controller.
Figure 9. The state of CDN (82) with ϱ ˘ = 0.403 and δ ˜ = 0.024 under linear controller.
Symmetry 15 01510 g009
Figure 10. The state of CDN (87) with ϱ ˘ = 0.0351 and δ ˜ = 0.0876 under nonlinear controller.
Figure 10. The state of CDN (87) with ϱ ˘ = 0.0351 and δ ˜ = 0.0876 under nonlinear controller.
Symmetry 15 01510 g010
Figure 11. The state of CDN (88) without delay and disturbance under nonlinear controller.
Figure 11. The state of CDN (88) without delay and disturbance under nonlinear controller.
Symmetry 15 01510 g011
Figure 12. The state of CDN (87) with ϱ ˘ = 0.5 and δ ˜ = 0.094 under nonlinear controller.
Figure 12. The state of CDN (87) with ϱ ˘ = 0.5 and δ ˜ = 0.094 under nonlinear controller.
Symmetry 15 01510 g012
Table 1. This article deals with abbreviated tables.
Table 1. This article deals with abbreviated tables.
Full NameAbbreviation
Exponential stabilityESt
Mean-square exponential stability (synchronization)MSESt (MSESy)
Almost surely exponential stability (synchronization)ASESt (ASESy)
Table 2. Comparing other articles with this one.
Table 2. Comparing other articles with this one.
ControllersRPDArTvDESyAsSyRobustness
Shen [16]
Zhang [23]
Wang [29]
Lia [40]
Zhang [41]
This paper
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.; Zhang, Q.; Xiong, X. Robustness Analysis of Exponential Synchronization in Complex Dynamic Networks with Time-Varying Delays and Random Disturbances. Symmetry 2023, 15, 1510. https://doi.org/10.3390/sym15081510

AMA Style

Xie T, Zhang Q, Xiong X. Robustness Analysis of Exponential Synchronization in Complex Dynamic Networks with Time-Varying Delays and Random Disturbances. Symmetry. 2023; 15(8):1510. https://doi.org/10.3390/sym15081510

Chicago/Turabian Style

Xie, Tao, Qike Zhang, and Xing Xiong. 2023. "Robustness Analysis of Exponential Synchronization in Complex Dynamic Networks with Time-Varying Delays and Random Disturbances" Symmetry 15, no. 8: 1510. https://doi.org/10.3390/sym15081510

APA Style

Xie, T., Zhang, Q., & Xiong, X. (2023). Robustness Analysis of Exponential Synchronization in Complex Dynamic Networks with Time-Varying Delays and Random Disturbances. Symmetry, 15(8), 1510. https://doi.org/10.3390/sym15081510

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