Next Article in Journal
A Linear Mixed Model Approach for Determining the Effect of Financial Inclusion on Bank Stability: Comparative Empirical Evidence for Islamic and Conventional Banks in Kuwait
Next Article in Special Issue
Positive Periodic Solution for Pipe/Tank Flow Configurations with Friction
Previous Article in Journal / Special Issue
On a Method for Optimizing Controlled Polynomial Systems with Constraints
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Hybrid Impulsive Pinning Control for Mean Square Synchronization of Uncertain Multi-Link Complex Networks with Stochastic Characteristics and Hybrid Delays

1
College of Computer, Chengdu University, Chengdu 610106, China
2
Key Laboratory of Pattern Recognition and Intelligent Information Processing, Institutions of Higher Education of Sichuan Province, Chengdu University, Chengdu 610106, China
3
School of Mathematical and Computational Science, Hunan University of Science and Technology, Xiangtan 411201, China
4
College of Physics and Electronic Information, Gannan Normal University, Ganzhou 341000, China
*
Author to whom correspondence should be addressed.
Mathematics 2023, 11(7), 1697; https://doi.org/10.3390/math11071697
Submission received: 26 February 2023 / Revised: 30 March 2023 / Accepted: 31 March 2023 / Published: 2 April 2023

Abstract

:
This study explores the synchronization issue for uncertain multi-link complex networks incorporating stochastic characteristics and hybrid delays. Unlike previous works, internal delays, coupling delays, and stochastic delays considered in our model change over time; meanwhile, the impulse strength and position change with time evolution. To actualize network synchronization, a strategy called hybrid impulsive pinning control is applied, which combines the virtue of impulsive control and pinning control as well as two categories of impulses (i.e., synchronization and desynchronization). By decomposing the complicated topological structures into diagonal items and off-diagonal items, multiple nonlinear coupling terms are linearly decomposed in the process of theoretical analysis. Combining inequality technology and matrix decomposition theory, several novel synchronization criteria have been gained to ensure synchronization for the concerning multi-link model. The criteria get in touch with the uncertain strengths, coupling strengths, hybrid impulse strengths, delay sizes, impulsive intervals, and network topologies.

1. Introduction

People generally live in various complex networks, such as transportation networks, information networks, power grids, and so on. Synchronization is a representative collective behavior of complex networks, which has a prominent theoretical meaning and extensive practical applications in non-fragile filtering, topology recognition, system stability, encryption, and decryption [1,2,3,4,5]. Recently, numerous synchronization modes have been discussed in depth, incorporating complete synchronization [6,7], cluster synchronization [8,9], quasi-synchronization [10,11], projective synchronization [12,13], exponential synchronization [14,15,16], etc. Regrettably, considering a complex network could have multi-links, many publications for synchronization analysis mainly concern complex networks including only a single link, making it difficult to portray the real network precisely. Multi-links mean that there may exist more than one path between each pair of nodes and that each pair has its special attributes. For instance, in the transportation networks, there are significant differences in carriage delays and connectivities among aviation networks, land networks, and waterway networks, which indicates single-link systems cannot characterize such types of multichannel transportation networks well (see Figure 1). For a human connection network, there are different communication tools, including e-mail, telephone, and Facebook. Obviously, this network represents a characteristic multi-link model that cannot be expressed by a single-link system. Hence, it is necessary to further study multi-links systems owing to their universality. Recently, some scholars have noticed various synchronization problems in such networks [17,18,19]. In [17], Zhou et al. discussed the exponential synchronization of stochastic complex dynamical networks including multi-links. In [18], Guo et al. considered the synchronization of multi-link networks with switching signals in finite time. In [19], Xu et al. gained impulsive synchronization conditions for multi-link dynamical systems embedding non-integer order effects. It should be pointed out that the effect of time delays was not considered in these multi-link models mentioned above.
In a multi-link network, the delay cannot be avoided due to the influence of network width, congestion, and transmission distance. Considering the significant differences between subnetworks, each subnetwork often has different time delays. Observing a transportation network, which usually consists of the aviation network, highway network, and railway network, each subsystem possesses different vehicle speeds and link types, which means the time delays in each coupling structure of subnetworks may not be the same. To construct a more practical system, in [20], delays in the coupling state were discussed in the multi-link networks. In [21], the authors explored synchronization problems for memristor-based multi-link systems containing leakage delays. In [22], Zhou et al. considered the synchronization of delayed multi-link dynamical systems including non-monolayer coupling. In [23,24], two types of delays including internal and coupling delays were discussed in the time-varying multi-link systems, and several synchronization criteria could be gained with the aid of different differential inequalities.
In addition, systems in real environments often encounter various stochastic disturbances, and these disturbances may disrupt the steady state of systems or cause asynchronization [25]. As a consequence, when modeling a delayed complex network, stochastic disturbances should not be left out. Up to now, several relevant synchronization results paid attention to such phenomena. For example, in [26], Zhou et al. considered the intermittent synchronization of non-strong connectivity networks comprising time-varying delays and stochastic disturbances. In [27], Shi et al. studied the sampling synchronization for memory neural networks with random network attacks in finite time. In [28], Zhang et al. gained sufficient conditions of exponential synchronization for delayed stochastic systems by impulsive technologies. In [29], Liu et al. dealt with the inner synchronization issue for stochastic impulsive networks. Note that these works were considered for single-link stochastic complex systems rather than multi-link stochastic systems. To study the effect of stochastic perturbations on multi-link systems, Zhao et al. [30] investigated projective synchronization for multi-link dynamical networks including stochastic disturbances, where system delays are neglected. As we know, studies on the mean square synchronization of uncertain multi-link dynamical networks incorporating stochastic noise and hybrid time-varying delays are sparse, which is the first motivation for this study.
It is necessary to exert external control over the network to achieve network synchronization since many networks cannot achieve synchronization only by relying on the coupling between different nodes. From the point of time series, the mainstream control mechanism consists of two types. One is continuous control, for instance, feedback control [31], and adaptive control [32]. Another is discrete control, such as intermittent control [33], and impulsive control [34]. As a kind of discontinuous input method, impulsive control is only activated at some finite time points, efficiently reducing the control time and increasing the synchronization security [35]. For example, Tang et al. [36] attained the synchronization criteria for derivative-coupled systems utilizing impulsive control schemes. By constructing the impulsive comparison principle, the authors in [37] dealt with the impulsive synchronization problems of dynamical networks incorporating delays without bounds. Generally, it is impractical to control all nodes in the network because complex dynamic networks are often large-scale. Pinning control is an efficient method because it can control the whole system by pinning a small fraction of network nodes instead of all nodes. Naturally, pinning impulsive control, which integrates the superiorities of pinning control and impulsive control, can be more efficient to achieve synchronization since it only needs to control a few nodes at several discrete instants. At present, many previous results about synchronization have been obtained by pinning impulsive control strategies. Specifically, the impulsive effect is always assumed to satisfy μ ( 2 , 0 ) [38], μ ( 1 , 1 ) [8,39], μ ( 0 , 1 ) [40], or other homologous restricted intervals, which implies only impulsive effects profiting synchronization are considered. In reality, when network nodes transmit information to each other, impulses can act on beneficial and harmful effects, which means that various types of impulses should be considered meanwhile. For multi-link complex networks, very few works considered both synchronizing impulse and desynchronizing impulse, which forms the second reason for researching this article. These comprehensive factors including uncertainties, stochastic characteristics, and various delays in multi-link complex networks pose new challenges to the study of system synchronization. Our research focuses on utilizing the positive and negative effects of impulses for solving this difficulty.
Enlightened by the literature above, this study considered the impulsive synchronization of uncertain stochastic multi-link complex networks involving hybrid delays utilizing hybrid control schemes. To be more authentic, nonlinear couplings are introduced and uncertainties are time-varying. The principal highlights of this study contain three parts. Firstly, time-varying factors, including internal delays, coupling delays, stochastic noise, and uncertain disturbances, are incorporated into our model, which makes the results obtained in this paper exceed the previous related works. Secondly, discriminating from the impulsive effects in [8,38,39,40], synchronizing impulses, and desynchronizing impulses are first applied to multi-link systems in this study, i.e., the scopes of impulsive strength need not be restricted, regardless of whether the impulses are beneficial or harmful to the synchronization state. Lastly, some novel synchronization criteria for the generalized multi-link network models are obtained based on the hybrid pinning impulsive control methods and matrix decomposition techniques.
Besides the introduction part, Section 2 introduces the mathematical model description of uncertain stochastic multi-link systems. Section 3 studies the hybrid impulsive pinning control for mean square synchronization of the concerned multi-link systems. Section 4 gives a simulation experiment for validating purposes, and Section 5 presents the conclusion.
Notation 1.
R n represents the n-dimensional real space with Euclidean norm · . λ m a x ( B ) stands for the maximum eigenvalue of matrix B. d i a g { } stands for a diagonal matrix. For matrices X R n × m and Y R p × q , X Y R n p × m q can be computed as
X Y = x 11 Y x 12 Y x 1 m Y x 21 Y x 22 Y x 2 m Y x n 1 Y x n 2 Y x n m Y .

2. Model Introduction and Preknowledge

The uncertain multi-link complex networks incorporating stochastic characteristics and hybrid delays could be modeled as
d z i ( t ) = [ ( A + Δ A ( t ) ) z i ( t ) + ( B + Δ B ( t ) ) h ( z i ( t ) ) + ( D + Δ D ( t ) ) f ( z i ( t τ 0 ( t ) ) ) + c 1 j = 1 N Θ i j ( 1 ) Γ 1 ψ 1 ( z j ( t τ 1 ( t ) ) ) + c 2 j = 1 N Θ i j ( 2 ) Γ 2 ψ 2 ( z j ( t τ 2 ( t ) ) ) + + c m j = 1 N Θ i j ( m ) Γ m ψ m ( z j ( t τ m ( t ) ) ) ] d t + g ( t , z i ( t ) , z i ( t τ 0 ( t ) ) ) d w ( t ) + u i ( t ) ,
where i = 1 , 2 , , N , and z i ( t ) = ( z i 1 ( t ) , z i 2 ( t ) , , z i n ( t ) ) T R n is the state vector of node i, A = d i a g { a 1 , a 2 , , a n } is a diagonal matrix with a i > 0 . B = ( b i j ) n × n and D = ( d i j ) n × n are the non-delayed and delayed connection weight matrices, respectively. Δ A ( t ) , Δ B ( t ) , and Δ D ( t ) denote the uncertain matrices. h ( z i ( t ) ) = ( h 1 ( z i 1 ( t ) ) , h 2 ( z i 2 ( t ) ) , , h n ( z i n ( t ) ) ) T and f ( z i ( t ) ) = ( f 1 ( z i 1 ( t ) ) , f 2 ( z i 2 ( t ) ) , , f n ( z i n ( t ) ) ) T represent the activation functions at time t. c k ( k = 1 , 2 , , m ) is the positive coupling strength for the kth coupling form. ψ k ( z i ( t ) ) = ( ψ k 1 ( z i 1 ( t ) ) , ψ k 2 ( z i 2 ( t ) , , ψ k n ( z i n ( t ) ) T ( k = 1 , 2 , , m ) stands for the kth coupling nonlinear function. Γ k = d i a g { γ 1 k , γ 2 k , , γ n k } > 0 ( k = 1 , 2 , , m ) represents the kth inner coupling matrix. Θ ( k ) = ( Θ i j ( k ) ) N × N ( k = 1 , 2 , , m ) represents the kth coupling configuration matrix, where Θ i j ( k ) is defined as follows: if there is a link from node i to node j, then Θ i j ( k ) 0 ; otherwise, Θ i j ( k ) = 0 ( i j ) . Moreover, assume that Θ ( k ) satisfies the diffusive coupling condition Θ i i ( k ) = j = 1 , j i N Θ i j ( k ) ( i = 1 , 2 , , N ) . The time-varying delays τ 0 ( t ) and τ k ( t ) ( k = 1 , 2 , , m ) are the bound functions, i.e., 0 < τ 0 ( t ) τ , 0 < τ k ( t ) τ ( k = 1 , 2 , , m ) , in which τ 0 ( t ) denotes the internal or stochastic delay and τ k ( t ) ( k = 1 , 2 , , m ) denote the coupling delays, respectively. w ( t ) = ( w 1 ( t ) , w 2 ( t ) , , w n ( t ) ) T R n represents a bounded Weiner process, which satisfies E [ d w i ( t ) ] = 0 , E [ d w i 2 ( t ) ] = 1 and E [ d w j ( t ) d w j ( s ) ] = 0 for t s . g ( · ) R n × n stands for the noise intensity function matrix, satisfying g ( t , 0 , 0 ) = 0 .
Remark 1.
To our knowledge, most multi-layer neural networks in engineering are multi-link since each layer can be regarded as a subnetwork. Multi-layer neural networks have been successfully utilized in various aspects, such as visual analysis, behavior recognition, machine learning, etc. Unfortunately, very few works have investigated hybrid impulsive pinning synchronization problems concerning uncertain multi-link stochastic networks including two impulses, and we try to solve these problems in this study.
Let s ( t ) = ( s 1 ( t ) , s 2 ( t ) , , s n ( t ) ) T be an arbitrary solution of an isolated node of system (1), which could be given by
d s ( t ) = ( A + Δ A ( t ) ) s ( t ) + ( B + Δ B ( t ) ) h ( s ( t ) ) + ( D + Δ D ( t ) ) f ( s ( t τ 0 ( t ) ) ) d t + g ( t , s ( t ) , s ( t τ 0 ( t ) ) ) d w ( t ) .
Define e i ( t ) = z i ( t ) s ( t ) be the synchronization error of node i between the current state z i ( t ) and the objective state s ( t ) . By imposing impulsive effects on the pinned nodes, the impulsive pinning controllers can be considered as
I i ( t ) = σ = 1 + ρ σ e i ( t ) δ ( t t σ ) , i W ( t σ ) , 0 , i W ( t σ ) ,
where ρ σ represents the impulsive strength at each discrete instant t σ . δ ( . ) denotes the well-known Dirac delta function. The impulsive instants { t σ } meet t σ + as σ + . W ( t σ ) = { i 1 , i 2 , , i l } { 1 , 2 , , N } stands for the set of pinned nodes at t = t σ , and it is defined as
(i)
We can reset the errors e 1 ( t ) , e 2 ( t ) , , e N ( t ) for e p 1 ( t ) e p 2 ( t ) e p l ( t ) e p N ( t ) . If ρ σ M : = ( 2 , 0 ) , then W ( t σ ) = { p 1 , p 2 , , p l } .
(ii)
We can reset the errors e 1 ( t ) , e 2 ( t ) , , e N ( t ) for e v 1 ( t ) e v 2 ( t ) e v l ( t ) e v N ( t ) . If ρ σ B : = ( , 2 ) ( 0 , + ) , then W ( t σ ) = { v 1 , v 2 , , v l } . Noting that c 1 j = 1 N Θ i j ( 1 ) Γ 1 ψ 1 ( s ( t τ 1 ( t ) ) ) = c 2 j = 1 N Θ i j ( 2 ) Γ 2 ψ 2 ( s ( t τ 2 ( t ) ) ) = = c m j = 1 N Θ i j ( m ) Γ m ψ m ( s ( t τ m ( t ) ) ) = 0 , and adding the impulsive effects to multi-link networks (1), one can get the following error system:
d e i ( t ) = [ ( A + Δ A ( t ) ) e i ( t ) + ( B + Δ B ( t ) ) h ˜ ( e i ( t ) ) + ( D + Δ D ( t ) ) f ˜ ( e i ( t τ 0 ( t ) ) ) + k = 1 m j = 1 N c k Θ i j ( k ) Γ k ψ k ˜ ( e j ( t τ k ( t ) ) ) ] d t + g ˜ ( t , e i ( t ) , e i ( t τ 0 ( t ) ) ) d w ( t ) , e i ( t σ + ) = e i ( t σ ) + ρ σ e i ( t σ ) , i W ( t σ ) , e i ( t ) = ϑ i ( t ) , i [ τ , 0 ] ,
where h ˜ ( e i ( t ) ) = h ( z i ( t ) ) h ( s ( t ) ) , f ˜ ( e i ( t τ 0 ( t ) ) ) = f ( z i ( t τ 0 ( t ) ) ) f ( s ( t τ 0 ( t ) ) ) , ψ ˜ k ( e j ( t τ k ( t ) ) ) = ψ k ( z j ( t τ k ( t ) ) ) ψ k ( s ( t τ k ( t ) ) ) and g ˜ ( t , e i ( t ) , e i ( t τ 0 ( t ) ) ) = g ( t , z i ( t ) , z i ( t τ 0 ( t ) ) ) g ( t , s ( t ) , s ( t τ 0 ( t ) ) ) . Moreover, the initial values of error dynamical system (4) are presumed to be e i ( t ) = ζ i ( t ) , τ t 0 , i = 1 , 2 , , N , where τ = m a x { τ 0 , τ 1 , τ 2 , , τ m } and ζ i ( t ) C ( [ τ , 0 ] , R n ) .
Remark 2.
Considering | 1 + ρ σ | > 1 , i.e., ρ σ B : = ( , 2 ) ( 0 , + ) , impulsive influences are harmful to the synchronization process of dynamical system (4), which leads to the synchronization error increases large with time evolution, so they are called desynchronizing impulses. Conversely, considering | 1 + ρ σ | < 1 , i.e., ρ σ M : = ( 2 , 0 ) , impulsive influences are helpful to the synchronization process of dynamical system (4), and they are called synchronizing impulses. Especially, if | 1 + ρ σ | = 1 ( ρ σ { 2 , 0 } ) , impulsive influences are neither detrimental nor helpful for achieving synchronization. This study only explores the first two impulses, and one can easily extend them to ρ σ { 2 , 0 } .
Remark 3.
To characterize synchronizing and desynchronizing simultaneously, we assume that the strengths of desynchronizing impulse select from a limited set { ρ ^ 1 , ρ ^ 2 , , ρ ^ r } B . Meanwhile, the strengths of synchronization impulse select from { ρ ˇ 1 , ρ ˇ 2 , , ρ ˇ q } M .
Next, some useful preliminary knowledge is introduced.
Assumption 1.
For the activation functions h : R n R n , f : R n R n , constants l h > 0 , l f > 0 exist, such that
h ( z i ( t ) ) h ( s ( t ) ) l h z i ( t ) s ( t ) , f ( z i ( t ) ) f ( s ( t ) ) l f z i ( t ) s ( t )
for any s ( t ) and z i ( t ) , i = 1 , 2 , , N .
Assumption 2.
The parametric uncertainties Δ A ( t ) , Δ B ( t ) and Δ D ( t ) can be expressed by
Δ A ( t ) = M A Λ ( t ) H A , Δ B ( t ) = M B Λ ( t ) H B , Δ D ( t ) = M D Λ ( t ) H D ,
where M A , M B , M D , H A , H B , H D are constant matrices and the unknown matrix Λ ( t ) meets Λ T ( t ) Λ ( t ) I n .
Assumption 3.
For the nonlinearly-coupled functions ψ k η ( · ) , k = 1 , 2 , , m , η = 1 , 2 , , n , constants α 1 > 0 exist and α 2 > 0 , such that
[ π ( t ) π ¯ ( t ) ] [ ψ k η ( π ( t τ k ( t ) ) ) ψ k η ( π ¯ ( t τ k ( t ) ) ) α 1 [ π ( t ) π ¯ ( t ) ] 2 + α 2 [ π ( t τ k ( t ) ) π ¯ ( t τ k ( t ) ) ] 2
for any π ( t ) , π ¯ ( t ) R .
Remark 4.
Especially, when τ k ( t ) = 0 , k = 1 , 2 , , m , one can obtain the following inequality
ψ k η ( π ( t ) ) ψ k η ( π ¯ ( t ) ) π ( t ) π ¯ ( t ) α 1 + α 2 .
Assumption 4.
Assume that the intensity function g ( · ) conforms to the following requirement:
t r a c e [ ( g ( t , π 1 , z 1 ) g ( t , π 2 , z 2 ) ) T ( g ( t , π 1 , z 1 ) g ( t , π 2 , z 2 ) ) ] M 1 ( π 1 π 2 ) 2 + M 2 ( z 1 z 2 ) 2 ,
π 1 , π 2 , z 1 , z 2 R n , where M 1 , M 2 represent suitable constant matrices.
Assumption 5.
There are positive numbers T ˇ i and T ^ j satisfying
N i ˇ ( t , T ) T t T i ˇ N 0 ,
and
N ^ j ( t , T ) T t T j ^ + N 0 ,
for N 0 0 , T i ˇ , T j ^ , i = 1 , 2 , , q , j = 1 , 2 , , r , where N ˇ i ( t , T ) and N ^ j ( t , T ) represent the amount of the synchronizing impulsive sequence and desynchronizing impulsive sequence on the interval ( t , T ) , respectively.
Definition 1.
Under mean square sense, the controlled multi-link complex networks (1) can be known as exponential synchronization, if positive constants λ, T 0 and θ exist such that
E i = 1 N e i ( t ) 2 θ e λ t ,
for all t > T 0 and initial values ζ i ( t ) , i = 1 , 2 , , N .
Lemma 1
([41]). For any real matrices X and Y with correct dimensions, a scalar ϵ 0 > 0 exists such that
X T Y + Y T X ϵ 0 X T X + 1 ϵ 0 Y T Y .
Lemma 2
([42]). Let 0 τ i ( t ) τ , F ( t , v , v ¯ 1 , v ¯ 2 , , v ¯ m ) : R + × R × × R m + 1 R be nondecreasing in v ¯ i for each fixed ( t , v , v ¯ 1 , , v ¯ i 1 , v ¯ i + 1 , , v ¯ m ) , i = 1 , 2 , , m , and J σ ( v ) : R R be nondecreasing in v. Assume v ( t ) , w ( t ) P C ( [ τ , + ) , R ) ) meet
D + v ( t ) F ( ( t , v ( t ) , v ( t τ 1 ( t ) ) , , v ( t τ m ( t ) ) ) , t t σ , t 0 , v ( t σ ) J σ ( v ( t σ ) ) , σ N ,
and
D + w ( t ) > F ( t , w ( t ) , w ( t τ 1 ( t ) ) , , w ( t τ m ( t ) ) ) , t t σ , t 0 , w ( t σ ) J σ ( w ( t σ ) ) , σ N .
Then, v ( t ) w ( t ) for τ t 0 means v ( t ) w ( t ) for t 0.

3. Main Results

Before giving the main theorem, the meaning of two important symbols needs to be explained. Let Θ ( k ) = Θ ¯ ( k ) + Θ ˜ ( k ) , k = 1 , 2 , , m , where Θ ¯ ( k ) = d i a g { Θ 11 ( k ) , Θ 22 ( k ) , , Θ N N ( k ) } consist of the diagonal elements of Θ ( k ) , and Θ ˜ ( k ) preserves the off-diagonal elements of Θ ( k ) .
Theorem 1.
Assume that Assumptions 1–5 hold. Under the mean square sense, controlled multi-link networks (1) can be globally exponentially synchronized to the target s ( t ) :
E i = 1 N e i ( t ) 2 ς e λ t ,
if positive scalars α B , α D , α 1 , α 2 , l h , l f , η 0 , β 0 and β k ( k = 1 , 2 , , m ) exist, such that the following conditions hold:
(i) 
Ω 0 I N η 0 I n ,
(ii) 
Λ 0 I N β 0 I n ,
(iii) 
Λ k I N β k I n , k = 1 , 2 , , m ,
(iv) 
ξ κ γ > 0 ,
where ς = κ E i = 1 N sup τ s 0 { ζ i ( s ) 2 } , κ = ( i = 1 q j = 1 r μ ˇ i 1 μ ^ j ) N 0 , ξ = ( η 0 + i = 1 q l n μ ˇ i T ˇ i + j = 1 r l n μ ^ j T ^ j ) , μ ˇ i = N + l ρ ˇ i ( ρ ˇ i + 2 ) N ( 0 , 1 ) , μ ^ j = N + l ρ ^ j ( ρ ^ j + 2 ) N ( 1 , + ) , γ = β 0 + k = 1 m c k β k , Ω 0 = I N 2 A + M A M A T + M B M B T + M D M D T + H A T H A + α B 2 B B T + α D 2 D D T + M 1 T M 1 + ( 2 α B + λ m a x ( H B T H B ) ) l h 2 I n + 2 k = 1 m c k α 1 ( Θ ¯ ( k ) Γ k ) + k = 1 m c k ( Θ ˜ ( k ) Θ ˜ ( k ) T Γ k Γ k T ) , Λ 0 = I N 2 α D + λ m a x ( H D T H D ) l f 2 I n + M 2 T M 2 , Λ k = 2 α 2 ( Θ ¯ ( k ) Γ k ) + I N ( α 1 + α 2 ) 2 I n , and λ is a sole root of λ ξ + κ [ β 0 e λ τ 0 + k = 1 m c k β k e λ τ k ] = 0 .
Proof. 
Let e ( t ) = ( e 1 T ( t ) , e 2 T ( t ) , , e N T ( t ) ) ) T . Construct the following Lyapunov function:
V ( t ) = i = 1 N e i T ( t ) e i ( t ) = e T ( t ) e ( t ) .
Then, for any t [ t σ 1 , t σ ) , utilizing It o ^ -differential formula, one can obtain
L V ( t ) = i = 1 N 2 e i T ( t ) [ ( A + Δ A ( t ) ) e i ( t ) + ( B + Δ B ( t ) ) h ˜ ( e i ( t ) ) + ( D + Δ D ( t ) ) f ˜ ( e i ( t τ 0 ( t ) ) ) + k = 1 m j = 1 N c k Θ i j ( k ) Γ k ψ ˜ k ( e j ( t τ k ( t ) ) ) ] + i = 1 N t r a c e g ˜ T ( t , e i ( t ) , e i ( t τ 0 ( t ) ) ) g ˜ ( t , e i ( t ) , e i ( t τ 0 ( t ) ) ) .
By Assumption 2, we have
i = 1 N 2 e i T ( t ) ( A + Δ A ( t ) ) e i ( t ) = i = 1 N 2 e i T ( t ) ( A + M A Λ ( t ) H A ) e i ( t ) i = 1 N 2 e i T ( t ) A e i ( t ) + i = 1 N e i T ( t ) M A M A T e i ( t ) + i = 1 N e i T ( t ) H A T H A e i ( t ) .
Utilizing Assumptions 1 and 2 and Lemma 1, one can find positive constants α B , α D , l h and l f such that
2 i = 1 N e i T ( t ) ( B + Δ B ( t ) ) h ˜ ( e i ( t ) ) = i = 1 N 2 e i T ( t ) B h ˜ ( e i ( t ) ) + i = 1 N 2 e i T ( t ) M B Λ ( t ) H B h ˜ ( e i ( t ) ) i = 1 N α B 2 e i T ( t ) B B T e i ( t ) + i = 1 N 2 α B h ˜ T ( e i ( t ) ) h ˜ ( e i ( t ) ) + i = 1 N e i T ( t ) M B M B T e i ( t ) + i = 1 N h ˜ T ( e i ( t ) ) H B T H B h ˜ ( e i ( t ) ) i = 1 N α B 2 e i T ( t ) B B T e i ( t ) + i = 1 N 2 α B l h 2 e i T ( t ) e i ( t ) + i = 1 N e i T ( t ) M B M B T e i ( t ) + i = 1 N λ m a x ( H B T H B ) l h 2 e i T ( t ) e i ( t ) = i = 1 N α B 2 e i T ( t ) B B T e i ( t ) + i = 1 N e i T ( t ) M B M B T e i ( t ) + i = 1 N [ 2 α B + λ m a x ( H B T H B ) ] l h 2 e i T ( t ) e i ( t )
and
2 i = 1 N e i T ( t ) ( D + Δ D ( t ) ) f ˜ ( e i ( t τ 0 ( t ) ) ) = i = 1 N 2 e i T ( t ) D f ˜ ( e i ( t τ 0 ( t ) ) ) + i = 1 N 2 e i T ( t ) M D Λ ( t ) H D f ˜ ( e i ( t τ 0 ( t ) ) ) i = 1 N α D 2 e i T ( t ) D D T e i ( t ) + i = 1 N 2 α D f ˜ T ( e i ( t τ 0 ( t ) ) ) f ˜ ( e i ( t τ 0 ( t ) ) ) + i = 1 N e i T ( t ) M D M D T e i ( t ) + i = 1 N f ˜ T ( e i ( t τ 0 ( t ) ) ) H D T H D f ˜ ( e i ( t τ 0 ( t ) ) ) i = 1 N α D 2 e i T ( t ) D D T e i ( t ) + i = 1 N e i T ( t ) M D M D T e i ( t ) + i = 1 N [ 2 α D + λ m a x ( H D T H D ) ] l f 2 e i T ( t τ 0 ( t ) ) e i ( t τ 0 ( t ) ) .
In addition, one can obtain
2 i = 1 N k = 1 m j = 1 N c k Θ i j ( k ) e i T ( t ) Γ k ψ ˜ k ( e j ( t τ k ( t ) ) ) = 2 k = 1 m c k i = 1 N Θ i i ( k ) e i T ( t ) Γ k ψ ˜ k ( e i ( t τ k ( t ) ) ) + 2 k = 1 m c k i = 1 N i j N Θ i j ( k ) e i T ( t ) Γ k ψ ˜ k ( e j ( t τ k ( t ) ) ) .
By Assumption 3 and the decomposition express Θ ( k ) = Θ ¯ ( k ) + Θ ˜ ( k ) ( k = 1 , 2 , , m ) , we have
2 k = 1 m c k i = 1 N Θ i i ( k ) e i T ( t ) Γ k ψ ˜ k ( e i ( t τ k ( t ) ) ) = 2 k = 1 m c k i = 1 N Θ i i ( k ) p = 1 n γ p k e i p ( t ) ψ ˜ k p ( e i p ( t τ k ( t ) ) ) 2 k = 1 m c k i = 1 N Θ i i ( k ) p = 1 n α 1 e i p ( t ) γ p k e i p ( t ) + α 2 e i p ( t τ k ( t ) ) γ p k e i p ( t τ k ( t ) ) = 2 k = 1 m c k i = 1 N Θ i i ( k ) α 1 e i T ( t ) Γ k e i ( t ) + Θ i i ( k ) α 2 e i T ( t τ k ( t ) ) Γ k e i ( t τ k ( t ) ) = 2 k = 1 m c k α 1 e T ( t ) ( Θ ¯ ( k ) Γ k ) e ( t ) + 2 k = 1 m c k α 2 e T ( t τ k ( t ) ) ( Θ ¯ ( k ) Γ k ) e ( t τ k ( t ) )
and
2 k = 1 m c k i = 1 N i j N Θ i j ( k ) e i T ( t ) Γ k ψ ˜ k ( e j ( t τ k ( t ) ) ) = 2 k = 1 m c k e T ( t ) ( Θ ˜ ( k ) Γ k ) ψ ˜ k ( e ( t τ k ( t ) ) ) k = 1 m c k e T ( t ) ( Θ ˜ ( k ) Θ ˜ ( k ) T Γ k Γ k T ) e ( t ) + k = 1 m c k ( α 1 + α 2 ) 2 e T ( t τ k ( t ) ) e ( t τ k ( t ) )
where ψ ˜ k ( e i ( t τ k ( t ) ) ) = [ ψ ˜ k 1 ( e i 1 ( t τ k ( t ) ) ) , ψ ˜ k 2 ( e i 2 ( t τ k ( t ) ) ) , , ψ ˜ k n ( e i n ( t τ k ( t ) ) ) ] T .
By Assumption 4, we have
i = 1 N t r a c e [ g ˜ T ( t , e i ( t ) , e i ( t τ 0 ( t ) ) ) g ˜ ( t , e i ( t ) , e i ( t τ 0 ( t ) ) ) ] i = 1 N [ e i T ( t ) M 1 T M 1 e i ( t ) + e i T ( t τ 0 ( t ) ) M 2 T M 2 e i ( t τ 0 ( t ) ) ] = e T ( t ) ( I N M 1 T M 1 ) e ( t ) + e T ( t τ 0 ( t ) ) ( I N M 2 T M 2 ) e ( t τ 0 ( t ) )
Substituting (7)–(13) into (6), one can obtain
L V ( t ) 2 e T ( t ) ( I N A ) e ( t ) + e T ( t ) ( I N M A M A T ) e ( t ) + e T ( t ) ( I N H A T H A ) e ( t ) + α B 2 e T ( t ) ( I N B B T ) e ( t ) + e T ( t ) ( I N M B M B T ) e ( t ) + e T ( t ) ( I N M 1 T M 1 ) e ( t ) + e T ( t τ 0 ( t ) ) ( I N M 2 T M 2 ) e ( t τ 0 ( t ) ) + ( 2 α B + λ m a x ( H B T H B ) ) e T ( t ) ( I N l h 2 I n ) e ( t ) + α D 2 e T ( t ) ( I N D D T ) e ( t ) + ( 2 α D + λ m a x ( H D T H D ) ) e T ( t τ 0 ( t ) ) ( I N l f 2 I n ) e ( t τ 0 ( t ) ) + e T ( t ) ( I N M D M D T ) e ( t ) + 2 k = 1 m c k α 1 e T ( t ) ( Θ ¯ ( k ) Γ k ) e ( t ) + 2 k = 1 m c k α 2 e T ( t τ k ( t ) ) ( Θ ¯ ( k ) Γ k ) e ( t τ k ( t ) ) + k = 1 m c k e T ( t ) ( Θ ˜ ( k ) Θ ˜ ( k ) T Γ k Γ k T ) e ( t ) + k = 1 m c k ( α 1 + α 2 ) 2 e T ( t τ k ( t ) ) e ( t τ k ( t ) ) e T ( t ) [ I N ( 2 A + M A M A T + M B M B T + M D M D T + H A T H A + α B 2 B B T + α D 2 D D T + M 1 T M 1 + ( 2 α B + λ m a x ( H B T H B ) ) l h 2 I n ) + 2 k = 1 m c k α 1 ( Θ ¯ ( k ) Γ k ) + k = 1 m c k ( Θ ˜ ( k ) Θ ˜ ( k ) T Γ k Γ k T ) ] e ( t ) + e T ( t τ 0 ( t ) ) I N 2 α D + λ m a x ( H D T H D ) l f 2 I n + M 2 T M 2 e ( t τ 0 ( t ) ) + k = 1 m c k e T ( t τ k ( t ) ) 2 α 2 ( Θ ¯ ( k ) Γ k ) + I N ( α 1 + α 2 ) 2 I n e ( t τ k ( t ) ) .
Using conditions (i)–(iii) in Theorem 1, we obtain
E L V ( t ) η 0 E V ( t ) + β 0 E V ( t τ 0 ( t ) ) + k = 1 m c k β k E V ( t τ k ( t ) ) .
Next, our goal is to obtain the relation between V ( t σ + ) and V ( t σ ) such that the results conform to the structure of Lemma 2. When t = t σ , σ N , we can derive
V ( t σ + ) = i W ( t σ ) e i T ( t σ + ) e i ( t σ + ) + i W ( t σ + ) e i T ( t σ + ) e i ( t σ + ) = i W ( t σ ) ( 1 + ρ σ ) 2 e i T ( t σ ) e i ( t σ ) + i W ( t σ ) e i T ( t σ ) e i ( t σ ) .
First, we study the situation of ρ σ M . By obtaining μ ˇ σ = N + l ρ ˇ σ ( ρ ˇ σ + 2 ) N ( 0 , 1 ) , then one can gain
( N l ) ( 1 μ ˇ σ ) = [ μ ˇ σ ( 1 + ρ σ ) 2 ] l 0 .
Denote
Υ 1 ( t σ ) = min { e i ( t σ ) : i W ( t σ ) } , Υ 2 ( t σ ) = max { e i ( t σ ) : i W ( t σ ) } .
Hence, we can obtain
( 1 μ ˇ σ ) i W ( t σ ) e i T ( t σ ) e i ( t σ ) ( 1 μ ˇ σ ) ( N l ) Υ 2 2 ( t σ ) ( 1 μ ˇ σ ) ( N l ) Υ 1 2 ( t σ ) = [ μ ˇ σ ( 1 + ρ σ ) 2 ] l Υ 1 2 ( t σ ) [ μ ˇ σ ( 1 + ρ σ ) 2 ] i W ( t σ ) e i T ( t σ ) e i ( t σ ) .
From (19), one can future obtain the following inequality
i W ( t σ ) ( 1 + ρ σ ) 2 e i T ( t σ ) e i ( t σ ) + i W ( t σ ) e i T ( t σ ) e i ( t σ ) = i W ( t σ ) [ ( 1 + ρ σ ) 2 μ ˇ σ ] e i T ( t σ ) e i ( t σ ) + i W ( t σ ) μ ˇ σ e i T ( t σ ) e i ( t σ ) + i W ( t σ ) e i T ( t σ ) e i ( t σ ) ( μ ˇ σ 1 ) i W ( t σ ) e i T ( t σ ) e i ( t σ ) + i W ( t σ ) μ ˇ σ e i T ( t σ ) e i ( t σ ) + i W ( t σ ) e i T ( t σ ) e i ( t σ ) = μ ˇ σ i = 1 N e i T ( t σ ) e i ( t σ ) .
Combining (16) and (20) gives that V ( t σ + ) μ ˇ σ V ( t σ ) . Similarly, we study the case of ρ σ B . Obtaining μ ^ σ = N + l ρ ^ σ ( ρ ^ σ + 2 ) N ( 1 , + ) , we can then obtain
[ ( 1 + ρ σ ) 2 μ ^ σ ] l = ( μ ^ σ 1 ) ( N l ) 0 .
Denote
Υ 3 ( t σ ) = max { e i ( t σ ) : i W ( t σ ) } , Υ 4 ( t σ ) = min { e i ( t σ ) : i W ( t σ ) } .
Therefore, we can derive
[ ( 1 + ρ σ ) 2 μ ^ σ ] i W ( t σ ) e i T ( t σ ) e i ( t σ ) [ ( 1 + ρ σ ) 2 μ ^ σ ] l Υ 3 2 ( t σ ) [ ( 1 + ρ σ ) 2 μ ^ σ ] l Υ 4 2 ( t σ ) = ( μ ^ σ 1 ) ( N l ) Υ 4 2 ( t σ ) ( μ ^ σ 1 ) i W ( t σ ) e i T ( t σ ) e i ( t σ ) .
From (23), one can future obtain the following inequality:
i W ( t σ ) ( 1 + ρ σ ) 2 e i T ( t σ ) e i ( t σ ) + i W ( t σ ) e i T ( t σ ) e i ( t σ ) μ ^ σ i = 1 N e i T ( t σ ) e i ( t σ ) .
Combining (16) and (24) gives that V ( t σ + ) μ ^ σ V ( t σ ) . Thus, we can obtain E V ( t σ + ) μ σ E V ( t σ ) , where
μ σ = μ ˇ σ , if ρ σ M , μ ^ σ , if ρ σ B .
For any ϵ > 0 , set v ( t ) be the only solution for the differential systems below.
v ˙ ( t ) = η 0 v ( t ) + β 0 v ( t τ 0 ( t ) ) + k = 1 m c k β k v ( t τ k ( t ) ) + ϵ , t t σ , v ( t σ ) = μ σ v ( t σ ) , t = t σ , σ N + , v ( s ) = E i = 1 N ζ i ( s ) 2 , τ s 0 .
One can easily demonstrate that t [ t σ , t σ + 1 ) , D + E V ( t ) = E L V ( t ) . Based on Lemma 2, we can derive E V ( t ) v ( t ) for t 0 . Using the technology of parametric variation, we can obtain
v ( t ) = W ¯ ( t , 0 ) v ( 0 ) + 0 t W ¯ ( t , s ) [ β 0 v ( s τ 0 ( s ) ) + k = 1 m c k β k v ( s τ k ( s ) ) + ϵ ] d s ,
where W ¯ ( t , s ) ( t > s 0 ) stands for the Cauchy matrix of the equation below:
ϖ ˙ ( t ) = η 0 ϖ ( t ) , t t σ , σ N + , ϖ ( t σ ) = μ σ ϖ ( t σ ) , t = t σ , σ N + .
Let p = i = 1 q N ˇ i ( t , s ) + j = 1 r N ^ j ( t , s ) . Based on Definition 1, one can obtain
W ¯ ( t , s ) = e η 0 ( t s ) i = 1 q μ ˇ i N ˇ i ( t , s ) j = 1 r μ ^ j N ^ j ( t , s ) ( i = 1 q j = 1 r μ ˇ i 1 μ ^ j ) N 0 exp [ ( η 0 + i = 1 q l n μ ˇ i T ˇ i + j = 1 r l n μ ^ j T ^ j ) ( t s ) ] = κ e ξ ( t s )
where κ = ( i = 1 q j = 1 r μ ˇ i 1 μ ^ j ) N 0 , and ξ = ( η 0 + i = 1 q l n μ ˇ i T ˇ i + j = 1 r l n μ ^ j T ^ j ) .
Let ς = κ E i = 1 N sup τ s 0 { ζ i ( s ) 2 } , it follows from (27) that
v ( t ) ς e ξ t + 0 t κ e ξ ( t s ) [ β 0 v ( s τ 0 ( s ) ) + k = 1 m c k β k v ( s τ k ( s ) ) + ϵ ] d s , t 0 .
Let ϕ ( λ ) = λ ξ + κ [ β 0 e λ τ 0 + k = 1 m c k β k e λ τ k ] . Based on condition (iv), one has ϕ ( 0 ) = ξ + κ γ < 0 . It is clear that ϕ ( + ) = + and ϕ ˙ ( λ ) = 1 + κ [ β 0 τ 0 e λ τ 0 + k = 1 m c k β k τ k e λ τ k ] > 0 . Therefore, there exists a sole root λ > 0 satisfying the equation ϕ ( λ ) = λ ξ + κ [ β 0 e λ τ 0 + k = 1 m c k β k e λ τ k ] = 0 . Note condition (iv) and κ 1 , for τ t 0 , one has v ( t ) = E i = 1 N { ζ i ( t ) 2 } ς ς e λ t + κ ϵ ξ κ γ .
Next, we shall demonstrate the following inequality:
v ( t ) < ς e λ t + κ ϵ ξ κ γ , t 0 .
Assume that (31) does not hold; then there is a t > 0 satisfying
v ( t ) ς e λ t + C
and
v ( t ) < ς e λ t + C , t < t ,
where C = κ ϵ ξ κ γ .
Combining (30) and (33) gives
v ( t ) ς e ξ t + 0 t κ e ξ ( t s ) β 0 v ( s τ 0 ( s ) ) + k = 1 m c k β k v ( s τ k ( s ) ) + ϵ d s < e ξ t ς + C + 0 t κ e ξ s β 0 ( ς e λ ( s τ 1 ( s ) ) + C ) + k = 1 m c k β k ( ς e λ ( s τ k ( s ) ) + C ) d s = ς e λ t + C ,
which contradicts inequality (32). Hence, inequality (31) is correct. Let ϵ 0 , then v ( t ) < ς e λ t for t 0 . Noting that E V ( t ) v ( t ) , one can obtain E V ( t ) = E i = 1 N e i T ( t ) e i ( t ) ς e λ t . Since λ is a positive constant, the controlled multi-link networks (1) can achieve globally exponential synchronization. □
Remark 5.
The scale of the pinned node can be obtained from the equation W ( t σ ) = l . Since desynchronizing impulses and synchronizing impulses are introduced in the controller (3), the control scheme in this article can be called the hybrid impulsive pinning control.
Remark 6.
Discriminating from the existing works in multi-link systems [17,18,19,20,21,22,23,24], the impulse strength and position change with time evolution. The positive roles and negative roles of impulses are studied simultaneously. Moreover, stochastic noise, hybrid time-varying delays, and uncertainties are considered in this paper, making our results more generalized than related articles.
Remark 7.
In the existing literature, the range of impulsive effects is usually limited, such as μ ( 2 , 0 ) [38], μ ( 1 , 1 ) [8,39], μ ( 0 , 1 ) [40], which means only positive roles for the synchronization are considered. Unlike these methods, the impulsive gain in this article can be selected from μ ( , 2 ) ( 2 , 0 ) ( 0 , + ) , and not only positive roles but also negative roles are considered. Our impulsive pinning control strategy can effectively reduce the scale of control nodes and control time, thereby saving control costs.
When uncertain disturbances are not considered, dynamical networks (1) could be rewritten as
d z i ( t ) = [ A z i ( t ) + B h ( z i ( t ) ) + D f ( z i ( t τ 0 ( t ) ) ) + c 1 j = 1 N Θ i j ( 1 ) Γ 1 ψ 1 ( z j ( t τ 1 ( t ) ) ) + c 2 j = 1 N Θ i j ( 2 ) Γ 2 ψ 2 ( z j ( t τ 2 ( t ) ) ) + + c m j = 1 N Θ i j ( m ) Γ m ψ m ( z j ( t τ m ( t ) ) ) ] d t + g ( t , z i ( t ) , z i ( t τ 0 ( t ) ) ) d w ( t ) + u i ( t ) ,
where i = 1 , 2 , , N . Accordingly, the target trajectory s ( t ) = ( s 1 ( t ) , s 2 ( t ) , , s n ( t ) ) T satisfies
d s ( t ) = A s ( t ) + B h ( s ( t ) ) + D f ( s ( t τ 0 ( t ) ) ) d t + g ( t , s ( t ) , s ( t τ 0 ( t ) ) ) d w ( t ) .
Then, one can easily get a corollary below.
Corollary 1.
Assume that Assumptions 1, 3–5 hold. Under mean square sense, controlled multi-link networks (1) can be globally exponentially synchronized to the target s ( t ) :
E i = 1 N e i ( t ) 2 ς e λ t ,
if there exist positive scalars α B , α D , α 1 , α 2 , l h , l f , η 0 , β 0 and β k ( k = 1 , 2 , , m ) , such that the following inequalities hold:
(i) 
Ω 0 I N η 0 I n ,
(ii) 
Λ 0 I N β 0 I n ,
(iii) 
Λ k I N β k I n , k = 1 , 2 , , m ,
(iv) 
ξ κ γ > 0 ,
where ς = κ E i = 1 N sup τ s 0 { ζ i ( s ) 2 } , κ = ( i = 1 q j = 1 r μ ˇ i 1 μ ^ j ) N 0 , ξ = ( η 0 + i = 1 q l n μ ˇ i T ˇ i + j = 1 r l n μ ^ j T ^ j ) , μ ˇ i = N + l ρ i ( ρ i + 2 ) N ( 0 , 1 ) , μ ^ j = N + l ρ j ( ρ j + 2 ) N ( 1 , + ) , γ = β 0 + k = 1 m c k β k , Ω 0 = [ I N 2 A + α B 2 B B T + α D 2 D D T + M 1 T M 1 + 2 α B l h 2 I n + 2 k = 1 m c k α 1 ( Θ ¯ ( k ) Γ k ) + k = 1 m c k ( Θ ˜ ( k ) Θ ˜ ( k ) T Γ k Γ k T ) ] , Λ 0 = I N 2 α D l f 2 I n + M 2 T M 2 , Λ k = 2 α 2 ( Θ ¯ ( k ) Γ k ) + I N ( α 1 + α 2 ) 2 I n , and λ is a sole root of λ ξ + κ [ β 0 e λ τ 0 + k = 1 m c k β k e λ τ k ] = 0 .
When stochastic noise is not considered, dynamical networks (1) could be rewritten as
d z i ( t ) = [ ( A + Δ A ( t ) ) z i ( t ) + ( B + Δ B ( t ) ) h ( z i ( t ) ) + ( D + Δ D ( t ) ) f ( z i ( t τ 0 ( t ) ) ) + c 1 j = 1 N Θ i j ( 1 ) Γ 1 ψ 1 ( z j ( t τ 1 ( t ) ) ) + + c m j = 1 N Θ i j ( m ) Γ m ψ m ( z j ( t τ m ( t ) ) ) ] d t + u i ( t ) ,
where i = 1 , 2 , , N . Accordingly, the target trajectory s ( t ) = ( s 1 ( t ) , s 2 ( t ) , , s n ( t ) ) T satisfies
d s ( t ) = ( A + Δ A ( t ) ) s ( t ) + ( B + Δ B ( t ) ) h ( s ( t ) ) + ( D + Δ D ( t ) ) f ( s ( t τ 0 ( t ) ) ) d t .
Then, one can obtain the corollary below.
Corollary 2.
Assume that Assumptions 1–3, 5 hold. Under mean square sense, controlled multi-link networks (1) can be globally exponentially synchronized to the target s ( t ) :
E i = 1 N e i ( t ) 2 ς e λ t ,
if positive scalars α B , α D , α 1 , α 2 , l h , l f , η 0 , β 0 and β k ( k = 1 , 2 , , m ) exist, such that the following inequalities hold:
(i) 
Ω 0 I N η 0 I n ,
(ii) 
Λ 0 I N β 0 I n ,
(iii) 
Λ k I N β k I n , k = 1 , 2 , , m ,
(iv) 
ξ κ γ > 0 ,
where ς = κ E i = 1 N sup τ s 0 { ζ i ( s ) 2 } , κ = ( i = 1 q j = 1 r μ ˇ i 1 μ ^ j ) N 0 , ξ = ( η 0 + i = 1 q l n μ ˇ i T ˇ i + j = 1 r l n μ ^ j T ^ j ) , μ ˇ i = N + l ρ i ( ρ i + 2 ) N ( 0 , 1 ) , μ ^ j = N + l ρ j ( ρ j + 2 ) N ( 1 , + ) , γ = β 0 + k = 1 m c k β k , Ω 0 = [ I N ( 2 A + M A M A T + M B M B T + M D M D T + H A T H A + α B 2 B B T + α D 2 D D T + ( 2 α B + λ m a x ( H B T H B ) ) l h 2 I n ) + 2 k = 1 m c k α 1 ( Θ ¯ ( k ) Γ k ) + k = 1 m c k ( Θ ˜ ( k ) Θ ˜ ( k ) T Γ k Γ k T ) ] , Λ 0 = I N 2 α D + λ m a x ( H D T H D ) l f 2 I n , Λ k = 2 α 2 ( Θ ¯ ( k ) Γ k ) + I N ( α 1 + α 2 ) 2 I n , and λ is a sole root of λ ξ + κ [ β 0 e λ τ 0 + k = 1 m c k β k e λ τ k ] = 0 .

4. Numerical Simulations

To illustrate the theorem in this study from an experimental point of view, a numerical simulation will be implemented next. First, consider the following isolated node of the network incorporating stochastic noise, which can be formulated as
d s ( t ) = ( A + Δ A ( t ) ) s ( t ) + ( B + Δ B ( t ) ) h ( s ( t ) ) + ( D + Δ D ( t ) ) f ( s ( t τ 0 ( t ) ) ) d t + g ( t , s ( t ) , s ( t τ 0 ( t ) ) ) d w ( t ) ,
where s ( t ) = ( s 1 ( t ) , s 2 ( t ) ) T R 2 . The non-delayed activation function is h ( s ( t ) ) = ( cos ( s 1 ( t ) ) , cos ( s 2 ( t ) ) ) T R 2 , while the delayed activation function is f ( s ( t τ 0 ( t ) ) ) = ( cos ( s 1 ( t τ 0 ( t ) ) ) , cos ( s 2 ( t τ 0 ( t ) ) ) ) T R 2 . A simple calculation shows that Assumption 1 can be satisfied when l h = l f = 1 . Respectively, the diagonal matrix A and the connection weight matrices B , D are designated as
A = 15 0 0 15 , B = 2.0 0.1 5.0 3.0 , D = 0.2 10 0.2 5.0 .
The uncertainty matrices and relevant parameters corresponding to the above matrices could be set as
Δ A ( t ) = M A Λ ( t ) H A = 0.15 0 0 0.15 cos ( t ) 0 0 sin ( t ) cos ( t ) 0.35 0 0 0.35 ,
Δ B ( t ) = M B Λ ( t ) H B = 0.20 0 0 0.20 cos ( t ) 0 0 sin ( t ) cos ( t ) 0.30 0 0 0.30 ,
Δ D ( t ) = M D Λ ( t ) H D = 0.25 0 0 0.25 cos ( t ) 0 0 sin ( t ) cos ( t ) 0.05 0 0 0.05 .
One can find that the above uncertain matrices make Assumption 2 satisfied. The noise intensity function could be given by g ( t , s ( t ) , s ( t τ 0 ( t ) ) ) = 0.5 s ( t ) + 0.5 s ( t τ 0 ( t ) ) , which satisfies g ( t , 0 , 0 ) = 0 . Hence, Assumption 4 holds for M 1 = M 2 = 0.5 I 2 . The multi-link stochastic complex dynamical networks including 100 nodes are described as
d z i ( t ) = [ ( A + Δ A ( t ) ) z i ( t ) + ( B + Δ B ( t ) ) h ( z i ( t ) ) + ( D + Δ D ( t ) ) f ( z i ( t τ 0 ( t ) ) ) + k = 1 3 j = 1 100 c k Θ i j ( k ) Γ k ψ k ( z j ( t τ k ( t ) ) ) ] d t + g ( t , z i ( t ) , z i ( t τ 0 ( t ) ) ) d w ( t ) ,
where c k = 0.1 , Γ k = 0.1 I 2 , τ 1 ( t ) = 0.11 e t / ( 1 + e t ) , τ 2 ( t ) = 0.12 e t / ( 1 + e t ) , and τ 3 ( t ) = 0.13 e t / ( 1 + e t ) . The nonlinear coupling function is ψ k ( z j ( t τ k ( t ) ) ) = ( s i n ( z j 1 ( t τ k ( t ) ) ) , z j 2 ( t τ k ( t ) ) ) R 2 , α 1 = 0.5 , α 2 = 1.5 . One can find Assumption 3 holds based on the characteristic of ψ k ( . ) . Assume that the network topology of these sub-networks (i.e., Θ ( 1 ) , Θ ( 2 ) , and Θ ( 3 ) ) in systems (40) satisfying the E-R network model, and the connection probabilities are set as 0.2, 0.25, and 0.3, respectively. For simplicity, let T ˇ i = 0.001 , ρ ˇ i = 0.2 , T ^ j = 1 , ρ ^ i = 1.2 , α B = 1 , α D = 1 ; by simple calculation, we can obtain that ( η 0 + i = 1 q l n μ ˇ i T ˇ i + j = 1 r l n μ ^ j T ^ j ) = 9.1520 , β 0 + k = 1 m c k β k = 8.4975 . Hence, when we set N 0 = 0 , one can derive ξ κ γ > 0 , and all the circumstances in Theorem 1 are satisfied.
Utilizing the classical Runge-Kutta algorithm, Figure 2 shows the time evolutions of z i 1 ( t ) and z i 2 ( t ) in controlled multi-link complex networks (40) with random initial values. Figure 3 reveals that synchronization error e i ( t ) approaches zero rapidly as the system evolves. It is clear that the synchronization objective of multi-link system (40) can be achieved with a fast convergence under the hybrid impulsive pinning control technology, and the correctness of the theoretical analysis in this paper has been verified.

5. Conclusions

In this article, the mean square synchronization problem of uncertain multi-link stochastic dynamical networks incorporating hybrid time-varying delays has been investigated by pinning and controlling a small number of network nodes. Unlike the existing impulsive control, synchronization impulse and desynchronization impulse are considered at the same time, and the impulse strength and position change with time evolution. Combining coupling matrix decomposition technology and stability theory, some new synchronization criteria, which are bound up with the uncertain strengths, coupling strengths, hybrid impulse strengths, delay sizes, impulsive intervals, and network topologies, are derived to guarantee synchronization for the concerned multi-link model. Ultimately, a simulation experiment shows the rationality of our theory. In the future, we will continue to study how to apply the impulsive pinning control techniques in this article to the corresponding fractional-order multi-link delayed systems. Due to the nonlocality of fractional-order systems and the delay effect, maybe one can establish new fractional-order impulsive comparison principles to overcome this difficulty, which is challenging and meaningful work.

Author Contributions

Conceptualization, Y.T., J.Z. and H.F.; methodology, J.Z., H.F. and Y.R.; software, Y.T., Y.R. and J.T.; writing—original draft, Y.T., L.Z. and J.T.; and writing—review and editing, J.T., J.Z. and H.F. All authors have read and agreed to the published version of the manuscript.

Funding

This work was supported by the Industry-University Cooperation and Education Projects of the Ministry of Education under Grant (202101127002, 202102015028); the Open Foundation of Engineering Research Center of Big Data Application in Private Health Medicine, Fujian Province University (MKF202201); and the Doctor Foundation of Gannan Normal University (BSJJ202261).

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Shi, K.B.; Wang, J.; Zhong, S.M.; Tang, Y.Y.; Cheng, J. Non-fragile memory filtering of T-S fuzzy delayed neural networks based on switched fuzzy sampled-data control. Fuzzy Sets Syst. 2020, 394, 40–64. [Google Scholar] [CrossRef]
  2. Tang, Z.; Park, J.H. Topology and parameters recognition of uncertain complex dynamical via nonidentical adaptive synchronization. Nonlinear Dyn. 2016, 85, 2171–2181. [Google Scholar] [CrossRef]
  3. Wei, H.; Zhu, Q.X.; Hamidreza, K. Some improved Razumikhin stability criteria for impulsive stochastic delay differential systems. IEEE Trans. Autom. Control 2019, 64, 5207–5213. [Google Scholar]
  4. Wei, H.; Zhu, Q.X. Stability criteria for impulsive stochastic functional differential systems with distributed-delay dependent impulsive effects. IEEE Trans. Syst. Man Cybern. Syst. 2021, 51, 2027–2032. [Google Scholar]
  5. Fu, X.Z.; Zhu, Q.X. Stability of nonlinear impulsive stochastic systems with Markovian switching under generalized average dwell time condition. Sci. China Inf. Sci. 2018, 61, 112211. [Google Scholar] [CrossRef]
  6. Rao, R.F.; Lin, Z.; Ai, X.Q.; Wu, J.R. Synchronization of epidemic systems with Neumann boundary value under delayed impulse. Mathematics 2022, 10, 2064. [Google Scholar] [CrossRef]
  7. Yi, C.B.; Feng, J.W.; Wang, J.Y.; Xu, C.; Zhao, Y. Synchronization of delayed neural networks with hybrid coupling via partial mixed pinning impulsive control. Appl. Math. Comput. 2017, 312, 78–90. [Google Scholar] [CrossRef]
  8. Fan, H.G.; Shi, K.B.; Zhao, Y. Pinning impulsive cluster synchronization of uncertain complex dynamical networks with multiple time-varying delays and impulsive effects. Phys. A Stat. Mech. Appl. 2022, 587, 126534. [Google Scholar] [CrossRef]
  9. Wang, J.Y.; Feng, J.W.; Xu, C.; Zhao, Y. Cluster synchronization of nonlinearly-coupled complex networks with nonidentical nodes and asymmetrical coupling matrix. Nonlinear Dyn. 2012, 67, 1635–1646. [Google Scholar] [CrossRef]
  10. Wang, F.; Zheng, Z.W.; Yang, Y.Q. Quasi-synchronization of heterogenous fractional-order dynamical networks with time-varying delay via distributed impulsive control. Chaos Solitons Fractals 2021, 142, 110465. [Google Scholar] [CrossRef]
  11. Wang, F.; Zheng, Z.W. Quasi-projective synchronization of fractional order chaotic systems under input saturation. Phys. A Stat. Mech. Appl. 2019, 534, 122132. [Google Scholar] [CrossRef]
  12. Gu, Y.J.; Yu, Y.G.; Wang, H. Projective synchronization for fractional-order memristor-based neural networks with time delays. Neural Comput. Appl. 2019, 31, 6039–6054. [Google Scholar] [CrossRef]
  13. Wang, F.; Yang, Y.Q.; Hu, M.F.; Xu, X.Y. Projective cluster synchronization of fractional-order coupled-delay complex network via adaptive pinning control. Phys. A Stat. Mech. Appl. 2015, 434, 134–143. [Google Scholar] [CrossRef]
  14. He, W.L.; Cao, J.D. Exponential synchronization of hybrid coupled networks with delayed coupling. IEEE Trans. Neural Netw. 2010, 21, 571–583. [Google Scholar] [PubMed]
  15. Li, G.D.; Zhang, Y.; Guan, Y.J.; Li, W.J. Stability analysis of multi-point boundary conditions for fractional differential equation with non-instantaneous integral impulse. Math. Biosci. Eng. 2023, 20, 7020–7041. [Google Scholar] [CrossRef]
  16. Cai, S.M.; He, Q.B.; Hao, J.J.; Liu, Z.R. Exponential synchronization of complex networks with nonidentical time-delayed dynamical nodes. Phys. Lett. A 2010, 374, 2539–2550. [Google Scholar] [CrossRef]
  17. Zhou, H.; Ma, S.Y.; Li, W.X. Actuator saturating intermittent control for synchronization of stochastic multi-links network with sampled-data. Neurocomputing 2021, 465, 167–183. [Google Scholar] [CrossRef]
  18. Guo, Y.; Chen, B.D.; Wu, Y.B. Finite-time synchronization of stochastic multi-links dynamical networks with Markovian switching topologies. J. Frankl. Inst. 2020, 357, 359–384. [Google Scholar] [CrossRef]
  19. Xu, Y.; Li, Y.Z.; Li, W.X.; Feng, J.Q. Synchronization of multi-links impulsive fractional-order complex networks via feedback control based on discrete-time state observations. Neurocomputing 2020, 406, 224–233. [Google Scholar] [CrossRef]
  20. Sun, Y.Q.; Wu, H.Y.; Chen, Z.H.; Zheng, X.J.; Chen, Y. Outer synchronization of two different multi-links complex networks by chattering-free control. Phys. A Stat. Mech. Appl. 2021, 584, 126354. [Google Scholar] [CrossRef]
  21. Qin, X.L.; Wang, C.; Li, L.X.; Peng, H.P.; Yang, Y.X.; Ye, L. Finite-time modified projective synchronization of memristor-based neural network with multi-links and leakage delay. Chaos Solitons Fractals 2018, 116, 302–315. [Google Scholar] [CrossRef]
  22. Zhou, L.L.; Tan, F.; Yu, F.; Liu, W. Cluster synchronization of two-layer nonlinearly coupled multiplex networks with multi-links and time-delays. Neurocomputing 2019, 359, 264–275. [Google Scholar] [CrossRef]
  23. Zheng, M.W.; Li, L.X.; Peng, H.P.; Xiao, J.H.; Yang, Y.X.; Zhang, Y.P.; Zhao, H. General decay synchronization of complex multi-links time-varying dynamic network. Commun. Nonlinear Sci. Numer. Simul. 2019, 67, 108–123. [Google Scholar] [CrossRef]
  24. Li, S.; Li, Y.X.; Ding, X.H. More general results of aperiodically intermittent synchronization for stochastic Markovian switching complex networks with multi-links and time-varying coupling structure. Neurocomputing 2020, 395, 39–55. [Google Scholar] [CrossRef]
  25. Wang, P.F.; Li, S.Y.; Su, H. Stabilization of complex-valued stochastic functional differential systems on networks via impulsive control. Chaos Solitons Fractals 2020, 133, 109561. [Google Scholar] [CrossRef]
  26. Zhou, H.; Li, W.X. Synchronisation of stochastic-coupled intermittent control systems with delays and Lévy noise on networks without strong connectedness. IET Control Theory Appl. 2019, 13, 36–49. [Google Scholar] [CrossRef]
  27. Shi, K.B.; Wang, J.; Zhong, S.M.; Tang, Y.Y.; Cheng, J. Hybrid-driven finite-time H sampling synchronization control for coupling memory complex networks with stochastic cyber attacks. Neurocomputing 2020, 387, 241–254. [Google Scholar] [CrossRef]
  28. Zhang, L.; Yang, X.S.; Xu, C.; Feng, J.W. Exponential synchronization of complex-valued complex networks with time-varying delays and stochastic perturbations via time-delayed impulsive control. Appl. Math. Comput. 2017, 306, 22–30. [Google Scholar] [CrossRef]
  29. Liu, Y.; Wang, M.; Chu, D.H.; Su, H. Feedback control based on discrete-time state observations on synchronization of stochastic impulsive coupled systems. Nonlinear Anal. Hybrid Syst. 2021, 39, 100987. [Google Scholar] [CrossRef]
  30. Zhao, H.; Li, L.X.; Peng, H.P.; Xiao, J.H.; Yang, Y.X. Mean square modified function projective synchronization of uncertain complex network with multi-links and stochastic perturbations. Eur. Phys. J. 2015, 88, 1–8. [Google Scholar] [CrossRef]
  31. Tang, Z.; Park, J.H.; Feng, J.W. Novel approaches to pin cluster synchronization on complex dynamical networks in Lur’e forms. Commun. Nonlinear Sci. Numer. Simul. 2018, 57, 422–438. [Google Scholar] [CrossRef]
  32. Liang, S.; Wu, R.C.; Chen, L.P. Adaptive pinning synchronization in fractional-order uncertain complex dynamical networks with delay. Phys. A Stat. Mech. Appl. 2016, 444, 49–62. [Google Scholar] [CrossRef]
  33. Ding, S.B.; Wang, Z.S. Synchronization of coupled neural networks via an event-dependent intermittent pinning control. IEEE Trans. Syst. Man Cybern. Syst. 2022, 52, 1928–1934. [Google Scholar] [CrossRef]
  34. Peng, D.X.; Li, X.D. Leader-following synchronization of complex dynamic networks via event-triggered impulsive control. Neurocomputing 2020, 412, 1–10. [Google Scholar] [CrossRef]
  35. Xia, M.L.; Liu, L.N.; Fang, J.Y.; Zhang, Y.C. Stability analysis for a class of stochastic differential equations with impulses. Mathematics 2023, 11, 1541. [Google Scholar] [CrossRef]
  36. Tang, Z.; Park, J.H.; Wang, Y.; Feng, J.W. Impulsive synchronization of derivative coupled neural networks with cluster-tree topology. IEEE Trans. Netw. Sci. Eng. 2020, 11, 1541. [Google Scholar] [CrossRef]
  37. Fan, H.G.; Shi, K.B.; Zhao, Y. Global μ-synchronization for nonlinear complex networks with unbounded multiple time delays and uncertainties via impulsive control. Phys. A Stat. Mech. Appl. 2022, 599, 127484. [Google Scholar] [CrossRef]
  38. Lu, J.Q.; Kurths, J.; Cao, J.D.; Mahdavi, N.; Huang, C. Synchronization control for nonlinear stochastic dynamical networks: Pinning impulsive strategy. IEEE Trans. Neural Netw. Learn. Syst. 2012, 23, 285–292. [Google Scholar]
  39. Zhao, Y.Q.; Wang, L.S. Practical exponential stability of impulsive stochastic food chain system with time-varying delays. Mathematics 2023, 11, 147. [Google Scholar] [CrossRef]
  40. He, W.L.; Qian, F.; Cao, J.D.; Han, Q.L. Impulsive synchronization of two nonidentical chaotic systems with time-varying delay. Phys. Lett. A 2011, 375, 498–504. [Google Scholar] [CrossRef]
  41. Cai, S.M.; Zhou, P.P.; Liu, Z.R. Synchronization analysis of hybrid-coupled delayed dynamical networks with impulsive effects: A unified synchronization criterion. J. Frankl. Inst. 2015, 352, 2065–2089. [Google Scholar] [CrossRef]
  42. Yang, Z.C.; Xu, D.Y. Stability analysis and design of impulsive control systems with time delay. IEEE Trans. Autom. Control 2007, 52, 1448–1454. [Google Scholar] [CrossRef]
Figure 1. (A) Complete transportation network; (A1) aviation network; (A2) land network; and (A3) waterway network.
Figure 1. (A) Complete transportation network; (A1) aviation network; (A2) land network; and (A3) waterway network.
Mathematics 11 01697 g001
Figure 2. Time evolution of z i ( t ) in multi-link complex networks (40) under the hybrid impulsive pinning control. (a) z i 1 ( t ) ; (b) z i 2 ( t ) .
Figure 2. Time evolution of z i ( t ) in multi-link complex networks (40) under the hybrid impulsive pinning control. (a) z i 1 ( t ) ; (b) z i 2 ( t ) .
Mathematics 11 01697 g002
Figure 3. The state of synchronization errors in multi-link complex networks (40) under the hybrid impulsive pinning control. (a) e i 1 ( t ) ; (b) e i 2 ( t ) .
Figure 3. The state of synchronization errors in multi-link complex networks (40) under the hybrid impulsive pinning control. (a) e i 1 ( t ) ; (b) e i 2 ( t ) .
Mathematics 11 01697 g003aMathematics 11 01697 g003b
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

Tang, Y.; Zhou, L.; Tang, J.; Rao, Y.; Fan, H.; Zhu, J. Hybrid Impulsive Pinning Control for Mean Square Synchronization of Uncertain Multi-Link Complex Networks with Stochastic Characteristics and Hybrid Delays. Mathematics 2023, 11, 1697. https://doi.org/10.3390/math11071697

AMA Style

Tang Y, Zhou L, Tang J, Rao Y, Fan H, Zhu J. Hybrid Impulsive Pinning Control for Mean Square Synchronization of Uncertain Multi-Link Complex Networks with Stochastic Characteristics and Hybrid Delays. Mathematics. 2023; 11(7):1697. https://doi.org/10.3390/math11071697

Chicago/Turabian Style

Tang, Yong, Lang Zhou, Jiahui Tang, Yue Rao, Hongguang Fan, and Jihong Zhu. 2023. "Hybrid Impulsive Pinning Control for Mean Square Synchronization of Uncertain Multi-Link Complex Networks with Stochastic Characteristics and Hybrid Delays" Mathematics 11, no. 7: 1697. https://doi.org/10.3390/math11071697

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