Partial-Information-Based Synchronization of Complex Networks with Multiple and Event-Triggered Couplings

We study the synchronization of complex networks by using event-sampling information.*e nodes of the network are connected with event-triggered communication via multiple couplings. *e couplings are split into several channels. Not all the channels are connected. Only a part of the states of each node can be communicated by the channels. An event detector is designed for each channel to independently determine the sampling moments. *e couplings of the network are partial and event-triggered. Both features make that less information can be used for synchronization. *e pinning controllers are also designed based on the sampled information. By establishing a time-dependent Lyapunov functional and utilizing an efficient event condition, we derive less conservative criteria for the synchronization of complex networks. Finally, the effectiveness of our main results is verified by an illustrative example, and comparisons are also presented to show how much conservatism can be reduced.


Introduction
During the last decades, the research of complex networks has attracted an increasing amount of attention. Without the central control, the network can perform many collective behaviors just through the local communications among adjacent neighbors. Hence, complex networks have extensive applications in many large-scale systems, such as biology, circuit systems, robotics, and unmanned vehicles. Among all the collective behaviors, synchronization is of great significance due to its wide existence in the real world, for example, fireflies and the school of fish. Recently, the synchronization of complex networks has been intensively studied. Many excellent synchronization results have also been derived in [1][2][3][4].
e key to realizing synchronization is the connections among nodes. In earlier research, more of a concern was to investigate the structural topology of complex networks [5][6][7][8]. More recently, the focus of the research has shifted to the communication environment [9]. With the rapid development and spread of digital technologies, natural signals are analog and have to be converted into digital format to be used in electronic equipment. It is referred to as the sampling issue. Initially, the time-triggered sampling protocol was widely employed [10]. e main feature of time-triggered communication is that the occurrence of sampling is determined by a predefined time sequence. e time-triggered sampling has its advantage in fault-tolerant systems since the missing data can be detected immediately. However, it is a lack of flexibility and the restrictive design process [11]. All the sampling processes have to be manipulated strictly according to the time sequence. It is hard to dynamically regulate the sampling plan based on the system's real-time performance. erefore, the time-triggered sampling usually leads to a conservative usage of the communication resource. Another drawback of time-triggered sampling is that all components of a system should be timely synchronous during operation to guarantee the strict timing specification of the system. us, time-triggered sampling is hard to be carried out in a large-scale system, especially for complex networks. To overcome the deficiencies of time-triggered sampling, event-triggered sampling has been introduced. It is kind of a real-time scheduling algorithm. An event condition is designed to decide sampling instants. When the condition cannot be satisfied, the state of the system needs to be measured. Compared with the time-triggered sampling, the event-triggered counterpart can quickly react to sudden fluctuations [12]. Hence, it is considered a more competent sampling protocol. Due to its virtue, numerous attention has been drawn to this subject, which includes the stabilizing control tasks of single systems [13,14] and the consensus issues of networked systems, such as multiagent systems [15,16], complex networks [17,18], coupled neural networks [19][20][21], sensor networks [22], and Boolean networks [23][24][25][26][27].
Each connection of complex networks consists of several channels to transmit distinct levels of node's information. In most existing works, all these channels can work properly. It is not realistic for many real systems. In mammalian brain networks, neurons in the same cortical area interact more intensively. However, only a small part of neurons (about 5%) can receive excitatory synapses to neurons from connected cortical areas [28,29]. It indicates that communication among cortical areas counts on the partial couplings which are established by a fraction of neurons. us, it is necessary to study the partial couplings of complex networks. As it is known, there are two types of neuronal signals: electrical or chemical signals. Some of the neurons may send electrical signals along with the fundamental chemical signals, while some others may only send one kind of signal. e couplings among complex networks should have multiple layers to communicate different signals. Furthermore, the couplings belonged distinct layers are also partially connected via various parts of a node. us, a more realistic communication environment is reflected by the couplings considered in this work, which are multiple partial and obeyed to the event-triggered update.
Despite the theoretical and practical significance, a few results have been proposed for synchronization of complex networks with multiple partial and event-triggered couplings. e difficulties of this problem can be categorized as three aspects. Firstly, the sampling scheme and partial connection lead to less information available for communication. e mechanisms of them are different. e sampling makes node's information available at a sequence of discrete instants. It is a "time-dependent" loss of information. On the other hand, the partial connection means that only a part of the node's information is transmitted, which can be seemed like a "space-dependent" loss. Double reductions make that much less information can be used for synchronization. Secondly, channels of any connection sample information separately, while they need to cooperatively converge. us, the event detector of each channel should be designed in a distributed way to realize a global object. Furthermore, the information used for design should also be sampled and partial. irdly, the sampled data is in essence a delayed signal [30]. Due to the complicated behaviors of a single node, the conservatism of synchronization criteria is unavoidable. It is necessary yet difficult to reduce the conservatism to make the conditions more applicable.
is work will address the partial-information-based synchronization of complex networks with multiple and event-triggered couplings. e event-triggered sampling is considered for every channel of each connection, in which an event detector is designed based on the sampled and partial information. e event detector individually determines the sampling moment of the corresponding channel. A unified framework will be built to cope with the two kinds of information loss. Channels are rearranged according to their levels of connection. Pinning controllers are also deployed for a small fraction of nodes. e sampled data is used to build the pinning controllers. Since the sampled signal has a time delay, it is hard to eliminate the conservatism of the proposed synchronization criteria. To reduce the conservatism, a delay-dependent Lyapunov functional will be constructed. Finally, a simulative example is proposed to illustrate the efficiency and effectiveness of our results.
Notations. N is the set of nonnegative integers. R n and R n×n represent, respectively, the n dimensional Euclidean space and the set of n × n real matrices. I n , 0 denote the identity matrix of size n and the zero matrix with proper dimensions, respectively. For real symmetric matrices X and Y, the notation X < Y (respectively, X ≤ Y) indicates that the matrix X − Y is negative definite (respectively, seminegative definite). For any two integers a ≤ b, the notation ‖ · ‖ denotes the Euclidean norm for a real vector. e superscript "⊤" represents the transpose of a matrix. diag · · · { } denotes a diagonal matrix. λ min (A) denotes the smallest eigenvalues of a matrix A. Matrices, if not explicitly stated, are assumed to have compatible dimensions. e symmetric term in a matrix is denoted by * .

Problem Formulation and Preliminaries
e dynamics of a node of a complex network can be described as where x i (t), w i (t), u i (t) ∈ R n are the state, the local coupling, and the control input of the ith node, respectively; , . . . , F n (z n (t))]; and α is the coupling strength. e nonlinear function F k (t) (k ∈ [1: n]) is supposed to satisfy the following Lipschitz condition: where L k is the Lipschitz constant of function F k .

Multiple Partial
Coupling. When complex networks are connected via a graph, each node of the network can communicate with its neighboring nodes. us, the local coupling of the ith node can be constructed as where N is the number of nodes of the network; G � [g ij ] N×N is the Laplacian matrix representing the 2 Complexity structural topology of the complex network (1), where g ij is defined as follows: if the jth node can send information to the ith node, g ij > 0; otherwise, g ij � 0. Furthermore, the diagonal elements g ii � − N j�1,j ≠ i g ij . It implies that the complex network would be decoupled when the complex network realizes synchronization. e local coupling (3) assumes that the node x i can receive all levels of information of the jth node, that is, x jk (∀k ∈ [1: n]). However, it is a subtle assumption for most biological systems. A more realistic situation is that only part of x jk can transmit information to other nodes. As a result, only partial information of each node can be received. Additionally, for different nodes, the transmitting information is distinct. Note that many real networks have multiweighted connections. For example, in neural networks, neurons send both electrical signals and chemical signals; in supply chain networks, the capital chain, logistic chain, and information chain have separate routes. us, the couplings of these kinds of complex networks should be multiple layers to transmit distinct types of signals or chains. To study the multiple and partial features of couplings, the coupling term (3) is transformed as where Q is the number of multiple couplings of the complex network (1): ij , a q2 ij , . . . , a qn ij with a qk ij � 0 or 1. When a qk ij � 0, it indicates that the kth level of information of the ith node (x ik ) cannot receive information of the corresponding level of the jth nodes (x jk ) from the qth layer of the coupling. Otherwise, it means that x ik can be updated according to the received information x jk .

Event-Triggered Communication.
Until now, each node of the network can send real-time information to its neighboring nodes. However, such a manner of communication will consume more resources on communication media. In particular, it is needless. Recently, the eventtriggered sampling scheme has been introduced as a more efficient substitute. Many existing works designed the event detector of each node. In this work, connections are split into n channels to transmit the corresponding level of node information. e event detector should be installed for each channel. It is utilized to determine the sampling instant of the channel. Specifically, the event condition for x ik is designed as follows: where l ∈ N, c ik > 0; h is a positive constant, which denotes the sampling period; T ik m with m ∈ N is the latest sampling instant of x ik ; and s k (t) is the synchronous state, which will be defined later. us, the next sampling instant is the time when the event condition (5) is invalid; that is, Let the first sampling instant of any x ik be 0; that is, T ik 0 � 0 for all i ∈ [1: N] and k ∈ [1: n]. Note that the event condition (5) just uses the local information of x ik . us, it can be conveniently deployed in distributed systems.

Remark 1.
e event condition (5) is designed to determine the sequence of sampling instants. When the condition is violated, it means that the difference between the current state and the last sampled state is quite large. us, the sampled data is out of date and needs to be refreshed via new sampling. Such a mechanism makes the event-triggered sampling scheme self-adjusting and flexible. e parameter c ik regulates the sampling frequency. When c ik is increasing, it becomes much harder to violate the condition, and fewer samplings will be carried out. However, it also means that less information can be used. One aim of this paper is to choose c ik as large as possible to realize the synchronization of the complex network.
Considering the event-triggering update protocol, the information of any node is invariant during its two contiguous triggered instants. e coupling term of x ik (4) becomes In this work, the complex network (1) is supposed to synchronize to a given synchronous state s(t) � [s 1 (t), s 2 (t), . . . , s n (t)] ⊤ ∈ R n , which satisfies the dynamics of a single node with a given initial state s(0); that is, Define an error system as Based on the above discussions, it can be concluded that N). us, the coupling term (4) with an event-triggering protocol (12) can be converted as

Pinning Control.
To synchronize the complex network (1) to the state s(t), the pinning controllers u i (t) will be deployed. Since the complex network is a large-scale system, it is impossible and unnecessary to control every x ik . Controlling a small part of them is sufficient to stabilize the whole network. Specifically, the pinning controller u ik (t) for x ik can be designed as follows: where d ik ≥ 0 represents the control gain. When d ik � 0, x ik is not controlled. It can be seen from (14) that the controller can only use the sampled information.
Based on (15), the pinning controller (14) can be transformed to the form of a vector:

Complex Networks with Multiple Partial and Event-Triggered
Couplings e dynamics of the error system y i (t) can be obtained from (1): Define Substituting (13) and (16) into (17), the complex network with multiple partial and event-triggered couplings can be described as where t ∈ [mh, mh + h) and m ∈ N.
4 Complexity e following definition will be needed for the derivation of our main results.

Definition 1.
e complex network (1) with multiple partial and event-triggered couplings (13) and the pinning controllers (16) is said to be globally exponential synchronization if, for any initial condition x i (0), there exist positive constants M and ϵ such that the error system (19) satisfies e error system (19) is just built for investigating couplings. In this manuscript, the couplings are split into channels. us, we should construct a new framework of error system for channels. From (19), it yields that, for ∀k ∈ [1: n], Let δy k (t) � [y 1k (t), y 2k (t), . . . , y Nk (t)] ⊤ . us, it follows from (20) that where f j (δy j (t)) � [f j (y 1j (t)), . . . , f j (y Nj (t))] ⊤ and δe k (mh) � [e 1k (mh), . . . , e Nk (mh)] ⊤ . e error system (21) rearranges channels according to their positions at each coupling, instead of the couplings they belonged to like in (19).

Main Results
e synchronization criteria will be given for complex network (1) in this section. By introducing a transformation of sampled data, a delay-dependent Lyapunov functional will be built in eorem 1, which is helpful to reduce the conservatism of our theoretical results.
. Under the event-triggered communication condition (5), the complex networks (1) with multiple partial and event-triggered couplings (19) and the pinning controllers (16) can be exponentially synchronized, if there exist positive scalars ε k , ε 1k , ε 2k n], such that the following linear matrix inequalities (LMIs) are satisfied: where Complexity 5 Proof.
anks to the Schur complement [31], it follows from (23) and (24) that 6 Complexity where Ψ k Basing on the error system (21), we can establish the Lyapunov functional ; δy k (t) is defined in (21). e rest of the proof consists of three steps. e first step will indicate the Lyapunov functional V(t) is well defined, that is, V(t) ≥ 0, and V(t) � 0 if and only if δy k (t) � 0 holds for all k ∈ [1: n]. e second step will show that V(t) is exponential convergent under conditions (22)- (24). Finally, the error system is exponential stable (19), and the complex network (1) can reach synchronization according to eorem 1.
Step 1. Well-definedness of V(t). Considering W k > 0 and the Schur complement [31], it follows that which further implies Based on the above inequality, it yields that us, it yields from (28) and (31) that Resorting to the Jensen inequality [32], it can be obtained that where τ(t) � t − mh. It follows from (32) and (33) that where P k � P k 0 * 0 and W k � W k − W k * W k . By applying the Schur complement [31], it can be obtained from (22) defined in (28) is well defined. Furthermore, there must exist a number β ∈ (0, 1) such that P k + hX k + W k > βP k . It follows from (34) that Due to P k > 0, V k (t) ≥ 0 and the equality holds if and only if deltay k (t) � 0. us, the Lyapunov functional V(t) is well defined.
Step 2. Exponential convergence of anks to the Jensen inequality [32], it can be obtained that t mh δy . k (s) δy k (mh) where ϕ(t) � 1/τ(t) t mh δy . k (s)ds. Based on the Newton-Leibnitz formula, we can have From (21), one has that 8 Complexity Based on the Lipschitz condition (2), we have that Considering the event condition (5), we can have that Generally, it yields for any moment t � mh (m ∈ N) that holds for any m ∈ N, i ∈ [1: N], and k ∈ [1: n], which further implies that where Γ k � diag c 1k , c 2k , . . . , c Nk and ε k can be any positive number. Combining (36)-(44), we have that where η k (t) � [δy k (t)δy k (mh)δy (26) and (27), one can always find a sufficiently small positive number ε such that _ V(t) + εV(t) < 0 holds for ∀t ∈ [mh, (m + 1)h). Solving the differential equation, we have us, the Lyapunov functional V(t) is exponential convergence.
Step 3. Exponential synchronization of complex network (1). Considering the error system (19), we have that Based on Definition 1, the complex network (1) with multiple partial and event-triggered couplings (13) and the pinning controllers (16) is exponential synchronization. is completes the proof. □ Remark 2. Most existing results studied the macro-level connections among nodes. In this work, only a part of the channel of a node can communicate. us, the micro-level connections among nodes should also be investigated. A feasible method is to build an augmented system to contain both macro and micro connections. However, it will lead to a large-dimension stabilization condition, which is hard to be verified. An alternative way is to rearrange neurons. Equation (21) collects all the channels which have the same index of each node, instead of the channels that belonged to the same node like equation (1). e complex network (13) is rearranged as n subsystems. By establishing the Lyapunov functional (21) for each subsystem, the stabilization condition with smaller dimensions can be obtained. e time-dependent Lyapunov functional is constructed in eorem 1 to deal with the sampled information. is method was introduced in [33] and improved in [34]. ese Lyapunov functionals do not grow after the sampling instants. us, the conservatism of the main results can be reduced further. To show this fact, the following theorem is derived, in which a time-independent Lyapunov functional is established.

Theorem 2.
e complex networks (1) with multiple partial and event-triggered couplings (13) and the pinning controllers (16) can achieve exponential synchronization if there exist positive scalars ε k , ε 1k , ε 2k and matrices P k > 0, Q k > 0, R k > 0, V 1k , V 2k , S 1k , S 2k , U 1k , U 2k , k ∈ [1: n], such that the following LMIs are satisfied: where Proof. Consider the following Lyapunov functional e Newton-Leibniz formula gives that where m � max m ∈ N|mh < t { }. Adding the left side of (51) and (52) into (50) yields 10 Complexity k (θ). Considering (39), the Lipschitz assumption of function f (40) and (41), and the event condition (44), it yields that where anks to the Schur complement [31], the negative definiteness of Ξ k can be guaranteed by (47). us, _ V k (t) < 0. By using the same derivation in eorem 1, it can be concluded that the complex network (1) with multiple partial and event-triggered couplings (13) and the pinning controllers (16) can realize exponential synchronization according to Definition 1. is completes the proof.

Simulations
In this section, a simulative example will be built to illustrate the efficiency and effectiveness of the proposed synchronization criteria. In particular, a comparison will be presented to show how much conservatism can be reduced by eorem 1.
A complex network with four nodes (N � 4) is considered, each of which has three levels of information (n � 3). e parameters for each node are _ Complexity e function F k satisfies the Lipschitz condition (2) with the Lipschitz constants L k � 1 (k ∈ [1: 3]). e coupling strength of the complex network is α � 0.35; G is the Laplacian matrix of the connections among nodes. e trajectory of the synchronous state s(t) with the initial state s(0) � [− 1, 0, 1] ⊤ is depicted in Figure 1.
For any pair of adjacent nodes, only a part of levels of information can communicate, which leads to partial couplings. Furthermore, the layers of couplings are duplex (Q � 2) in this example. us, two diagonal matrices are employed for each connection, that is, g ij > 0. ey are listed as follows: For each channel, an event condition (5)  By using the MATLAB LMI toolbox, the synchronization criteria (22)-(24) have a feasible solution. Based on eorem 1, the constructed complex network (1) with multiple partial and event-triggered couplings (13) and the pinning controllers (16) can achieve synchronization. To show this fact, a simulation is given. e initial state x i (0) is randomly chosen from the interval [− 5, 5]. Figure 2 displays the trajectories of the error system (19) of the complex network. It can be found that all errors y i (t) (i ∈ [1: 4]) tend to 0, which means that the synchronization can be realized.
To show the superiority of the event-triggered communication, we compare it with the time-triggered communication. Let M ik (t) be the number of times that the event condition (5) is violated for x ik . at is, (8). If the complex network samples information for every 0.2 interval, the total sampling number of the whole network at time t would be 12 × ⌊t/0.2⌋, where ⌊x⌋ is the floor function, that is, the greatest integer less than or equal to x. Let R(t) be ratio between the number of the event-triggered sampling and that of the time-triggered sampling number: (58) Figure 3 shows the trajectory of R(t) for t ≤ 20. It can be seen that R(t) decreases rapidly and stabilizes around 53%. It indicates that the event-triggered sampling scheme can save near half of the communication resources. is is a great advantage to its time-triggered counterpart.
Finally, we will compare the conservatism of conditions in eorems 1 and 2. Assume that all x ik have the same c for the event condition (5), that is, c ik � c (i ∈ [1: 4], k ∈ [1: 3]). By changing the sampling period h, we try to find the maximum c which allows the existence of feasible solutions for two theorems. As discussed in Remark 1, larger c makes the event harder to be triggered. It means that the complex network can be synchronized with less frequent sampling and then has less conservatism. Figure 4 shows the maximum cs which can be found in eorems 1 and 2. It can be seen that, for any fixed h, c for eorem 1 (the solid curve) is larger than the one for eorem 2 (the dashed curve), especially when the sampling period h is increasing. us, eorem 1 has less conservatism than eorem 2. It is the merit of the delay-dependent Lyapunov functional (28).

Conclusion
e pinning synchronization problem of complex networks with multiple partial and event-triggered couplings has been studied in this paper. An event detector has been designed for every level of information of each node to decide the sampling instants. Furthermore, only a part of channels of connections can communicate with neighboring nodes.
us, partial information of each node is available. Furthermore, couplings have multiple layers to transmit various kinds of information. To synchronize the complex network, the pinning control method has been used. e control input can only utilize the sampled information. Based on a rearrangement of the channels of couplings, a delay-dependent Lyapunov functional has been constructed. e synchronization criteria have been proposed with less conservatism, which is demonstrated by a numerical example.

Data Availability
e data used to support the findings of this study are available from the corresponding author upon request.

Conflicts of Interest
e authors declare that they have no conflicts of interest.