Preprint
Article

Finite Time Hybrid Synchronization Control for Duplex Complex Networks via Intermittent Control

Altmetrics

Downloads

43

Views

23

Comments

12

This version is not peer-reviewed

Submitted:

01 October 2024

Posted:

02 October 2024

You are already at the latest version

Alerts
Abstract
This paper is devoted to the finite time internal and the external synchronization (hybrid synchronization) for complex networks by means of intermittent control. Different from most previous research achievements, the finite time synchronization include internal and the external synchronization, this article employs the intermittent control to drive the complex networks to achieve synchronization in finite time. To be specific, the internal and the external synchronization all achieve consistent synchronization in finite time by devise Lyapunov function. Finally, numerical examples are presented to illustrate the validness of theoretical results.
Keywords: 
Subject: Computer Science and Mathematics  -   Other

1. Introduction

Complex networks exists in nature and society widely, in the past decades, complex networks have attracted extensive attention in the system science, the complex networks are divided into various types, such as social networks [1], communication networks [2], neural networks [3], and epidemic spreading networks [4] and so on. The synchronization is one of the most important collective behaviors of complex networks, which has always been a hot issue in the research of complex networks [5,6,7]. To sum up, the synchronization of complex networks is divided in two types: the internal synchronization (synchronization between network and node) and the external synchronization (synchronization between two complex networks). Therefore, in order to achieve synchronization, the controllers have to add to networks. Many effective control methods have been developed for synchronization of complex networks [8,9,10]. These methods can be divided into continuous controls and discontinuous controls based on the controllers work continuously or not. A typical way of discontinuous control is the intermittent control, which the working hours are discontinuous, the control is only active in the work time. The intermittent controls is better than continuous controls, the synchronization have been addressed via intermittent control. For example, in [11], the coupled network is synchronized by aperiodically intermittent controllers with adaptive strategy. In [12,13], outer synchronization of complex networks is investigated via periodically and aperiodically intermittent control, respectively.
The synchronization time is divided into infinite time and finite time. However, in reality, the networks should achieve synchronization as quickly as possible, finite time has better application prospects than infinite time, particularly in many engineering fields. To achieve faster synchronization of networks, finite time control technique is applied in [14]. Combining with the intermittent control scheme, finite time synchronization, whose convergence time can be predicted, has been studied in [15,16,17]. It is well known that many real complex networks, including transportation networks, social network and ecological network, where networks interact with other networks. Therefore, the different part of networks have different property, which lead to the different part of networks with different synchronization types [18,19,20].
However, to the best of our knowledge, there are no results on the finite time internal and the external synchronization for duplex complex networks by intermittent control. More studies are expected to study the variety of finite time synchronization of duplex complex networks by intermittent control. Motivated by the above discussions, this paper investigates the finite time internal and the external synchronization problem for duplex complex networks via intermittent control. The internal and the external synchronization can be synchronized simultaneously in finite time.

2. Network Model and Preliminaries

Assumption 1 [3]. The time-varying delay τ ( t ) is a function which satisfies 0 τ ( t ) μ , maximum μ = 1 in this paper. Derivative of the delay τ ( t ) exists, and τ ( t ) less than 1, which can also be written as 0 τ ˙ ( t ) ξ < 1 .
Due to diversity of network, the different parts of the duplex network have different types of synchronization, the synchronization is mainly divided into two kinds: the internal and the external synchronization. Internal synchronization means that all nodes in the network are consistent with a certain node, external synchronization means that the node states of two or more complex networks are progressively consistent.
Consider a duplex complex networks (1)-(2) and a nonlinear dynamics mathematical model (3) can be expressed as:
  x ˙ i ( t ) = A ˜ x i ( t ) + B ˜ f ( x i ( t τ 1 ( t ) ) + j = 1 N c i j 1 g ( x j ( t ) ) + j = 1 N d i j 1 h ( x j ( t τ 2 ( t ) ) + u i n ( t ) + u o u t ( t ) ,   ( 1 ) y ˙ i ( t ) = A ˜ y i ( t ) + B ˜ f ( y i ( t τ 1 ( t ) ) + j = 1 N c i j 2 g ( y j ( t ) ) + j = 1 N d i j 2 h ( x j ( t τ 2 ( t ) ) ,   ( 2 ) s ˙ ( t ) = z ˜ ( s ( t ) ) ,   ( 3 )  
where x i ( t ) = ( x i 1 ( t ) , x i 2 ( t ) , , x i n ( t ) ) T R n is the state variables of the ith node in complex network (1), f : R n R n is the continuously vector function which explain the dynamical equation of the ith node, the τ 1 ( t ) > 0 and τ 2 ( t ) > 0 are coupling time-varying delay. The g : R n R n and h : R n R n are couple functons. G = ( g i j ) R N × N is the coupling matrix, g i j > 0 if there is connection between the ith node and the jth node, otherwise g i j = g j i = 0 y i ( t ) = ( y i 1 ( t ) , y i 2 ( t ) , , y i n ( t ) ) T R n is the state variables of the ith node in complex network (3). g ( ) R n and h ( ) R n are the nonlinear coupling functions. A ˜ = A + Δ A ( t ) R n × n , B ˜ = B + Δ B ( t ) R n × n and Z ˜ = Z + Δ Z ( t ) R n × n stand for the parametric uncertainties. For k = 1 , 2 , C k R N × N and D k R N × N are the coupling configuration matrices which reflect the fundamental topology structure of network. If there is a connection between node i and node j ( i j ) , then c i j k > 0   and   d i j k > 0 ; otherwise, c i j k = 0 and d i j k = 0 . The diagonal elements of matrix C k and D k can be represented as c i i k = j = 1 , j i N c i j k and d i i k = j = 1 , j i N d i j k , respectively. s ( t ) R n is equinoctial point, or chaotic attractors, or a periodic orbit. The u i n ( t ) R n   and   u o u t ( t ) R n are intermittent controllers to be designed. The u i n ( t ) is the internal synchronization controller which control node 1 to d, the u o u t ( t ) is the external synchronization controller which control node d + 1 to N. Furthermore, C k and   D k are not necessarily assumed to be symmetric.
Definition 1. The hybrid synchronization error is defined as follows,
e ( t ) = e i n ( t ) + e o u t ( t ) ,
where e i n ( t ) is the internal synchronization error, one has,
e i n ( t ) = x i ( t ) s ( t τ ( t ) ) , i = 1 , 2 , , d , where τ ( t ) > 0 is time-varying delay, x i ( t ) R n is a state variable of complex networks (1), s ( t ) is a state variable of system (2). The e o u t ( t ) is the external synchronization error. Defined,
e o u t ( t ) = x j ( t ) y j ( t τ ( t ) ) , j = d + 1 , d + 2 , , N , where nodes 1 to d implement internal synchronization, the nodes d + 1 to N implement external synchronization.
Definition 1: Hybrid synchronization is achieved if there exists a setting time T such that,
lim t T e ( t ) = lim t T e i n ( t ) + lim t T e o u t ( t ) = lim t T e i n ( t ) + e o u t ( t ) = lim t T x i ( t ) s ( t τ ( t ) ) + x j ( t ) y j ( t τ ( t ) ) = 0 .
Lemma1 [5]: Assuming that a continuous positive definite function V ( t ) satisfying,
V ˙ ( t ) ω V r ( t ) , t t 0 , V ( t 0 ) 0 ,
where ω > 0 , 0 < r < 1 , V ( t ) 0 for all t T ( x 0 ) , the settling time T ( x 0 ) V 1 r ( x 0 ) ω ( 1 r ) .
Definition 2: Given θ R n , r > 0 . Then, one has
s i g n ( θ ) = d i a g ( s i g n ( θ 1 ) , s i g n ( θ 2 ) , , s i g n ( θ n ) ) , | θ | r = | θ 1 | r , | θ 2 | r , , | θ n | r T .
Assumption 1: The τ 1 ( t ) and τ 2 ( t ) represent two time-varying delay, which are bounded differential functions, one has   0 τ 1 ( t ) τ 1 * , 0 τ 2 ( t ) τ 2 * , τ ˙ 1 ( t ) γ < 1 , τ ˙ 2 ( t ) γ < 1 for all t , where τ 1 * , τ 2 *   and γ are positive constants.
Assumption 2: The j ( ) , r ( ) and h ( ) represent three Lipschitz functions, i.e., there exists positive constants L j , L r , L h such that for all μ , ν R n , one has,
j ( μ ) j ( ν ) L j μ ν , r ( μ ) r ( ν ) L r μ ν , h ( μ ) h ( ν ) L h μ ν ,
Assumption 3: Given uncertain parameter matrices Δ A ( t ) and Δ B ( t ) satisfying,
[ Δ A ( t ) , Δ B ( t ) ] = M F ( t ) [ N 1 , N 2 ] ,
where M , N 1 N 2 are known real matrices, F t is a unknown time-varying real matrix, which satisfying F T ( t ) F ( t ) I .
Lemma 1 [5]: Given X and Y are two real matrices, then X T Y + Y T X ζ X T X + 1 ζ Y T Y holds for any ζ > 0 .

3. Main Results

In this section, we establish the finite time intermittent control scheme for hybrid synchronization. According to system (1)-(3), the error state equations can be expressed in the compact form,
e ˙ ( t ) = ( I d A ˜ ) e i n ( t ) + ( I d B ˜ ) F ( e i n ( τ 1 ) ) + ( C I d ) G ( e i n ( t ) ) + ( D I d ) H ( e i n ( τ 2 ) ) + u i n ( t ) + A ˜ e o u t ( t ) + ( I N d B ˜ ) F ( e o u t ( τ 1 ) ) + I N d G ( e o u t ( t ) ) + ( D I N d ) H ( e o u t ( τ 2 ) ) + u o u t ( t ) , (4)
where
Preprints 119894 i001
The intermittent controllers is designed as
Preprints 119894 i002
where ξ > 0 , η 1 > 0 , η 2 > 0 , η 3 > 0 and η 4 > 0 are the control strengths. α > 0 , λ > 0 , 0 σ < 1 and 0 μ < 1 are tunable constants. V i n ( t ) and V o u t ( t ) are two given Lyapunov functions, V i n i ( t ) and V o u t j ( t ) are two nonnegative continuous functions to be designed. t indicates the previous instant of time t . From (4), it is easy to see that the work time of controller u 1 ( t ) and u 2 ( t ) are decided by the time-varying relation among V ( t ) , V i n i ( t ) and V o u t j ( t ) . For brevity, take β = 1 + σ 2 , χ = μ 3 , one has,
V i n i ( t ) = ( k V ( t 0 ) ) 1 β α i ( 1 β ) ( t t 0 ) 1 1 β , i = 1 , 2 , V o u t j ( t ) = ( ϑ V ( t 0 ) ) 1 χ λ j χ ( t t 0 ) 1 χ , j = 1 , 2 ,
where α i , λ i , k and ϑ are positive scalars, α > α 1 > α 2 , λ > λ 1 > λ 2 and 0 < k < 1 , 0 < ϑ < 1 , respectively.
Based on the relation among V i n ( t ) , V o u t ( t ) , V i n i ( t ) and V o u t j ( t ) , the intermittent control process are as follows:
1. If V i n ( t ) V i n 1 ( t )   and   V o u t ( t ) V o u t 1 ( t )
, then the controllers u i n ( t ) = u 1 ( t ) and u o u t ( t ) = u 2 ( t ) are actived at instant t and continuously working.
2. If V i n 2 ( t ) V i n ( t ) V i n 1 ( t )   and   V o u t 2 ( t ) V o u t ( t ) V o u t 1 ( t )
and the controllers u i n ( t ) = u 1 ( t ) and u o u t ( t ) = u 2 ( t ) are working at the instant t , then the controllers u i n ( t ) = u 1 ( t ) and u o u t ( t ) = u 2 ( t ) are continuously working after the time t .
3. If V i n 2 ( t ) V i n ( t ) V i n 1 ( t )   and   V o u t 2 ( t ) V o u t ( t ) V o u t 1 ( t )
and the controller u i n ( t ) = 0 and u o u t ( t ) = 0 are working at the instant t , then the controller u i n ( t ) = 0 and u o u t ( t ) = 0 are continuously working after the time t .
4. If V i n ( t ) V i n 2 ( t )   and   V o u t ( t ) V o u t 2 ( t )
, then the controller u i n ( t ) = 0 and u o u t ( t ) = 0 are actived at instant t and continuously working.
Remark 1: The two controllers u i n ( t ) and u o u t ( t ) can achieve finite time hybrid synchronization in the whole network, or the controller u i n ( t ) achieve internal synchronization in finite time and controller u o u t ( t ) achieve external synchronization in finite time. This paper focuses on finite time hybrid synchronization in the whole network. The finite time synchronization criterion with the Lyapunov function V i n ( t ) and V o u t ( t ) are designed as follows:
V i n ( t ) = e i n T ( t ) e ( t ) + η 1 1 γ t τ 1 ( t ) t e i n T ( s ) e i n ( s ) d s + η 1 1 γ t τ 2 ( t ) t e i n T ( s ) e ( s ) d s , V o u t ( t ) = η 3 1 φ t τ 1 ( t ) t e o u t T ( s ) e o u t ( s ) d s + η 4 1 φ t τ 2 ( t ) t e o u t T ( s ) e o u t ( s ) d s .
Therefore, the finite time synchronization criterion is given.
Theorem 1: Supposing that Assumptions 1-3 hold, there exist tunable positive constants ξ , η 1 , η 2 and any positive constants s 1 , , s 5 such that,
( a ) .   Δ 0 , ( b ) .   s 2 1 L j 2 + s 3 1 L j 2 λ m a x ( N 2 T N 2 ) s 1 1 L j 2 + η 1 + η 3 0 , ( c ) .   s 5 1 L h 2 η 2 η 2 + η 4 0 ,
where Δ = λ m a x ( A s ) + s 1 λ m a x ( M M T ) + s 4 1 L r 2 + s 3 L r 2 + s 1 L r 2 s 1 1 λ m a x ( N 1 T N 1 ) + s 2 λ m a x ( B B T ) + s 4 λ m a x ( C C T ) + s 5 λ m a x ( D D T ) + η 1 + η 2 + η 3 1 γ ξ . Then the networks (1)-(3) with the intermittent control scheme (4) and (5) will be synchronized in a finite time T , and T < T 1 = ( ϑ V o u t ( t 0 ) ) χ λ 2 χ + t 0 .
Proof: Differentiating V i n ( t ) and V o u t ( t ) along the solution of error system (3), one has
V ˙ i n ( t ) 2 e i n T ( t ) e ˙ i n ( t ) + η 1 1 γ e i n T ( t ) e i n T ( t ) η 1 e i n T ( τ 1 ) e i n ( τ 1 ) + η 2 1 γ e i n T ( t ) e i n ( t ) η 2 e i n T ( τ 2 ) e i n ( τ 2 ) . V ˙ o u t ( t ) η 3 1 φ e o u t T ( t ) e o u t T ( t ) η 3 e o u t T ( τ 1 ) e o u t ( τ 1 ) + η 4 1 φ e o u t T ( t ) e o u t ( t ) η 4 e o u t T ( τ 2 ) e o u t ( τ 2 ) . Based on the error equation (3) and the control scheme (4) and (5), one has
2 e T ( t ) e ˙ ( t ) = 2 e i n T ( t ) ( I N A ˜ ) e i n ( t ) + 2 e i n T ( t ) ( I N B ˜ ) F ( e i n ( τ 1 ) ) + 2 e i n T ( t ) ( C I n ) G ( e i n ( t ) ) + 2 e i n T ( t ) ( D I n ) H ( e i n ( τ 2 ) ) 2 ξ e i n T ( t ) e i n ( t ) α e i n T ( t ) s i g n ( e i n ( t ) ) | e i n ( t ) | σ α η 1 1 γ t τ 1 ( t ) t e i n T ( s ) e i n ( s ) d s 1 + σ 2 α ( η 2 1 γ t τ 2 ( t ) t e i n T ( s ) e i n ( s ) d s ) 1 + σ 2 λ η 3 1 γ t τ 1 ( t ) t e o u t T ( s ) e o u t ( s ) d s μ 2 λ ( η 4 1 γ t τ 2 ( t ) t e o u t T ( s ) e o u t ( s ) d s ) μ 2 . Furthermore, by Lemma1, one has
2 e i n T ( t ) ( I N A ˜ ) e i n ( t ) + 2 e i n T ( t ) ( I N B ˜ ) F ( e i n ( τ 1 ) ) 2 e i n T ( t ) ( I N A ) e i n ( t ) + s 1 e i n T ( t ) ( I N M M T ) e i n T ( t ) + s 1 1 e i n T ( t ) ( I N N 1 T N 1 ) e i n T ( t ) + s 2 e i n T ( t ) ( I N B B T ) e i n T ( t ) + s 2 1 F T ( e o u t ( τ 1 ) ) F ( e o u t ( τ 1 ) ) + s 3 e i n T ( t ) ( I N M M T ) e i n T ( t ) + s 3 1 F T ( e o u t ( τ 1 ) ) ( I N N 2 T N 2 ) F ( e o u t ( τ 1 ) ) 2 λ m a x ( A s ) + s 1 λ m a x ( M M T ) + s 1 1 λ m a x ( N 1 T N 1 ) + s 2 λ m a x ( B B T ) + s 3 λ m a x ( M M T ) ) e i n T ( t ) e i n ( t ) + s 2 1 L j 2 + s 3 1 L j 2 λ m a x ( N 2 T N 2 ) e o u t T ( τ 1 ) e o u t ( τ 1 ) .
Similarly, we have the estimation for another term,
2 e i n T ( t ) ( C I n ) G ( e ( t ) ) + 2 e i n T ( t ) ( D I n ) H ( e i n T ( τ 2 ) ) s 4 e i n T ( t ) ( C C T I n ) e i n T ( t ) + s 4 1 G T ( e i n ( t ) ) G ( e i n ( t ) ) s 5 e i n T ( t ) ( D D T I n ) e i n ( t ) + s 5 1 H T ( e o u t ( τ 2 ) ) H ( e o u t ( τ 2 ) ) ( s 4 λ m a x ( C C T ) + s 4 1 L r 2 + s 5 λ m a x ( D D T ) ) e i n T ( t ) e i n ( t ) + s 5 1 L h 2 e o u t T ( τ 2 ) e o u t ( τ 2 ) + s 3 1 L r 2 + s 5 1 L r 2 . Base on Definition 2 and Lemma 2 that, one can get α e T ( t ) s i g n ( e ( t ) ) | e ( t ) | σ = α | e T ( t ) | | e ( t ) | σ α ( e T ( t ) e ( t ) ) 1 + σ 2 .
Together with (6) and (7), one has
V ˙ i n ( t ) Ψ e i n T ( t ) e i n ( t ) + ( s 5 1 L h 2 η 2 ) e i n T ( τ 2 ) e i n ( τ 2 ) + s 2 1 L j 2 + s 3 1 L j 2 λ m a x ( N 2 T N 2 ) η 1 e i n T ( τ 1 ) e i n ( τ 1 ) α e i n T ( t ) e i n ( t ) 1 + σ 2 α η 1 1 γ t τ 1 ( t ) t e i n T ( s ) e i n ( s ) d s 1 + σ 2 α η 2 1 γ t τ 2 ( t ) t e i n T ( s ) e i n ( s ) d s 1 + σ 2 , V ˙ o u t ( t ) ( s 5 1 η 3 ) e o u t T ( τ 2 ) e o u t ( τ 2 ) + s 3 1 L j 2 λ m a x ( N 2 T N 2 ) η 3 e o u t T ( τ 1 ) e o u t ( τ 1 ) λ e o u t T ( t ) e o u t ( t ) μ 2 λ η 3 1 φ t τ 1 ( t ) t e o u t T ( s ) e o u t ( s ) d s μ 2 λ η 4 1 φ t τ 2 ( t ) t e o u t T ( s ) e o u t ( s ) d s μ 2 . From Lemma 2, one has V ˙ i n ( t ) α e i n T ( t ) e i n ( t ) 1 + σ 2 α η 1 1 γ t τ 1 ( t ) t e i n T ( s ) e i n ( s ) d s 1 + σ 2 η 1 1 γ t τ 1 ( t ) t e i n T ( s ) e i n ( s ) d s 1 + σ 2 α η 2 1 γ t τ 2 ( t ) t e i n T ( s ) e i n ( s ) d s 1 + σ 2 α V i n β ( t ) . V ˙ o u t ( t ) ( s 5 1 η 3 ) e o u t T ( τ 2 ) e o u t ( τ 2 ) + s 3 1 L j 2 λ m a x ( N 2 T N 2 ) η 3 e o u t T ( τ 1 ) e o u t ( τ 1 ) λ ( e o u t T ( t ) e o u t ( t ) ) μ 2 λ η 3 1 φ t τ 1 ( t ) t e o u t T ( s ) e o u t ( s ) d s μ 2 λ η 4 1 φ t τ 2 ( t ) t e o u t T ( s ) e o u t ( s ) d s μ 2 λ e o u t T ( t ) e o u t ( t ) μ 2 λ η 3 1 φ t τ 1 ( t ) t e o u t T ( s ) e o u t ( s ) d s μ 2 λ η 4 1 φ t τ 2 ( t ) t e o u t T ( s ) e o u t ( s ) d s μ 2 λ V o u t μ ( t ) . Integrating (8) from t 0 to t , one has
V ( t ) ( k V ( t 0 ) ) 1 β α ( 1 β ) ( t t 0 ) 1 1 β , where 0 < k < 1 ,   V ( t 0 ) > V i n 1 ( t 0 ) ,   V ( t 0 ) > V o u t 1 ( t 0 ) . The controller u i n ( t ) = u 1 ( t )   and   u o u t ( t ) = u 2 ( t ) are activated at t 0 .

4. Numerical Example

In this section, numerical examples are provided to demonstrate the effectiveness of the theoretical results. Consider the duplex network is composed of five nodes. The function f ( · ) in networks (1)-(2) is chosen as f ( z ( t ) ) = ( z 1 ( t ) + 1 z 1 ( t ) 2 , 1 , 0 , 0 , 0 ) T , the nonlinear inner connecting functions and the time-varying delays are taken as g ( · ) = h ( · ) = tanh ( · ) and τ 1 ( t ) = τ 2 ( t ) = sin t , respectively. L j = 1.5 ,   L h = L r = 2 ,   γ = 0.3 ,   φ = 0.1 . Some parameters are selected as follows,
A ˜ = 0.1 0.3 0 0 0.2 0.2 0.1 0 0 0.1 0 0 0.1 0.1 0 0 , B ˜ = 0.1 0.3 0 0 0.2 0.2 0.1 0 0 0.1 0 0 0.1 0.1 0 0 , C 1 = 0.1 0 0.1 0 0 0.1 0.2 0 0 0 0.1 0.1 0 0.1 0 0.1 , C 2 = 0.3 0.1 0 0.1 0.1 0 0.2 0.1 0.2 0 0.2 0 0 0.3 0 0.3 , D 1 = 0.2 0.1 0 0.1 0.1 0.2 0 0 0 0 0.2 0.1 0 0.1 0 0.1 , D 2 = 0.5 0 0.3 0 0.4 0.2 0 0 0.1 0 0.1 0.2 0.2 0.1 0 0.5 . M = N 1 = N 2 = I , F ( t ) = d i a g ( 0.2 , sin t , cos t , 0.1 ) ,   s i = 2 ( i = 1 , , 1 ) ,   ξ = 10 ,   η 1 = 2 ,   η 2 = 1 , σ = 0.4 ,   α = 3 , α 1 = 2 ,   α 2 = 1 ,   k = 0.4 ,   β = 0.3 ,   η 3 = 0 . 2 ,   η 4 = 0 . 3 ,   λ = 0 . 1 ,   χ = 0 . 6 .   The initial conditions x ( t 0 ) = ( 0.04 i , 0.03 i , 0.02 i , 0.01 i ) T , y ( t 0 ) = ( 0.4 0.1 i , 0.3 0.2 i , 0.2 i , 0.1 i ) T , ( i = 1 , , 4 ) . It is shown in Figure 1 display the synchronization error e ( t ) diverges when the network is in the absence of control. Figure 2 display the synchronization error e ( t ) tend to zero in finite time.

5. Conclusions

This paper investigated finite time hybrid synchronization of duplex complex networks via intermittent control. Compared with similar work, the internal synchronization and the external all be considered to achieve synchronization within a finite time, which determined by the designed Lyapunov function. A criterion has been proposed to guarantee the synchronization within a finite time T. Numerical simulations show that the control scheme in this brief is of good performance.

Acknowledgments

This research is supported by the 2020 Jilin Province Science and Technology Development Plan project “20200404223YY”, Jilin Province science and technology development plan project “YDZJ202201ZYTS605”, Jilin Province Science and Technology Development Plan Project (No.:20220101137JC).

References

  1. Zhang X, Quah C H, Nazri Bin Mohd Nor M. Deep neural network-based analysis of the impact of ambidextrous innovation and social networks on firm performance [J]. Scientific Reports, 2023, 13(1): 10301.
  2. Pavani S, Kumar S P, Bolla S. Recognize pressure based on social communications in social networks[ C]. AIP Conference Proceedings. AIP Publishing, 2024, 2512(1).
  3. Danesh T, Ouaret R, Floquet P, et al. Interpretability of neural networks predictions using Accumulated Local Effects as a model-agnostic method [J].Computer aided chemical engineering. Elsevier, 2022, 51: 1501-1506.
  4. Wang H J, Xu Y H, Li M, et al. Impact of population size on epidemic spreading in a bipartite metapopulation network with recurrent mobility [J]. International Journal of Modern Physics C (IJMPC), 2024, 35(08): 1-13.
  5. Wu Y, Sun Z, Ran G, et al. Intermittent control for fixed-time synchronization of coupled networks [J]. IEEE/CAA Journal of Automatica Sinica, 2023, 10(6): 1488-1490.
  6. Chaudhary H, Sajid M, Kaushik S, et al. Stability analysis of chaotic generalized Lotka-Volterra system via active compound difference anti-synchronization method [J]. Mathematical Biosciences and Engineering, 2023, 20(5): 9410-9422.
  7. Lu Q, Lu W, Zhang Y. Synchronization of fractional-order repressilatory genetic oscillators with time delay [J]. International Journal of Modeling, Simulation, and Scientific Computing, 2024, 15(01): 2450015.
  8. Geng X, Feng J, Zhao Y, et al. Fixed-time synchronization of nonlinear coupled memristive neural networks with time delays via sliding-mode control [J]. Electronic Research Archive, 2023, 31(6): 3291-3308.
  9. Kumar S, Matouk A E, Kumar P, et al. Analysis and Chaos Control and Synchronization of the Nonlinear Newton–Leipnik System Via Feedback Adaptive Control Techniques [J]. Journal of Uncertain Systems, 2023, 16(04): 2330002.
  10. Guo B, Xiao Y. Synchronization of multi-link and multi-delayed inertial neural networks with Markov jump via aperiodically intermittent adaptive control [J]. Mathematics and Computers in Simulation, 2024, 219: 435-453.
  11. Guo Q, Chen Z, Shi Y, et al. Synchronous control for multiple electrohydraulic actuators with feedback linearization [J]. Mechanical Systems and Signal Processing, 2022, 178: 109280.
  12. Ma X H, Wang J A. Pinning outer synchronization between two delayed complex networks with nonlinear coupling via adaptive periodically intermittent control [J]. Neurocomputing, 2016, 199: 197-203.
  13. Zhang C, Wang X, Wang C, et al. Outer synchronization of complex networks with internal delay and coupling delay via aperiodically intermittent pinning control [J]. International Journal of Modern Physics C, 2017, 28(08): 1750108.
  14. Wu Y, Zhuang G, Wang Y. Finite-time master–slave synchronization for implicit hybrid neural networks under event-triggered guaranteed cost control and random deception attacks [J]. Journal of the Franklin Institute, 2024: 106966.
  15. Wang L, Tan X, Wang Q, et al. Multiple finite-time synchronization and settling-time estimation of delayed competitive neural networks [J]. Neurocomputing, 2023, 552: 126555.
  16. Wang L, Yang X, Liu H, et al. Synchronization in finite time of fractional-order complex-valued delayed gene regulatory networks [J]. Fractal and Fractional, 2023, 7(5): 347.
  17. Yang X, Chen W, Wu L, et al. Synchronous oscillation characteristic and finite-time function projection synchronization control method for microgrids [J]. Electric Power Systems Research, 2023, 221: 109492.
  18. Zha J, Zhang H. Geometric Error Identification of Gantry-Type CNC Machine Tool Based on Multi-Station Synchronization Laser Tracers [J]. Chinese Journal of Mechanical Engineering, 2024, 37(1): 46.
  19. Liu P, Yong J, Zhao J, et al. Synchronization of coupled inertial neural networks via continuous and event-triggered pinning controls [J]. Journal of the Franklin Institute, 2024, 361(9): 106869.
  20. Aslam M S, Li Q, Hou J, et al. Mode-dependent delays for dissipative filtering of stochastic semi-Markovian jump for neural networks [J]. Advances in Continuous and Discrete Models, 2022, 2022(1): 21.
Figure 1. synchronization without control.
Figure 1. synchronization without control.
Preprints 119894 g001
Figure 2. synchronization with control.
Figure 2. synchronization with control.
Preprints 119894 g002
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.
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
Prerpints.org logo

Preprints.org is a free preprint server supported by MDPI in Basel, Switzerland.

Subscribe

© 2024 MDPI (Basel, Switzerland) unless otherwise stated