# Finite-Time Antisynchronization and Parameters Identification of Nonlinear Coupled Multiple-Weight Markovian Switching Complex Networks with Stochastic Perturbations

Authors: Haifeng Qiu; Liguo Weng; Bin Yu; Yanghui Zhang
Journal: Advances in Mathematical Physics
 (2020)

---

## Abstract

The paper mainly focuses on the synchronization of multiple-weight Markovian switching complex networks under nonlinear coupling mode. Based on the finite-time stability theory, Itô’s lemma, and some inequality technologies, the synchronization criterion of network models in the nonlinear coupling mode is obtained; at the same time, unknown parameters of networks are also identified by an effective controller. In addition, several corollaries are given to illustrate the general applicability of the control rules in the paper. Finally, two typical numerical simulations are given to prove the rationality and feasibility of theoretical analysis of network models.


---

## Body

## 1. Introduction

Complex networks, as an interdisciplinary combination of nonlinear systems, control theory, graph theory, physics, and mathematical theory, have attracted the attention of all sectors of society. In human social activities, complex networks are closely related to our lives. Among them, real physical networks (e.g., power networks, transportation networks, and Internet networks) and abstract networks (e.g., financial networks, media networks, and interpersonal networks) both belong to complex networks [1, 2]. In the many dynamic behaviors of complex networks, synchronization is one of the representative and important collective behaviors on complex networks [3, 4]. The phenomenon of the network synchronization means that the dynamic status of the network nodes gradually tends to be consistent through the interaction between dynamic systems. In [5], based on the Lyapunov functional method and pinning control technique, some sufficient conditions are derived to ensure the synchronization of the network. Synchronization of nonlinear complex networks with multiple time-varying delays is achieved in [6]. These literatures mentioned above are all about the synchronization within one network; this kind of synchronization is called inner synchronization. However, it is also very important to study the synchronization between two or more networks; this kind of synchronization is called outer synchronization. At present, many control strategies have been proposed and applied to the synchronization of complex networks, such as adaptive control [7], pinning control [8, 9], sliding control [10], and intermittent control [11]. In the paper, in order to realize the antisynchronization of the networks, the adaptive control method will be adopted.It is well known that the coupling relationships of complex networks cannot be all linear in real life. In many cases, the value of the variablext cannot be directly observed, and the observed value can only be hxt. At this time, the nonlinear relationship hxt is used to achieve complex network synchronization [12]. Therefore, the nonlinear coupling synchronization problem also has great research value, and the results are even more practical. In [13], synchronization of nonlinear and delayed coupled neural networks with multiweights is achieved through pinning control technology. Based on the Lyapunov stability theory, synchronization problem of a nonlinear complex network with multiple time-varying delays is investigated in [6]. In addition, the topology of the network also has an important effect on the synchronization of nonlinear coupled complex networks.In most of the networks considered above, researchers assume that the topology of the network is fixed, but this requirement is very strict in practical applications and only reflects ideal situations. In actual conditions, due to machine failure or maintenance, stochastic disturbances, and other reasons, the topology of the actual network will always change with time varying [14]. It is found through research that this random switching may depend on the Markovian process. In [15], finite-time synchronization of a class of nonlinear coupled Markovian jump time delay complex networks with stochastic noises is achieved via pinning control technology. In [16], by constructing a novel stochastic Lyapunov-Krasovskii function and employing the linear matrix inequalities (LMIs), Liu et al. studied cluster synchronization problem of Markovian switching complex networks with hybrid couplings. Furthermore, in order to research the complex network closer to the actual system, the unknown parameters of the Markovian switching complex network should be paid more attention [17]. This is because the synchronization process of the network may be affected or even disrupted by these unknown parameters.In the real world, a number of networks can be modeled by complex dynamic networks with multiple weights, such as power networks, social networks, and communication networks. Each node in these networks is connected by multiple weights. In other words, there are multiple forms of coupling between nodes in multiple-weight networks. In the following, we take a power network in Figure1 as an example to build a complex network with multiple weights. If the power network is viewed as a collection of many high-voltage transmission lines and various power stations, then all kinds of high-voltage transmission lines can be called “edge,” and the connection points of these high-voltage transmission lines (transmission or consuming power stations, substations that distribute power) can be called “node,” so that the power system is abstracted as a complex network in the general sense. On the other hand, power transmission lines can transmit power through high-voltage direct current, flexible axial current, and AC/DC hybrid. Because each transmission method has different weights, a complex dynamic network model with multiple weights can describe the power network more accurately. From the above analysis, it is very necessary and valuable to study complex dynamic networks with multiple weights. In [18], the author establishes a global synchronization criterion for a multiweighted public transport route network. In [19], the author considered the global synchronization problem of multiweight urban transport networks. Moreover, it should be noted that the time of the network synchronization is very important in the actual system.Figure 1
Power network diagram.In the actual engineering field, the time of the network synchronization is concerned by people, and scholars are eager to know the time of network synchronization. The finite-time control technology can realize this idea. In fact, finite-time synchronization means the optimal convergence time and finite-time control scheme can better reflect the robustness of the network [20, 21]. Hence, it is very valuable to study the finite-time synchronization of complex networks. In [14], based on an M-matrix technique and stochastic analysis technique, synchronization of Markovian jumping complex networks was achieved in a finite time. In [22], finite-time synchronization for Markovian jumping complex dynamical frameworks with hybrid couplings is studied. In addition, time delays and stochastic disturbances always exist in the actual networks, and they also have a great impact on the network synchronization process [23, 24]. Thus, stochastic disturbances should be considered in the network synchronization process.Inspired by the above discussion, the paper mainly focuses on that the finite-time antisynchronization and parameter identification of a class of nonlinear coupled multiple-weight Markovian switching complex networks with stochastic perturbations. To the best of our knowledge, until now, there are rarely studies on the finite-time antisynchronization of nonlinear coupled multiple-weight Markovian switching complex networks with unknown parameters. Therefore, the research has significance in terms of theory and practice.This paper is organized as follows. Some notations and necessary conditions will be given in Section2. In Section 3, finite-time antisynchronization analysis for nonlinear coupled multiple-weight Markovian switching complex networks is discussed. In Section 4, in order to prove the validity of the above theoretical analysis, two numerical examples are given. The conclusions are drawn in Section 5.


## 2. Preliminaries

In order to complete the theoretical proof, some important mathematical notations and necessary conditions are given in this section. Firstly, some important mathematical notations are introduced as follows. Define matrixATorxT as the transpose matrix of Aorx. Let E represent mathematical expectations. The Kronecker product of matrix is represented by the notation ⊗. Let x2 as the 2-norm of x. In∈Rn×n is defined as the n-dimensional identity matrix. The maximum eigenvalue of the matrix A is denoted by λmaxA. Secondly, some necessary conditions are given below.Assumption 1 ([25]).
Assume that a Lipschitz condition is satisfied by noise intensity functionσit,eit,rt, and there exists a constant ρi≥0 such that
(1)traceσiTt,eit,rtσit,eit,rt≤ρirteiTteit.Assumption 2 ([26]).
Let0<γ<1 and ξ>0. Assume that there exists a continuous function g:0,∞⟶0,∞ with g0>0 such that, for any 0≤t1≤t2(2)gt−gu≤−ξ∫utgsγds.Assumption 3 ([25]).
For arbitraryxt∈Rn and yt∈Rn, and nonlinear equation ft,x,α satisfies ft,−x,α=−ft,x,α, we can get
(3)xt+ytTft,xt,α+ft,yt,α≤xt+ytTνPxt+yt,where v is a nonnegative constant, and P is a positive definite matrix.Lemma 4 ([27]).
Suppose that a continuous, positive definite functionVt satisfies the differential inequality V̇t≤−αVεt,∀t≥t0,Vt0≥0, where α>0, 0<ε<1. For any given t0, Vt satisfies the inequality V1−εt≤V1−εt0−α1−εt−t0,t0≤t≤t1, and Vt≡0,∀t≥t1, we can get t1(4)t1=t0+V1−εt0α1−ε.Lemma 5 ([27]).
For any vectorsxt,yt∈Rn and a positive definite matrix KK>0, the following inequality holds
(5)xTy≤12xTK−1x+yTKy.Lemma 6 ([28]).
b1,b2,⋯,bn∈Rn are any vectors, the following inequality holds
(6)b1c+b2c+⋯+bnc≥b12+b22+⋯+bn2c/2,where c0<c<2 is a real number.


## 3. Finite-Time Antisynchronization between Two Nonlinear Coupled Double-Weight Markovian Switching Networks

In the following, finite-time antisynchronization and identification between two nonlinear coupled double-weight Markovian switching complex networks with stochastic perturbations are studied in this section.


### 3.1. Network Models

Consider the following multiple-weight Markovian switching complex network withN nodes:
(7)ẋit=fi1xit+fi2xitαit+∑j=1Nc1aij1rtΓ1xjt−τ+∑j=1Nc2aij2rtΓ2hxjt,i=1,2,⋯,N,where xit=xi1t,xi2t,⋯,xintT∈Rn is the state vector of the ith node; fi:Rn⟶Rn and fi2:Rn⟶Rn×n are continuous vector function and matrix function, respectively; h·:Rn⟶Rn is a nonlinear coupling function; αit is an unknown parameter vector of the dynamic node; time delays τ satisfy τ>0; cdcd>0,d=1,2 indicates the coupling strength for the dth coupling form; Γd∈Rn×nd=1,2 is inner coupling matrix of the dth coupling form Adrt=aijdrtN×N∈RN×Nd=1,2 is topological structure matrix in the dth coupling form, which represents topological structure of the network at time t in mode rt; Adrt can be defined as if there exists a connection between node i and node jj≠i for the mth coupling form, then aijd≠0; otherwise, aijd=0. The diagonal elements of Art are defined as
(8)aiidrt=−∑j=1,j≠iNaijdrt,d=1,2;i=1,2,⋯,N.Letrt,t≥0 be a right-continuous Markovian process in probability space, which takes values in a finite space S=1,2⋯l with generator Π=πpqm×m. The transition probability from the pth mode at time t to the qth mode at time t+∆t is defined as follow:
(9)Prt+△t=qrt=p=πpq△t+o△t,ifq≠p,1+πpp△t+o△t,ifq=p,where Δt>0, limΔt→0oΔt/Δt=0, and transition rate πpqπpq>0 satisfies
(10)πpp=−∑q=1,q≠pmπpq.Network (7) is considered as drive system, then the response network as
(11)ẏit=fi1yit+fi2yitα^it+∑j=1Nc1bij1rtΓ1yjt−τ+∑j=1Nc2bij2rtΓ2hyjt+σit,eit,rtω̇t+uit,i=1,2,⋯,N,where yit=yi1t,yi2t,⋯,yintT∈Rn is the state vector of the ith node; α^it is estimation of the unknown parameter vector αit; Bdrt=bijdrtN×N∈RN×Nd=1,2 is the same as the definition of Adrt above; uit is a nonlinear controller; ωt=ω1t,ω2t,⋯,ωntT is the n-dimensional Weiner process. σit,xit,rt is noise intensity function, which describes the random impact of the environment on the network.Define the system synchronization error as follows:(12)eit=xit+yit,i=1,2,⋯,N,where eit=ei1t,ei2t⋯eintT represents state error of ith node.Outer synchronization means that the behavior of corresponding nodes between two or more networks tends to be consistent. In other words, the error between the drive network and the response network is zero; the synchronization and identification of the system will be achieved.Definition 7.
For an arbitrarytt>t1>0, if each node of the network satisfies the following equation, then the drive system (7) and response system (11) can achieve synchronization in a finite time t1.
(13)limt→t1Eeit=limt→t1Exit+yit2=0,i=1,2,⋯,N.Remark 8.
When the nonlinear coupled double-weight Markovian switching complex network (7) and (11) gradually realizes antisynchronization at a finite time t1, the unknown parameter vector αit will be identified, expression as
(14)limt→t1∑i=1Nα^it−αi2=0.


### 3.2. Main Results

In this part, finite-time antisynchronization between two nonlinear coupled double-weight Markovian switching complex networks is analyzed and proven through a designed nonlinear controller with update law.From the network (7) and (11), the synchronization error of node dynamics system can be written as:
(15)ėit=ẋit+ẏit=fi1xit+fi2xitαit+fi1yit+fi2yitα^it+σit,eit,rtω̇t+∑j=1Nc1aij1rtΓ1xjt−τ+∑j=1Nc2aij2rtΓ2hxjt∑j=1Nc1bij1rtΓ1yjt−τ+∑j=1Nc2bij2rtΓ2hyjt+uit.Obviously, when the synchronization error (15) converges to zero in a finite time, the finite-time synchronization of networks will be achieved; at the same time, the unknown parameters of the system will be identified accordingly. Therefore, by designing an effective controller uit, the finite-time antisynchronization problem of the nonlinear coupled double-weight complex networks will be solved.Theorem 9.
Design the controller with adaptive law as follows(16)uit=−krtsigneiteitγ−ηirteit−∑j=1Nc1aij1rtΓ1xjt−τ−∑j=1Nc1bij1rtΓ1yjt−τ+∑j=1Nc2aij2rt−bij2rtΓ2hyjt,α^̇it=λirtfi2Tyiteit−φirtsignα^itα∧it+Mαγ,i=1,2,⋯,N,where control parameters ηirt>0, kirt>0, λirt>0, and φirt>0 (r∈S); Mα is a known constant and satisfies the condition α^i≤Mα, and if the following inequality holds
(17)∑q=1mπpqDq−Qp≤0,Κ~+Α~+Ω~+12Θrt+Ο~−Ξrt⊗In≤0,where Dq is a positive definite matrix of appropriate dimension, and Qq is an arbitrary symmetric matrix. Θrt=diagρ1rt,ρ2rt,⋯,ρNrt; signeit=diagsignei1t,signei2t,⋯,signeint; A~=1/2c2A2⊗Γ2K−1A2⊗Γ2T; Ο~=L2KIN; ϖp=∑q=1mDq−Qp/2; Ω~=vIN⊗P; Κ~=IN⊗ϖp; Ξrt=diagη1rt,η2rt,⋯,ηNrt.Then, by controller (16) and inequality condition (17), the antisynchronization between two nonlinear coupled double-weight Markovian switching complex networks (7) and (11) can be achieved in a finite time t1, and according to Lemma 4, the finite time t1 can be expressed as follows:
(18)t1≤t0+Vt0,rt01−εψ2ε1−ε,where Vt0,rt0=1/2∑i=1NeiTt0eit0+1/2∑i=1N1/λirt0a~iTt0a~it0, ψ=minminkr,ξ/21+β/2minφr.Proof.
Construct the Lyapunov function as follows:(19)Vt,et,p=12∑i=1NeiTteit+12∑i=1N1λipα~iTtα~it+∑i=1N∫t−τteiTθeiθdθ.
According to Itô’s lemma, stochastic stability theory, and differential operatorL [29], we can get
(20)LVt,et,p=∑i=1NeiTtėit+∑i=1N1hipα~̇iTtα~it+∑i=1NeiTteit−∑i=1NeiTt−τeit−τ+∑q=1mπpq∑i=1N∫t−τteiTθeiθdθ+∑q=1mπpq12∑i=1NeiTteit+12∑i=1NtraceσiTt,eit,pσit,eit,p.
Bringing equation (15) into (20) we can get.
(21)LVt,et,p=∑i=1NeiTtfi1xit+fi2xitαit+fi1yit+fi2yitα^it+uit+∑j=1Nc1aij1rtΓ1xjt−τ+∑j=1Nc2aij2rtΓ2hxjt+∑j=1Nc1bij1rtΓ1yjt−τ+∑j=1Nc2bij2rtΓ2hyjt+σit,eit,rtω̇t+∑i=1N1hipα~̇iTtα~it+∑i=1NeiTteit−∑i=1NeiTt−τeit−τ+∑q=1mπpq∑i=1N∫t−τteiTθDqeiθdθ+∑q=1mπpq12∑i=1NeiTtDqeit+12∑i=1NtraceσiTt,eit,pσit,eit,p=∑i=1NeiTtfit,xit,αi+fit,yit,αi−fi2yitα~i+uit+∑j=1Nc1aij1rtΓ1xjt−τ+∑j=1Nc2aij2rtΓ2hxjt+∑j=1Nc1bij1rtΓ1yjt−τ+∑j=1Nc2bij2rtΓ2hyjt+σit,eit,rtω̇T+∑i=1N1hipα~̇iTtα~it+∑i=1NeiTteit−∑i=1NeiTt−τeit−τ+∑q=1mπpq∑i=1N∫t−τteiTθDqeiθdθ+12∑i=1NtraceσiTt,eit,pσit,eit,p+∑q=1mπpq12∑i=1NeiTtDqeit,where Dq is a positive definite matrix with suitable dimension.
According to controller (16), Assumption 1, and Assumption 2, equation (21) can be written as
(22)LVt,et,p=∑i=1NeiTt−ηipeit+fit,xit,αi+fit,yit,αi−fi2yitα~i+∑j=1Nc2aij2pΓ2hxjt+hyjt−kpsigneiteitγ−φp∑i=1N1λisignα^itα∧it+Mαγα~it−∑i=1NeiTt−τeit−τ+∑i=1NeiTtfi2yitα~it+∑q=1mπpq∑i=1N∫t−τteiTθDqeiθdθ+∑i=1NeiTteit+∑q=1mπpq12∑i=1NeiTtDqeit+12ρirteiTteit=∑i=1NeiTtfit,xit,αi+fit,yit,αi−kpsigneiteitγ−ηipeit+∑j=1Nc2aij2pΓ2Hejt+∑q=1mπpq12∑i=1NeiTtDqeit−ξ∑i=1N∫t−τteiTθeiθγ+1/2dθ+∑q=1mπpq∑i=1N∫t−τteiTθDqeiθdθ+12ρirteiTteit−φp∑i=1N1λipsignα^itα∧it+Mαγα~it,where Hejt=hxjt+hyjt.
According to Lemma5, we can get
(23)∑j=1Nc2aij2pΓ2Hejt=c2eTtA2⊗Γ2Het≤12c2eTtA2⊗Γ2K−1Ad⊗ΓdTet+12HTetKHet.
In addition, for arbitraryxt,yt∈Rn, if there exists a constant L>0, then following inequality will hold
(24)fxt+fyt≤Lxt+yt.
Then, we have(25)HTetKHet≤L2KeTtet.
Thus,(26)∑j=1Nc2aij2pΓ2Hejt=c2eTtA2⊗Γ2Het≤12c2eTtA2⊗Γ2K−1Ad⊗ΓdTet+12L2KeTtet.
Based on Lemma6, we have
(27)−∑i=1NeiTtsigneiteitγ=−∑i=1N∑j=1Neijteijtγsigneijt=−∑i=1N∑j=1Neijt1+γ≤−∑i=1N∑j=1Neijt21+γ=−∑i=1NeiTteit1+γ/2.
Due toα^i≤Mα, and from some inequality, relationships can obtain
(28)α~it=α^it−αit≤α^it+αit≤α^it+Mα.
Thus,(29)−∑i=1Nα∧it+Mαγsignα^itα~it=−∑i=1Nα∧it+Mαγα~it≤−∑i=1Nα∧it−αitγα~it=−∑i=1Nα~itγ+1.
According to Assumption3, and bringing the inequality (23), (27), (29) into equation (22), we can get
(30)LVt,et,p≤∑i=1NeiTtΑ~+Ω~+12Θrt+Ο~−Ξrt⊗Ineit−φp∑i=1N1λipα~iTtα~it1+γ−kp∑i=1NeiTteit1+γ/2−ξ∑i=1N∫t−τteiTθeiθdθ1+γ/2+∑q=1mπpq12∑i=1NeiTtDq−Qpeit≤∑i=1NeiTtΚ~+Α~+Ω~+12Θrt+Ο~−Ξrt⊗Ineit−ψ∑i=1NeiTteit+∑i=1N1λipα~iTtα~it+2∑i=1N∫t−τteiTθeiθdθ1+γ/2.
According to conditions (17), the above inequality (30) can be simplified to
(31)LVt,et,p≤−ψ2εVεt,et,p,where ε=1+γ/2.
From Lemma4 and inequality (18), if t0=0, finite time t1 can be estimated as
(32)t1≤V0,r01−εψ2ε1−ε.Remark 10.
When networks (7) and (11) achieve antisynchronization in a finite time t1, the unknown parameter vector α^it of the system will be identified as true value.Remark 11.
In the finite-time antisynchronization process between two nonlinear coupled double-weight Markovian switching complex networks (7) and (11), inequality (17) is only a sufficient condition, not a necessary condition.Remark 12.
The speed of antisynchronization and unknown parameters identification depends on the selection of control parametersηir, λir, krφr in controller (16).Corollary 13.
When the nonlinear coupling functionhx=x in complex networks, the systems (7) and (11) are linear coupled complex networks. Moreover, under the condition of Theorem 9, antisynchronization between two linear coupling multiple-weight Markovian switching complex networks can also achieved in a finite time t1.Under the condition ofhx=x, the synchronization error system is as follows
(33)ėit=ẋit+ẏit=fi1xit+fi2xitαit+fi1yit+fi2yitα^it+σit,eit,rtω̇t+∑j=1Nc1aij1rtΓ1xjt−τ+∑j=1Nc2aij2rtΓ2xjt+∑j=1Nc1bij1rtΓ1yjt−τ+∑j=1Nc2bij2rtΓ2yjt+uit.Theorem 14.
Lethx=x and Assumptions 1–3 hold. Then, networks (7) and (11) achieve antisynchronization under the set of controller (16) in finite time t1, if the following conditions are satisfied:
(i)
The following condition holds:(34)∑q=1mπpqDq−Qp≤0,Κ~+Α~+Ω~+12Θrt−Ξrt⊗In≤0,where D(q) is a positive definite matrix of appropriate dimension, Q(q) is an arbitrary symmetric matrix. Θrt=diagρ1rt,ρ2rt,⋯,ρNrt; signeit=diagsignei1t,signei2t,⋯,signeint;
A~=1/2A2s+A2sT; ϖp=∑q=1mDq−Qp/2; Κ~=IN⊗ϖp; Ω~=vIN⊗P, Ξrt=diagη1rt,η2rt,⋯,ηNrt.
(ii)
When the initial timet0=0, t1 is estimated as(35)t1≤V0,r01−εθ2ε1−ε,where Vt0,rt0=1/2∑i=1NeiTt0eit0+1/2∑i=1N1/λirt0a~iTt0a~it0, θ=minminkr,minφr.Proof.
Constructed Lyapunov function is the same as equation (19).Therefore, under the condition ofhx=x, inequality (23) is as follows
(36)∑i=1NeiTt∑j=1Nc2aij2pΓ2Hejt=∑i=1NeiTt∑j=1Nc2aij2pΓ2ejt=eTtA2⊗Γ2et≤λmaxA2s+A2sT2eTtet,where A2s=A2⊗Γ2.The rest of the proof is similar to that of Theorem9.Remark 15.
In the finite-time antisynchronization and parameters identification process between two linear coupled double-weight Markovian switching complex networks, inequality (34) is only a sufficient condition, not a necessary condition.Corollary 16.
When the unknown parameter vectorαt of the network is known, under the condition of Theorem 9, complex networks (7) and (11) can achieve antisynchronization, where the adaptive part of the unknown parameter of the controller is cancelled in Theorem 9.
(37)uit=−krtsigneiteitγ−ηirteit−∑j=1Nc1aij1rtΓ1xjt−τ−∑j=1Nc1bij1rtΓ1yjt−τ+∑j=1Nc2aij2rt−bij2rtΓ2hyjt.Proof.
The Lyapunov function is shown below(38)Vt,et,p=12∑i=1NeiTteit+∑i=1N∫t−τteiTθeiθdθ.
The proof process is basically similar to Theorem9.Remark 17.
Based on the synchronization control rules in this paper, a class of nonlinear coupled double-weight Markovian complex networks without unknown parameters can achieve finite-time antisynchronization.Corollary 18.
Under the conditions of Corollary13, Corollary 16, and Γ1=Γ2, complex networks (7) and (11) become single-weight Markovian complex networks. According to Theorem 9 and Theorem 14, finite-time antisynchronization between two linear coupled single-weight Markovian complex networks can be achieved. In addition, the proof process is basically similar to Theorem 9.


## 3.1. Network Models

Consider the following multiple-weight Markovian switching complex network withN nodes:
(7)ẋit=fi1xit+fi2xitαit+∑j=1Nc1aij1rtΓ1xjt−τ+∑j=1Nc2aij2rtΓ2hxjt,i=1,2,⋯,N,where xit=xi1t,xi2t,⋯,xintT∈Rn is the state vector of the ith node; fi:Rn⟶Rn and fi2:Rn⟶Rn×n are continuous vector function and matrix function, respectively; h·:Rn⟶Rn is a nonlinear coupling function; αit is an unknown parameter vector of the dynamic node; time delays τ satisfy τ>0; cdcd>0,d=1,2 indicates the coupling strength for the dth coupling form; Γd∈Rn×nd=1,2 is inner coupling matrix of the dth coupling form Adrt=aijdrtN×N∈RN×Nd=1,2 is topological structure matrix in the dth coupling form, which represents topological structure of the network at time t in mode rt; Adrt can be defined as if there exists a connection between node i and node jj≠i for the mth coupling form, then aijd≠0; otherwise, aijd=0. The diagonal elements of Art are defined as
(8)aiidrt=−∑j=1,j≠iNaijdrt,d=1,2;i=1,2,⋯,N.Letrt,t≥0 be a right-continuous Markovian process in probability space, which takes values in a finite space S=1,2⋯l with generator Π=πpqm×m. The transition probability from the pth mode at time t to the qth mode at time t+∆t is defined as follow:
(9)Prt+△t=qrt=p=πpq△t+o△t,ifq≠p,1+πpp△t+o△t,ifq=p,where Δt>0, limΔt→0oΔt/Δt=0, and transition rate πpqπpq>0 satisfies
(10)πpp=−∑q=1,q≠pmπpq.Network (7) is considered as drive system, then the response network as
(11)ẏit=fi1yit+fi2yitα^it+∑j=1Nc1bij1rtΓ1yjt−τ+∑j=1Nc2bij2rtΓ2hyjt+σit,eit,rtω̇t+uit,i=1,2,⋯,N,where yit=yi1t,yi2t,⋯,yintT∈Rn is the state vector of the ith node; α^it is estimation of the unknown parameter vector αit; Bdrt=bijdrtN×N∈RN×Nd=1,2 is the same as the definition of Adrt above; uit is a nonlinear controller; ωt=ω1t,ω2t,⋯,ωntT is the n-dimensional Weiner process. σit,xit,rt is noise intensity function, which describes the random impact of the environment on the network.Define the system synchronization error as follows:(12)eit=xit+yit,i=1,2,⋯,N,where eit=ei1t,ei2t⋯eintT represents state error of ith node.Outer synchronization means that the behavior of corresponding nodes between two or more networks tends to be consistent. In other words, the error between the drive network and the response network is zero; the synchronization and identification of the system will be achieved.Definition 7.
For an arbitrarytt>t1>0, if each node of the network satisfies the following equation, then the drive system (7) and response system (11) can achieve synchronization in a finite time t1.
(13)limt→t1Eeit=limt→t1Exit+yit2=0,i=1,2,⋯,N.Remark 8.
When the nonlinear coupled double-weight Markovian switching complex network (7) and (11) gradually realizes antisynchronization at a finite time t1, the unknown parameter vector αit will be identified, expression as
(14)limt→t1∑i=1Nα^it−αi2=0.


## 3.2. Main Results

In this part, finite-time antisynchronization between two nonlinear coupled double-weight Markovian switching complex networks is analyzed and proven through a designed nonlinear controller with update law.From the network (7) and (11), the synchronization error of node dynamics system can be written as:
(15)ėit=ẋit+ẏit=fi1xit+fi2xitαit+fi1yit+fi2yitα^it+σit,eit,rtω̇t+∑j=1Nc1aij1rtΓ1xjt−τ+∑j=1Nc2aij2rtΓ2hxjt∑j=1Nc1bij1rtΓ1yjt−τ+∑j=1Nc2bij2rtΓ2hyjt+uit.Obviously, when the synchronization error (15) converges to zero in a finite time, the finite-time synchronization of networks will be achieved; at the same time, the unknown parameters of the system will be identified accordingly. Therefore, by designing an effective controller uit, the finite-time antisynchronization problem of the nonlinear coupled double-weight complex networks will be solved.Theorem 9.
Design the controller with adaptive law as follows(16)uit=−krtsigneiteitγ−ηirteit−∑j=1Nc1aij1rtΓ1xjt−τ−∑j=1Nc1bij1rtΓ1yjt−τ+∑j=1Nc2aij2rt−bij2rtΓ2hyjt,α^̇it=λirtfi2Tyiteit−φirtsignα^itα∧it+Mαγ,i=1,2,⋯,N,where control parameters ηirt>0, kirt>0, λirt>0, and φirt>0 (r∈S); Mα is a known constant and satisfies the condition α^i≤Mα, and if the following inequality holds
(17)∑q=1mπpqDq−Qp≤0,Κ~+Α~+Ω~+12Θrt+Ο~−Ξrt⊗In≤0,where Dq is a positive definite matrix of appropriate dimension, and Qq is an arbitrary symmetric matrix. Θrt=diagρ1rt,ρ2rt,⋯,ρNrt; signeit=diagsignei1t,signei2t,⋯,signeint; A~=1/2c2A2⊗Γ2K−1A2⊗Γ2T; Ο~=L2KIN; ϖp=∑q=1mDq−Qp/2; Ω~=vIN⊗P; Κ~=IN⊗ϖp; Ξrt=diagη1rt,η2rt,⋯,ηNrt.Then, by controller (16) and inequality condition (17), the antisynchronization between two nonlinear coupled double-weight Markovian switching complex networks (7) and (11) can be achieved in a finite time t1, and according to Lemma 4, the finite time t1 can be expressed as follows:
(18)t1≤t0+Vt0,rt01−εψ2ε1−ε,where Vt0,rt0=1/2∑i=1NeiTt0eit0+1/2∑i=1N1/λirt0a~iTt0a~it0, ψ=minminkr,ξ/21+β/2minφr.Proof.
Construct the Lyapunov function as follows:(19)Vt,et,p=12∑i=1NeiTteit+12∑i=1N1λipα~iTtα~it+∑i=1N∫t−τteiTθeiθdθ.
According to Itô’s lemma, stochastic stability theory, and differential operatorL [29], we can get
(20)LVt,et,p=∑i=1NeiTtėit+∑i=1N1hipα~̇iTtα~it+∑i=1NeiTteit−∑i=1NeiTt−τeit−τ+∑q=1mπpq∑i=1N∫t−τteiTθeiθdθ+∑q=1mπpq12∑i=1NeiTteit+12∑i=1NtraceσiTt,eit,pσit,eit,p.
Bringing equation (15) into (20) we can get.
(21)LVt,et,p=∑i=1NeiTtfi1xit+fi2xitαit+fi1yit+fi2yitα^it+uit+∑j=1Nc1aij1rtΓ1xjt−τ+∑j=1Nc2aij2rtΓ2hxjt+∑j=1Nc1bij1rtΓ1yjt−τ+∑j=1Nc2bij2rtΓ2hyjt+σit,eit,rtω̇t+∑i=1N1hipα~̇iTtα~it+∑i=1NeiTteit−∑i=1NeiTt−τeit−τ+∑q=1mπpq∑i=1N∫t−τteiTθDqeiθdθ+∑q=1mπpq12∑i=1NeiTtDqeit+12∑i=1NtraceσiTt,eit,pσit,eit,p=∑i=1NeiTtfit,xit,αi+fit,yit,αi−fi2yitα~i+uit+∑j=1Nc1aij1rtΓ1xjt−τ+∑j=1Nc2aij2rtΓ2hxjt+∑j=1Nc1bij1rtΓ1yjt−τ+∑j=1Nc2bij2rtΓ2hyjt+σit,eit,rtω̇T+∑i=1N1hipα~̇iTtα~it+∑i=1NeiTteit−∑i=1NeiTt−τeit−τ+∑q=1mπpq∑i=1N∫t−τteiTθDqeiθdθ+12∑i=1NtraceσiTt,eit,pσit,eit,p+∑q=1mπpq12∑i=1NeiTtDqeit,where Dq is a positive definite matrix with suitable dimension.
According to controller (16), Assumption 1, and Assumption 2, equation (21) can be written as
(22)LVt,et,p=∑i=1NeiTt−ηipeit+fit,xit,αi+fit,yit,αi−fi2yitα~i+∑j=1Nc2aij2pΓ2hxjt+hyjt−kpsigneiteitγ−φp∑i=1N1λisignα^itα∧it+Mαγα~it−∑i=1NeiTt−τeit−τ+∑i=1NeiTtfi2yitα~it+∑q=1mπpq∑i=1N∫t−τteiTθDqeiθdθ+∑i=1NeiTteit+∑q=1mπpq12∑i=1NeiTtDqeit+12ρirteiTteit=∑i=1NeiTtfit,xit,αi+fit,yit,αi−kpsigneiteitγ−ηipeit+∑j=1Nc2aij2pΓ2Hejt+∑q=1mπpq12∑i=1NeiTtDqeit−ξ∑i=1N∫t−τteiTθeiθγ+1/2dθ+∑q=1mπpq∑i=1N∫t−τteiTθDqeiθdθ+12ρirteiTteit−φp∑i=1N1λipsignα^itα∧it+Mαγα~it,where Hejt=hxjt+hyjt.
According to Lemma5, we can get
(23)∑j=1Nc2aij2pΓ2Hejt=c2eTtA2⊗Γ2Het≤12c2eTtA2⊗Γ2K−1Ad⊗ΓdTet+12HTetKHet.
In addition, for arbitraryxt,yt∈Rn, if there exists a constant L>0, then following inequality will hold
(24)fxt+fyt≤Lxt+yt.
Then, we have(25)HTetKHet≤L2KeTtet.
Thus,(26)∑j=1Nc2aij2pΓ2Hejt=c2eTtA2⊗Γ2Het≤12c2eTtA2⊗Γ2K−1Ad⊗ΓdTet+12L2KeTtet.
Based on Lemma6, we have
(27)−∑i=1NeiTtsigneiteitγ=−∑i=1N∑j=1Neijteijtγsigneijt=−∑i=1N∑j=1Neijt1+γ≤−∑i=1N∑j=1Neijt21+γ=−∑i=1NeiTteit1+γ/2.
Due toα^i≤Mα, and from some inequality, relationships can obtain
(28)α~it=α^it−αit≤α^it+αit≤α^it+Mα.
Thus,(29)−∑i=1Nα∧it+Mαγsignα^itα~it=−∑i=1Nα∧it+Mαγα~it≤−∑i=1Nα∧it−αitγα~it=−∑i=1Nα~itγ+1.
According to Assumption3, and bringing the inequality (23), (27), (29) into equation (22), we can get
(30)LVt,et,p≤∑i=1NeiTtΑ~+Ω~+12Θrt+Ο~−Ξrt⊗Ineit−φp∑i=1N1λipα~iTtα~it1+γ−kp∑i=1NeiTteit1+γ/2−ξ∑i=1N∫t−τteiTθeiθdθ1+γ/2+∑q=1mπpq12∑i=1NeiTtDq−Qpeit≤∑i=1NeiTtΚ~+Α~+Ω~+12Θrt+Ο~−Ξrt⊗Ineit−ψ∑i=1NeiTteit+∑i=1N1λipα~iTtα~it+2∑i=1N∫t−τteiTθeiθdθ1+γ/2.
According to conditions (17), the above inequality (30) can be simplified to
(31)LVt,et,p≤−ψ2εVεt,et,p,where ε=1+γ/2.
From Lemma4 and inequality (18), if t0=0, finite time t1 can be estimated as
(32)t1≤V0,r01−εψ2ε1−ε.Remark 10.
When networks (7) and (11) achieve antisynchronization in a finite time t1, the unknown parameter vector α^it of the system will be identified as true value.Remark 11.
In the finite-time antisynchronization process between two nonlinear coupled double-weight Markovian switching complex networks (7) and (11), inequality (17) is only a sufficient condition, not a necessary condition.Remark 12.
The speed of antisynchronization and unknown parameters identification depends on the selection of control parametersηir, λir, krφr in controller (16).Corollary 13.
When the nonlinear coupling functionhx=x in complex networks, the systems (7) and (11) are linear coupled complex networks. Moreover, under the condition of Theorem 9, antisynchronization between two linear coupling multiple-weight Markovian switching complex networks can also achieved in a finite time t1.Under the condition ofhx=x, the synchronization error system is as follows
(33)ėit=ẋit+ẏit=fi1xit+fi2xitαit+fi1yit+fi2yitα^it+σit,eit,rtω̇t+∑j=1Nc1aij1rtΓ1xjt−τ+∑j=1Nc2aij2rtΓ2xjt+∑j=1Nc1bij1rtΓ1yjt−τ+∑j=1Nc2bij2rtΓ2yjt+uit.Theorem 14.
Lethx=x and Assumptions 1–3 hold. Then, networks (7) and (11) achieve antisynchronization under the set of controller (16) in finite time t1, if the following conditions are satisfied:
(i)
The following condition holds:(34)∑q=1mπpqDq−Qp≤0,Κ~+Α~+Ω~+12Θrt−Ξrt⊗In≤0,where D(q) is a positive definite matrix of appropriate dimension, Q(q) is an arbitrary symmetric matrix. Θrt=diagρ1rt,ρ2rt,⋯,ρNrt; signeit=diagsignei1t,signei2t,⋯,signeint;
A~=1/2A2s+A2sT; ϖp=∑q=1mDq−Qp/2; Κ~=IN⊗ϖp; Ω~=vIN⊗P, Ξrt=diagη1rt,η2rt,⋯,ηNrt.
(ii)
When the initial timet0=0, t1 is estimated as(35)t1≤V0,r01−εθ2ε1−ε,where Vt0,rt0=1/2∑i=1NeiTt0eit0+1/2∑i=1N1/λirt0a~iTt0a~it0, θ=minminkr,minφr.Proof.
Constructed Lyapunov function is the same as equation (19).Therefore, under the condition ofhx=x, inequality (23) is as follows
(36)∑i=1NeiTt∑j=1Nc2aij2pΓ2Hejt=∑i=1NeiTt∑j=1Nc2aij2pΓ2ejt=eTtA2⊗Γ2et≤λmaxA2s+A2sT2eTtet,where A2s=A2⊗Γ2.The rest of the proof is similar to that of Theorem9.Remark 15.
In the finite-time antisynchronization and parameters identification process between two linear coupled double-weight Markovian switching complex networks, inequality (34) is only a sufficient condition, not a necessary condition.Corollary 16.
When the unknown parameter vectorαt of the network is known, under the condition of Theorem 9, complex networks (7) and (11) can achieve antisynchronization, where the adaptive part of the unknown parameter of the controller is cancelled in Theorem 9.
(37)uit=−krtsigneiteitγ−ηirteit−∑j=1Nc1aij1rtΓ1xjt−τ−∑j=1Nc1bij1rtΓ1yjt−τ+∑j=1Nc2aij2rt−bij2rtΓ2hyjt.Proof.
The Lyapunov function is shown below(38)Vt,et,p=12∑i=1NeiTteit+∑i=1N∫t−τteiTθeiθdθ.
The proof process is basically similar to Theorem9.Remark 17.
Based on the synchronization control rules in this paper, a class of nonlinear coupled double-weight Markovian complex networks without unknown parameters can achieve finite-time antisynchronization.Corollary 18.
Under the conditions of Corollary13, Corollary 16, and Γ1=Γ2, complex networks (7) and (11) become single-weight Markovian complex networks. According to Theorem 9 and Theorem 14, finite-time antisynchronization between two linear coupled single-weight Markovian complex networks can be achieved. In addition, the proof process is basically similar to Theorem 9.


## 4. Simulink Results

In this section, we will give some typical numerical examples to illustrate the effectiveness of the above model analysis.


### 4.1. Example 1

Firstly, a three-dimensional network state equation is given, and the dynamics equations of each nodes can be described by a chaotic system.(39)ẋi1t=αi1xi2t−xi1t,ẋi2t=−xi1txi3t+αi3xi2t,ẋi3t=xi1txi2t−αi2xi3t.Both of the driving system and the response system can be expressed by the Chen system above, and the system (39) can be expressed as:
(40)ẋi1tẋi2tẋi3t=0−xi1txi3txi1txi2t+xi2t−xi1t0000−xi3t0xi2t0×αi1αi2αi3,where αi is an unknow parameter vector, and the identification value of the unknow parameter is αi=36,3,20T. Moreover, the number of system nodes is 30 in numerical simulation, the coupling strengths of the networks are taken as c1=c2=10, and the other relevant parameters are as follows.Wherehx=sinx, Π=2−1−21, Γ1=0.50000.50000.5, and Γ2=100010001,
(41)σit,eit,1=diag22ei1,22ei2,22ei3,σit,eit,2=diag2ei1,2ei2,2ei3.The switching of network mode is shown in Figure2. In the following, according to the controller (16) and condition (17), some control parameters of controller (16) are selected as follows: η1=η2=40; k1=23, k2=25; λ1=20, λ2=25; φ1=φ2=10; γ=0.6; Mα=50. In this simulation process, the start time of the simulation is selected at t0=0, and time delay τ=0.01. In addition, through Lemma 4 and (32), we can obtain synchronization time t1≤10.9854.Figure 2
Switching of system mode.The time-varying curves of network synchronization errorseiti=1,2,3 are shown in Figure 3, and we can observe that synchronization error curves of networks gradually converge to zero. Furthermore, Figure 5 is the identification process of the unknown parameter vectors αii=1,2,3, and the unknown parameter vector is finally identified as αi=36,3,20T. From the enlarged pictures of Figures 4 and 6, it can be clearly seen that the network synchronization and parameter identification are achieved at about t=10. By comparing calculated values with simulated values, the theoretical proof of the third part is also verified.Figure 3
Synchronization errorseit with system evolution.Figure 4
Partial amplification of synchronization errorseit.Figure 5
Identification of the uncertain parametersα^i.Figure 6
Partial amplification of the uncertain parametersα^i.Figure 7
Switching of system mode.Figure 8
Synchronization errorseit with system evolution.Figure 9
Partial amplification of synchronization errorseit.Figure 10
Identification of the uncertain parametersα^i.Figure 11
Partial amplification of the uncertain parametersα^i.Figure 12
Synchronization errorseit with system evolution.Figure 13
Partial amplification of synchronization errorseit.Figure 14
Identification of the uncertain parametersα^i.Figure 15
Partial amplification of the uncertain parametersα^i.Secondly, in order to prove the superiority of this control method, the following comparison simulation is given, and the control method in [15] will be adopted. In addition, the network model, the topology switching mode, and all parameters are kept consistent in the two simulations. Figure 7 shows the system mode switching process.In this simulation process, the control parameters of the network are basically the same as the above example. In addition, the start time of the simulation is selected att0=0, and time delay τ=0.01. In addition, through Lemma 4 and (32), we can obtain synchronization time t1≤18.4358.The time-varying curves of networks synchronization errorseiti=1,2,3 are shown in Figure 8, and we can observe that synchronization error curves of networks gradually converge to zero. In addition, Figure 10 is the identification process of the unknown parameter vectors αii=1,2,3, and the unknown parameter vector is finally identified as αi=36,3,20T. From the enlarged pictures of Figures 9 and 11, it can be clearly seen that the networks synchronization and parameter identification are achieved at about t=17. By comparing calculated values with simulated values, the theoretical proof of the third part is also verified.By comparing the results of Example 1, the following conclusions can be drawn. On the one hand, the antisynchronization and identification of the networks can be realized in a finite time. One the other hand, compared with the control strategy in [15], the synchronization and identification performance of the system can be realized faster under the control strategy proposed in this paper.


### 4.2. Example 2

In this subsection, in order to prove the wide applicability of this control method, a four-dimensional network state equation is given, and the dynamic equations of each node can be described by a Hyperchaotic system.(42)ẋi1t=αi1xi2t−xi1t,ẋi2t=−xi1txi3t+αi3xi2t,ẋi3t=xi1txi2t−αi2xi3t,ẋi4t=xi1txi3t+αi4xi4t.Both of the driving system and the response system can be expressed by the Hyperchaotic system above, and the system (42) can be expressed as
(43)ẋi1ẋi4ẋi4ẋi4=0−xi1txi3txi1txi2txi1txi3t+xi2t−xi1t00000−xi3t00xi2t00xi4t00xi4t×αi1αi2αi3αi4,where αi is an unknow parameter vector, and the identification value of the unknow parameter is αi=36,3,20,1T. Moreover, the multiweighted Markovian switching network is composed of 100 nodes, the coupling strengths of the networks are taken as c2=c2=10, and the other relevant parameters are as follows.Wherehx=cosx, Π=2−1−21, Γ1=1000010000100001, and Γ2=2000020000200002,
(44)σit,eit,1=diag22ei1,22ei2,22ei3,σit,eit,2=diag2ei1,2ei2,2ei3.The switching of network mode is shown in Figure7. In the following, some control parameters of controller (16) are selected as follows: η1=η2=32; k1=20, k2=18; λ1=18, λ2=25; φ1=φ2=9; γ=0.6; Mα=50. In this simulation process, the start time of the simulation is selected at t0=0, and time delay τ=0.01. In addition, through Lemma 4 and (32), we can obtain synchronization time t1≤18.4391.The time-varying curves of networks synchronization errorseiti=1,2,3,4 are shown in Figure 12, and we can observe that synchronization error curves of networks gradually converge to zero. Furthermore, Figure 14 is the identification process of the unknown parameter vectors αii=1,2,3,4, and the unknown parameter vector is finally identified as αi=36,3,20,1T. From the enlarged pictures of Figures 13 and 15, it can be clearly seen that the networks synchronization and parameter identification are achieved at about t=16. By comparing calculated values with simulated values, the theoretical proof of the third part is also verified.


## 4.1. Example 1

Firstly, a three-dimensional network state equation is given, and the dynamics equations of each nodes can be described by a chaotic system.(39)ẋi1t=αi1xi2t−xi1t,ẋi2t=−xi1txi3t+αi3xi2t,ẋi3t=xi1txi2t−αi2xi3t.Both of the driving system and the response system can be expressed by the Chen system above, and the system (39) can be expressed as:
(40)ẋi1tẋi2tẋi3t=0−xi1txi3txi1txi2t+xi2t−xi1t0000−xi3t0xi2t0×αi1αi2αi3,where αi is an unknow parameter vector, and the identification value of the unknow parameter is αi=36,3,20T. Moreover, the number of system nodes is 30 in numerical simulation, the coupling strengths of the networks are taken as c1=c2=10, and the other relevant parameters are as follows.Wherehx=sinx, Π=2−1−21, Γ1=0.50000.50000.5, and Γ2=100010001,
(41)σit,eit,1=diag22ei1,22ei2,22ei3,σit,eit,2=diag2ei1,2ei2,2ei3.The switching of network mode is shown in Figure2. In the following, according to the controller (16) and condition (17), some control parameters of controller (16) are selected as follows: η1=η2=40; k1=23, k2=25; λ1=20, λ2=25; φ1=φ2=10; γ=0.6; Mα=50. In this simulation process, the start time of the simulation is selected at t0=0, and time delay τ=0.01. In addition, through Lemma 4 and (32), we can obtain synchronization time t1≤10.9854.Figure 2
Switching of system mode.The time-varying curves of network synchronization errorseiti=1,2,3 are shown in Figure 3, and we can observe that synchronization error curves of networks gradually converge to zero. Furthermore, Figure 5 is the identification process of the unknown parameter vectors αii=1,2,3, and the unknown parameter vector is finally identified as αi=36,3,20T. From the enlarged pictures of Figures 4 and 6, it can be clearly seen that the network synchronization and parameter identification are achieved at about t=10. By comparing calculated values with simulated values, the theoretical proof of the third part is also verified.Figure 3
Synchronization errorseit with system evolution.Figure 4
Partial amplification of synchronization errorseit.Figure 5
Identification of the uncertain parametersα^i.Figure 6
Partial amplification of the uncertain parametersα^i.Figure 7
Switching of system mode.Figure 8
Synchronization errorseit with system evolution.Figure 9
Partial amplification of synchronization errorseit.Figure 10
Identification of the uncertain parametersα^i.Figure 11
Partial amplification of the uncertain parametersα^i.Figure 12
Synchronization errorseit with system evolution.Figure 13
Partial amplification of synchronization errorseit.Figure 14
Identification of the uncertain parametersα^i.Figure 15
Partial amplification of the uncertain parametersα^i.Secondly, in order to prove the superiority of this control method, the following comparison simulation is given, and the control method in [15] will be adopted. In addition, the network model, the topology switching mode, and all parameters are kept consistent in the two simulations. Figure 7 shows the system mode switching process.In this simulation process, the control parameters of the network are basically the same as the above example. In addition, the start time of the simulation is selected att0=0, and time delay τ=0.01. In addition, through Lemma 4 and (32), we can obtain synchronization time t1≤18.4358.The time-varying curves of networks synchronization errorseiti=1,2,3 are shown in Figure 8, and we can observe that synchronization error curves of networks gradually converge to zero. In addition, Figure 10 is the identification process of the unknown parameter vectors αii=1,2,3, and the unknown parameter vector is finally identified as αi=36,3,20T. From the enlarged pictures of Figures 9 and 11, it can be clearly seen that the networks synchronization and parameter identification are achieved at about t=17. By comparing calculated values with simulated values, the theoretical proof of the third part is also verified.By comparing the results of Example 1, the following conclusions can be drawn. On the one hand, the antisynchronization and identification of the networks can be realized in a finite time. One the other hand, compared with the control strategy in [15], the synchronization and identification performance of the system can be realized faster under the control strategy proposed in this paper.


## 4.2. Example 2

In this subsection, in order to prove the wide applicability of this control method, a four-dimensional network state equation is given, and the dynamic equations of each node can be described by a Hyperchaotic system.(42)ẋi1t=αi1xi2t−xi1t,ẋi2t=−xi1txi3t+αi3xi2t,ẋi3t=xi1txi2t−αi2xi3t,ẋi4t=xi1txi3t+αi4xi4t.Both of the driving system and the response system can be expressed by the Hyperchaotic system above, and the system (42) can be expressed as
(43)ẋi1ẋi4ẋi4ẋi4=0−xi1txi3txi1txi2txi1txi3t+xi2t−xi1t00000−xi3t00xi2t00xi4t00xi4t×αi1αi2αi3αi4,where αi is an unknow parameter vector, and the identification value of the unknow parameter is αi=36,3,20,1T. Moreover, the multiweighted Markovian switching network is composed of 100 nodes, the coupling strengths of the networks are taken as c2=c2=10, and the other relevant parameters are as follows.Wherehx=cosx, Π=2−1−21, Γ1=1000010000100001, and Γ2=2000020000200002,
(44)σit,eit,1=diag22ei1,22ei2,22ei3,σit,eit,2=diag2ei1,2ei2,2ei3.The switching of network mode is shown in Figure7. In the following, some control parameters of controller (16) are selected as follows: η1=η2=32; k1=20, k2=18; λ1=18, λ2=25; φ1=φ2=9; γ=0.6; Mα=50. In this simulation process, the start time of the simulation is selected at t0=0, and time delay τ=0.01. In addition, through Lemma 4 and (32), we can obtain synchronization time t1≤18.4391.The time-varying curves of networks synchronization errorseiti=1,2,3,4 are shown in Figure 12, and we can observe that synchronization error curves of networks gradually converge to zero. Furthermore, Figure 14 is the identification process of the unknown parameter vectors αii=1,2,3,4, and the unknown parameter vector is finally identified as αi=36,3,20,1T. From the enlarged pictures of Figures 13 and 15, it can be clearly seen that the networks synchronization and parameter identification are achieved at about t=16. By comparing calculated values with simulated values, the theoretical proof of the third part is also verified.


## 5. Conclusion

In this paper, the finite-time antisynchronization and parameter identification of a class of nonlinear coupled multiple-weight Markovian switching complex networks with stochastic disturbances is solved. Firstly, by a controller with an adaptive law, sufficient and unnecessary conditions for synchronization of nonlinear coupling networks are obtained, and at the same time, unknown parameters of networks are identified. Secondly, several corollaries show that the synchronization control method in this paper can be applied to more general complex networks. Finally, simulation results prove that network models can achieve antisynchronization in a finite time, and the unknown parameter vector of networks is also identified as true values.In the future, we will continue to study the following aspects. On the one hand, it is very challenging to realize the finite-time antisynchronization and parameters identification of the proposed models by controlling a small number of important nodes. On the other hand, based on the model proposed in this paper, it is also very interesting to study the nonlinear coupled multiple-weight Markovian switching complex network models with parameter and model uncertainties and time-varying delays.



---

*Source: 7456120-2020-12-11.xml*