Abstract
In this paper, pinning synchronization of complex networks with sign inner-coupling configurations is investigated from a moment-based analysis approach. First, two representative non-linear systems with varying dynamics parameters are presented to illustrate the bifurcation of the synchronized regions. The influence of sign inner-coupling configurations on network synchronizability is then studied in detail. It is found that adding negative parameters in the inner-coupling matrix can significantly enhance the network synchronizability. Furthermore, the eigenvalue distribution of the coupling and control matrix in the pinned network is estimated using the spectral moment analysis. Finally, numerical simulations are given for illustration.
1 Introduction
Synchronization is a typical collective behavior in complex networks [1–5]. In the past two decades, the issues of synchronization, control, and optimization in complex network systems have become focal subjects in network science and engineering [6–31], and numerous works have been reported on such topics as complete synchronization [6], near-synchronization [32], phase synchronization [33], bounded synchronization [34], fixed-time synchronization [35, 36], heterogeneous node dynamics [37], multiplex networks [38], time-delay systems [39–41], and time-varying networks [42, 43].
It has been demonstrated that the local stability of a complex dynamical network under the pinning control can be converted into two independent sub-problems: identifying the synchronized regions of the pinned network and analyzing the scaled eigenvalues of the coupling and control matrix [44]. On one hand, the bifurcation behavior of the synchronized regions has been observed in complex networks with varying node parameters [39, 40, 45]. Various rich bifurcation patterns of the synchronized regions have been found in the pioneer work [45]. On the other hand, the moment-based analysis approach [46–48] has been introduced to successfully estimate the eigenvalue distribution of the coupling and control matrix [49]. Therein, without performing explicit eigenvalue decomposition, the eigenvalue distribution can be estimated only from the network structural parameters and the control mechanism.
It is worth noting that most of the above-reviewed works on network synchronization assume that the inner-coupling matrix consists of zeros and positive parameters. However, less attention has been paid to the case that the elements in the inner-coupling matrix are negative [50]. Interestingly, negative interactions among the nodes will lead to the enhancement of the synchronization in complex networks [51]. Moreover, a recent work on network controllability has revealed that adding negatively-weighted edges in a signed network can significantly change its average controllability [52]. Indeed, in real-world scenarios, it is more reasonable and accurate to model a complex system using a network with both negative and positive weights on edges. For instance, in social networks, positive edge weights can denote the relations of like and friendships, while negative edge weights on can represent the relations of dislike and foe [53]. Inspired by these observations, a sign inner-coupling matrix with positive and negative parameters is introduced to denote the cooperation and competition relationships, respectively, between the node variables.
The main contributions of this paper are two-fold. First, the influence of sign inner-coupling configurations on network synchronizability is studied. The interesting bifurcation behavior of the synchronized regions is observed in the pinned network with a varying node dynamics parameter. It is shown that the network synchronizability can be improved by adding negative parameters in the inner-coupling matrix, while blindly adding inner-coupling elements with positive parameters may weaken it. This finding provides a good alternative to optimize the network synchronizability. Second, the eigenvalue distribution of the pinned network is analyzed from the moment-based approach. The analytical expressions of the spectral moments for a globally coupled network and a nearest-neighbor coupled network are derived, respectively. It is found that the expected moments depend not only on the structural parameters of the network but also on the control mechanism. The derived expected moments are then used to estimate the eigenvalue distribution. Numerical examples demonstrate the efficiency of the proposed spectral estimation method.
The rest of the paper is organized as follows. Notation and preliminaries are given in Section 2. The influence of sign inner-coupling configurations on network synchronizability is investigated in Section 3. In Section 4, the estimation of the eigenvalues of the coupling and control matrix for two representative regular networks is provided. Section 5 shows the numerical results. Finally, Section 6 concludes the paper.
2 Notation and preliminaries
2.1 Notation
Throughout the paper, let denote the set of real numbers, the vector space of n-dimensional real vectors, and the set of m × n real matrices. Let Im be an m × m identity matrix and diag{a1, a2, …, an} an n × n diagonal matrix. Let ⊗ indicate the Kronecker product and tr(A) the trace of matrix A.
2.2 Graph theory
Let be an undirected graph with a node set and an edge set . A path between two nodes, say i and j, is given by the node sequence v1, v2, …, vk, where v1 = i, vk = j, and . An undirected graph is connected if, for any two nodes, there exists a path connecting them. Let denote the adjacency matrix of the undirected graph . If there is an edge between nodes i and j, then Aij = Aji = 1, and Aij = 0 (j ≠ i) otherwise. The degree of node i is the number of edges directly connected to it and can be denoted by . The degree sequence of is the list of node degrees, denoted by {d1, d2, …, dN}. The degree matrix is, thus, defined as D = diag{d1, d2, …, dN}. The corresponding Laplacian matrix is given by L = D − A.
2.3 Problem statement
We consider a complex dynamical network of N nodes described bywhere is the state vector of node i. The non-linear function F(⋅) is continuously differentiable denoting the self-dynamics of the nodes. σ > 0 is the global coupling strength. The matrix describes the inner-coupling of the state variables of nodes, while the Laplacian matrix describes the outer-coupling among the nodes. We assume that the network is undirected and connected. If there is a connection between node i and node j, then Lij = Lji = −1; otherwise, Lij = Lji = 0 (j ≠ i). In addition, the diagonal elements of L are given bywhich satisfy the diffusion condition . It can be verified that L is a symmetric and diagonalizable matrix.
Suppose that all the nodes have a common equilibrium , satisfying . In order to synchronize network (1) at the state , pinning control is applied. The pinned network is, thus, described as follows:where the variable δi denotes whether node i is under control. If control is directly applied to node i, then δi = 1 with bi = b > 0, otherwise δi = bi = 0. Here, b denotes the feedback gain to be designed. Let l (1 ≤ l < N) be the number of pinned nodes. Therefore, ∑iδi = l.
Let and . Linearizing system (3) at leads to the following error system:where is the Jacobian matrix of F(⋅) evaluated at , C = L + B is the coupling and control matrix, and B = diag{b1, b2, …, bN} is the feedback gain matrix.
It is worth noting that the matrix C is a real symmetric matrix, which can be written as Λ = Φ−1CΦ, where Λ = diag{λ1, λ2, …, λN} with λi, i = 1, 2, …, N being the eigenvalues of C, and the columns of Φ are the set of the corresponding eigenvectors. It can be verified that the eigenvalues of the matrix and those of are identical. For convenience, let αi = σλi, i = 1, 2, …, N. It has been demonstrated in the literature that the local stability of the pinned network (3) is determined by the following generic system [49]:where η(t) is a new auxiliary variable.
λm(α) denotes the maximal real part of the eigenvalues of . The synchronized region is defined as the range of α with λm(α) < 0. The synchronization will be achieved if all the eigenvalues of σC are located inside .
In summary, pinning synchronization in network (3) is separated into two sub-problems: 1) identifying the synchronized regions and 2) analyzing the eigenvalue distribution of σC. Previous works on the types and bifurcation behavior of synchronized regions assume that the elements in the inner-coupling matrix are either zeros or positive parameters. Here, a zero indicates the absence of a relation between some state variables of nodes, while a positive parameter characterizes the cooperative relationship between two corresponding state variables. However, less attention has been paid to the case of negative or competitive interactions between node variables. In this paper, a more general inner-coupling matrix including negative parameters is considered.
Definition 1If the elements of matrix H consist of the symbols +, −, and 0, H is then called the sign pattern matrix [50].For example,is called a sign pattern matrix, in which 0, +, and − represent zero, positive, and negative parameters, respectively.If the state variables of nodes are coupled through a sign pattern matrix, the networked system is said to have a sign inner-coupling configuration. Without loss of generality, in what follows, the elements of H are denoted by 1, −1, and 0, where “1” indicates cooperative relationship, “−1” indicates competitive relationship, and “0” indicates that there is no relation between some state variables of nodes.
3 Bifurcation of the synchronized regions
In this section, the influence of sign inner-coupling configurations on network synchronizability is studied in detail. In particular, two representative non-linear systems with varying parameters are given to illustrate the bifurcation of the synchronized regions.
3.1 Lü system
A single Lü system [54] is described aswhere β = 3 and γ = 20. Obviously, is an equilibrium point of the aforementioned Lü system, and the Jacobian matrix of the system is as follows:
In what follows, three different types of inner-coupling matrices are considered.
(i) When the inner-coupling matrix is chosen asthe corresponding characteristic equation is obtained as follows:
One has λ1 = −3 < 0. If a − 20 > 0 and −α2 + (2a + 20)α − 20a > 0, then λ2,3 < 0; that is, the pinned network can synchronize at . Here, the boundary curves of the synchronized region are represented by , , and a > 20. In this situation, the synchronized region of the Lü system with varying dynamics parameter a and its boundary curves are given as shown in Figure 1A. The cyan-shaded area denotes the synchronized region in which λm(α) < 0. The magenta line denotes the corresponding boundary curve. These notations will be used for Figures 1B, C and Figure 2.
FIGURE 1
FIGURE 2
(ii) When the inner-coupling matrix is chosen asthe corresponding characteristic equation is obtained as follows:
One has λ1 = −3 < 0. If a − 20 > 0 and −2α2 + (2a + 20)α − 20a > 0, then λ2,3 < 0; that is, the pinned network can synchronize at . Here, the boundary curves of the synchronized region are represented by , and a > 20. In this situation, the synchronized region of the Lü system with varying dynamics parameter a and its boundary curves are given as shown in Figure 1B.
(iii) When the inner-coupling matrix is chosen asthe corresponding characteristic equation is obtained as follows:
One has λ1 = −3 < 0. If a − 20 > 0 and (2a + 20)α − 20a > 0, then λ2,3 < 0; that is, the pinned network can synchronize at . Here, the boundary curves of the synchronized region are represented by and a > 20. In this situation, the synchronized region of the Lü system with varying dynamics parameter a and its boundary curves are given as shown in Figure 1C.
Figure 1 shows the synchronized regions of Lü system for three different sign inter-coupling matrices. Table 1 further summarizes the synchronized regions for three specific values of a. It can be observed from Figures 1A, B that the synchronized region switches from “empty set” to “bounded region” with the increase in the dynamics parameter a, while in Figure 1C, the synchronized region switches from “empty set” to “unbounded region.”
TABLE 1
| a | Hl1 | Hl2 | Hl3 |
|---|---|---|---|
| 36 | (8.64, 83.36) | (10, 36) | (7.83, ∞) |
| 46 | (8.93, 103.07) | (10, 46) | (8.21, ∞) |
| 56 | (9.11, 122.89) | (10, 56) | (8.48, ∞) |
Synchronized regions of the Lü system under different sign inter-coupling matrices.
3.2 Unified chaotic system
A single unified chaotic system [55] is described aswhere a ∈ [0, 1]. Obviously, is an equilibrium point of the aforementioned unified chaotic system, and the Jacobian matrix of the system is as follows:
Then, we consider the following three types of different inner-coupling matrices:
(i) We set the inner-coupling matrix as
The corresponding characteristic equation is obtained as follows:
One obtains . If 11 − 4a + α > 0 and (29 − 64a)α − (25a + 10)(27 − 6a) > 0, then λ2,3 < 0; that is, the pinned network can synchronize at . Here, the boundary curve of the synchronized region is represented by α0 = (25a + 10)(27 − 6a)/29 − 64a. When the inner-coupling matrix is set as Hu1, the synchronized region of unified chaotic system with varying dynamics parameter a and its boundary curve are illustrated in Figure 2A.
(ii) We set the inner-coupling matrix as
The corresponding characteristic equation is obtained as follows:
One has . If 11 − 4a + α > 0 and −α2 − (39a − 39)α − (25a + 10)(27 − 6a) > 0, then λ2,3 < 0; that is, the pinned network can synchronize at . Here, the boundary curves of the synchronized region are represented by , . When the inner-coupling matrix is set as Hu2, the synchronized region of the unified chaotic system with varying dynamics parameter a and its boundary curves are shown in Figure 2B.
(iii) We set the inner-coupling matrix as
The corresponding characteristic equation is obtained as
One has . If 11 − 4a + α > 0 and α2 + (19 − 89a)α − (25a + 10)(27 − 6a) > 0, then λ2,3 < 0; that is, the pinned network can synchronize at . Here, the boundary curves of the synchronized region are represented by and . When the inner-coupling matrix is set as Hu3, the synchronized region of the unified chaotic system with varying dynamics parameter a and its boundary curves are shown in Figure 2C.
Figure 2 shows the synchronized regions of the unified chaotic system for three different sign inter-coupling matrices. Table 2 further summarizes the synchronized regions for three specific values of a. It can be observed from Figures 2A, C that the synchronized region switches from “unbounded region” to “empty set” with the increase in the dynamics parameter a, while in Figure 2B, the synchronized region switches from “bounded region” to “empty set.”
TABLE 2
| a | Hu1 | Hu2 | Hu3 |
|---|---|---|---|
| 0.05 | (11.64, ∞) | (11.99, 25.07) | (11.64, ∞) |
| 0.15 | (18.5, ∞) | ∅ | (16.325, ∞) |
| 0.25 | (31.88, ∞) | ∅ | (21.97, ∞) |
Synchronized regions of the unified chaotic system under different sign inter-coupling matrices.
In summary, there exist bifurcation phenomena in the synchronized regions of complex networks for some specific inner-coupling matrices. The synchronized region can evolve with the varying node dynamics parameter and switch from one type to another type.
Given the node dynamics, the larger the range of the synchronized region corresponding to the sign inner-coupling matrix, the easier it is for the network to achieve synchronization. From the aforementioned simulations, the following conclusions can be drawn:
(i) From Figure 1, it can be seen that when the inner-coupling matrix is chosen as Hl2, the synchronized region is smaller than that of Hl1. In Figure 2, when the inner-coupling matrix is chosen as Hu2, the synchronized region is smaller than that of Hu1. It can be seen that Hl2 and Hu2 add a cooperative inner-coupling element to Hl1 and Hu1, respectively. This means that blindly adding positive parameters in the inner-coupling matrix may weaken the synchronizability of the network.
(ii) From Figure 1, it can be seen that when the inner-coupling matrix is chosen as Hl3, a larger synchronized region is obtained compared to Hl1. From Figure 2, it can be seen that when the inner-coupling matrix is chosen as Hu3, a larger synchronized region is obtained compared to Hu1. It can be observed that Hl3 and Hu3 add a competitive inner-coupling element to Hl1 and Hu1, respectively. This implies that the network synchronizability can be significantly enhanced by adding a small number of negative parameters in the inner-coupling matrix.
Remark 1It should be pointed out that although numerical simulations are performed with the aforementioned two chaotic systems, the extension to other general systems is straightforward.
Remark 2Recall that the bifurcation behavior of the synchronized regions in a network with a varying node dynamics parameter is analyzed in this section. The assumption that all the nodes have a common equilibrium can ensure that the boundary curves of the synchronized region can be analytically derived. It is found that the boundary curves of the synchronized region are related to the varying node dynamics parameter.
4 Spectral analysis of pinned networks
In this section, the spectral moment method [46] is applied to estimate the eigenvalues of C [49].
4.1 Spectral moments of the matrix C
The nth-order spectral moment of C is defined as
The first three spectral moments of C can be obtained as follows:where bi is the feedback gain, di is the degree of node i, and ti is the number of triangles touching node i.
4.2 Globally coupled network
We consider a globally coupled network composed of N nodes, in which any two nodes are directly connected by an edge. The degree distribution of nodes of the globally coupled network is
The first three expected moments of node degree are obtained by
The number of connected triples centered on any node in the globally coupled network is
When the pinned nodes are consecutively distributed in the network, the first three expected moments of C can, thus, be derived as
Example 1. We consider a globally coupled network of N = 17 nodes. Here, only l = 4 consecutively distributed nodes are pinned with b = 10.4. Table 3 compares the numerical values of the moments of C with the analytical predictions in (13). It shows that the analytical expectations of the moments are exactly the same as the numerical realizations.
TABLE 3
| Moment order | 1st | 2nd | 3rd |
|---|---|---|---|
| Numerical realization | 18.52 | 379.5 | 8259.71 |
| Analytical expectations | 18.52 | 379.5 | 8259.71 |
| Relative error | 0 | 0 | 0 |
Moments for a globally coupled network.
4.3 Nearest-neighbor coupled network
Consider a nearest-neighbor coupled network of N nodes, in which each node is only connected to its 2k nearest-neighbor nodes. The degree distribution of nodes of the nearest-neighbor coupled network is
Then, one obtains the first three expected moments of node degree as follows:
The number of connected triples centered on any node in the network is
When the pinning nodes are uniformly distributed in the network, the first three expected moments of C are then obtained by
Example 2. We consider a nearest-neighbor coupled network with N = 200 and k = 6. It is assumed that l = ∑iδi = 20 uniformly distributed nodes are pinned with i = 1, 11, …, 191. We set b = 11.7. Table 4 compares the numerical values of the moments with the analytical predictions in (17). It shows clearly that the analytical expectations of the moments are suited to capture the spectral property of the matrix C.
TABLE 4
| Moment order | 1st | 2nd | 3rd |
|---|---|---|---|
| Numerical realization | 13.17 | 197.77 | 3270.53 |
| Analytical expectations | 13.17 | 197.77 | 3228.53 |
| Relative error | 0 | 0 | 1.3% |
Moments for a nearest-neighbor coupled network.
Remark 3In this paper, the spectral moment method is extended to the aforementioned two kinds of regular networks. The relationship between the lower-order expected moments and the local structural properties, control scheme including feedback gain and the number of pinned nodes, together with their distributions (i.e., the positions of pinned nodes in the whole network), is established. Note that other network models, such as ER random networks, Chung-Lu random networks, and NW small-world networks, have been given to verify the efficiency of the moment-based estimation method [49].
4.4 Triangular reconstruction of matrix C
In this section, the triangular reconstruction method [56] is generalized to estimate the bounds of the eigenvalues.
We define a triangular distribution T(λ) based on a set of abscissas p1 ≤ p2 ≤ p3 aswith h = K/(p3 − p1) and K > 0. The expected moments of C are obtained as follows:
For simplicity, we use to represent . The aim is to find a set of abscissas {p1, p2, p3} so as to fit a given set of expected moments . Using the symmetries of the polynomials, the values of {p1, p2, p3} can be determined as roots of the polynomialwith
Example 3. We consider again a 17-node globally coupled network (as shown in Example 1) and a 200-node nearest-neighbor coupled network (as shown in Example 2), respectively. For the globally coupled network, the abscissas for the triangular function are p1 = 1.4359, p2 = 26.1860, and p3 = 27.9311 with h = 20/(p3 − p1). For the nearest-neighbor coupled network, the abscissas for the triangular function are p1 = 0.5547, p2 = 14.3239, and p3 = 24.6314 with h = 3/(p3 − p1). Figures 3, 4 show the eigenvalue histograms of C and triangular approximations for the globally coupled network and the nearest-neighbor coupled network, respectively. The ordinate μ(λ) denotes the percentage of the eigenvalue with a certain value in all eigenvalues. It can be seen from Figures 3, 4 that the triangular function can well fit the eigenvalue distribution of the matrix C.
FIGURE 3
FIGURE 4
5 Numerical results
We consider the globally coupled network in Example 1 and set the Lü system as the node dynamics. When the node dynamics parameter a = 36 and the inner-coupling matrix is chosen as Hl3, it can be obtained from Table 1 that the corresponding synchronized region of the Lü system is (7.83, ∞). According to Example 3, and are good estimations of the lower and upper bounds of the eigenvalues, respectively. The 17-node globally coupled network of Lü systems can achieve synchronization if . Figures 5A, B show the evolution of the node states with σ = 5∉(5.45, ∞) and σ = 6 ∈ (5.45, ∞), respectively. The numerical results are in good agreement with the theoretical results.
FIGURE 5
We consider the nearest-neighbor coupled network in Example 2 and set the unified chaotic system as the node dynamics. When the parameter a = 0.05 and the inner-coupling matrix is set as Hu3, it can be obtained from Table 2 that the corresponding synchronized region of the unified chaotic system is (11.64, ∞). From Example 3, and are the bound estimations of the eigenvalues. The nearest-neighbor coupled network of unified chaotic systems can achieve synchronization if . Figures 6A, B show the evolution of the node states with σ = 15∉(20.98, ∞) and σ = 22 ∈ (20.98, ∞), respectively. The numerical simulations are in good agreement with the theoretical results.
FIGURE 6
6 Conclusion
In this paper, pinning synchronization of complex networks with sign inner-coupling configurations has been investigated. The bifurcation behavior of the synchronized regions has been observed, and the effect of sign inner-coupling configurations on network synchronizability has been studied in detail. It is shown that the synchronized region can evolve with the varying node dynamics parameter and switch from one type to another type. It is also found that the network synchronizability can be significantly improved by adding negative parameters in the inner-coupling matrix, while blindly adding inner-coupling elements with positive parameters may weaken it. The expected moments of C for the globally coupled network and nearest-neighbor coupled network have been derived. The shape of the eigenvalue distribution of C for each of the aforementioned regular networks can, thus, be estimated to predict pinning synchronization of the network.
It is worth noting that the obtained results in this paper can be generalized to handle control problems with directed topologies or switching topologies. However, directed topology implies that the network is not symmetric, and switching topology means that the network is time-varying. From a technical perspective, this introduces more challenges than its undirected and time-invariant counterpart. In the future, it will be interesting to study the higher-order moments of the matrix C and their corresponding fitting functions. Moreover, pinning synchronization of multiplex networks with time delays [57, 58], noise [59], and disturbances [60, 61] is more challenging but worthy of deep investigation.
Statements
Data availability statement
The original contributions presented in the study are included in the article/Supplementary Material; further inquiries can be directed to the corresponding author.
Author contributions
All authors designed and conducted the research. YY and LX performed the analytical and numerical calculations. YY, LX, BL, and CX were the lead writers of the manuscript. All authors read and approved the final manuscript.
Funding
This work was supported in part by the National Natural Science Foundation of China (Nos. 61973064 and 62173355), Natural Science Foundation of Tianjin (No. 22JCZDJC00550), and Natural Science Found ation of Hebei Province of China (Nos. F2022501024 and F2019501126).
Conflict of interest
The authors declare that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.
Publisher’s note
All claims expressed in this article are solely those of the authors and do not necessarily represent those of their affiliated organizations, or those of the publisher, the editors, and the reviewers. Any product that may be evaluated in this article, or claim that may be made by its manufacturer, is not guaranteed or endorsed by the publisher.
References
1.
ChenG. Pinning control of complex dynamical networks. IEEE Trans Consum Electron (2022) 68(4):336–43. 10.1109/tce.2022.3200488
2.
ChenG. Searching for best network topologies with optimal synchronizability: A brief review. IEEE/CAA J Autom Sin (2022) 9(4):573–7. 10.1109/jas.2022.105443
3.
ChenG. Pinning control and synchronization on complex dynamical networks. Int J Control Autom Syst (2014) 12:221–30. 10.1007/s12555-014-9001-2
4.
TangYJinXShiYDuW. Event-triggered attitude synchronization of multiple rigid body systems with velocity-free measurements. Automatica (2022) 143:110460. 10.1016/j.automatica.2022.110460
5.
WuYLiuLHuJFengG. Adaptive antisynchronization of multilayer reaction-diffusion neural networks. IEEE Trans Neural Networks Learn Syst (2018) 29(4):807–18. 10.1109/tnnls.2017.2647811
6.
PecoraLMCarrollTL. Master stability functions for synchronized coupled systems. Phys Rev Lett (1998) 80:2109–12. 10.1103/physrevlett.80.2109
7.
WenGYuWHuGCaoJYuX. Pinning synchronization of directed networks with switching topologies: A multiple lyapunov functions approach. IEEE Trans Neural Networks Learn Syst (2015) 26(12):3239–50. 10.1109/tnnls.2015.2443064
8.
YuFShenHYuQKongXKumar SharmaPCaiS. Privacy protection of medical data based on multi-scroll memristive Hopfield neural network. IEEE Trans Netw Sci Eng (2023) 10(2):845–58. 10.1109/tnse.2022.3223930
9.
YuFKongXMokbelAAMYaoWCaiS. Complex dynamics, hardware implementation and image encryption application of multiscroll memeristive Hopfield neural network with a novel local active memeristor. IEEE Trans Circuits Systems-II: Express Briefs (2023) 70(1):326–30. 10.1109/tcsii.2022.3218468
10.
WanQLiFChenSYangQ. Symmetric multi-scroll attractors in magnetized Hopfield neural network under pulse controlled memristor and pulse current stimulation. Chaos, Solitons Fractals (2023) 169:113259. 10.1016/j.chaos.2023.113259
11.
WangFNiYLiuZChenZ. Containment control for general second-order multiagent systems with switched dynamics. IEEE Trans Cybern (2020) 50(2):550–60. 10.1109/tcyb.2018.2869706
12.
JiangYWangFLiuZChenZ. Composite learning adaptive tracking control for full-state constrained multiagent systems without using the feasibility condition. IEEE Trans Neural Networks Learn Syst (2022) 1–13. 10.1109/tnnls.2022.3190286
13.
XiaCHuZZhaoD. Costly reputation building still promotes the collective trust within the networked population. New J Phys (2022) 24:083041. 10.1088/1367-2630/ac8898
14.
LiCFengBLiSKurthsJChenG. Dynamic analysis of digital chaotic maps via state-mapping networks. IEEE Trans Circuits Syst Regular Pap (2019) 66(6):2322–35. 10.1109/tcsi.2018.2888688
15.
FengJZhangLWangJZhaoY. The synchronization of complex dynamical networks with discontinuous dynamics and exogenous disturbances. Asian J Control (2021) 23(6):2837–48. 10.1002/asjc.2414
16.
LiaoHMarianiMSMedoMZhangY-CZhouM-Y. Ranking in evolving complex networks. Phys Rep (2017) 689:1–54. 10.1016/j.physrep.2017.05.001
17.
ZhouM-YZhuoZLiaoHFuZ-QCaiS-M. Enhancing speed of pinning synchronizability: Low-degree nodes with high feedback gains. Sci Rep (2015) 5:17459. 10.1038/srep17459
18.
RuanXFengJXuCWangJZhaoY. Dynamic event-triggered pinning synchronization for switched impulsive complex networks with asynchronous switching. IEEE Trans Circuits Syst Express Briefs (2022) 69(4):2211–5. 10.1109/tcsii.2021.3123285
19.
ChenFChenJ. Minimum-energy distributed consensus control of multi-agent systems: A network approximation approach. IEEE Trans Autom Control (2020) 65(3):1144–59. 10.1109/tac.2019.2917279
20.
ChenFFengGLiuLRenW. Distributed average tracking of networked Euler-Lagrange systems. IEEE Trans Autom Control (2015) 60(2):547–52. 10.1109/tac.2014.2343111
21.
WenGYuXYuWLüJ. Coordination and control of complex network systems with switching topologies: A survey. IEEE Trans Syst Man, Cybern Syst (2021) 51(10):6342–57. 10.1109/tsmc.2019.2961753
22.
ChenKHeWHanQ-LXueMTangY. Leader selection in networks under switching topologies with antagonistic interactions. Automatica (2022) 142:110334. 10.1016/j.automatica.2022.110334
23.
YiXYangTWuJJohanssonKH. Distributed event-triggered control for global consensus of multi-agent systems with input saturation. Automatica (2019) 100:1–9. 10.1016/j.automatica.2018.10.032
24.
WangXChenG. Synchronization in scale-free dynamical networks: Robustness and fragility. IEEE Trans Circuits Syst Fundam Theor Appl (2002) 49(1):54–62. 10.1109/81.974874
25.
BarahonaMPecoraLM. Synchronization in small-world systems. Phys Rev Lett (2002) 89(5):054101. 10.1103/physrevlett.89.054101
26.
LiXWangXChenG. Pinning a complex dynamical network to its equilibrium. IEEE Trans Circuits Syst Regular Pap (2004) 51(10):2074–87. 10.1109/tcsi.2004.835655
27.
WangXChenG. Pinning control of scale-free dynamical networks. Physica A: Stat Mech its Appl (2002) 310(3-4):521–31. 10.1016/s0378-4371(02)00772-0
28.
Moradi AmaniAJaliliMYuXStoneL. Finding the most influential nodes in pinning controllability of complex networks. IEEE Trans Circuits Syst Express Briefs (2017) 64(6):685–9. 10.1109/tcsii.2016.2601565
29.
LiuHXuXLuJ-AChenGZengZ. Optimizing pinning control of complex dynamical networks based on spectral properties of grounded Laplacian matrices. IEEE Trans Syst Man, Cybern Syst (2021) 51(2):786–96. 10.1109/tsmc.2018.2882620
30.
ShaoSCaoJHuYLiuX. Prespecified-time distributed synchronization of Lur’e networks with smooth controllers. Asian J Control (2022) 24(1):125–36. 10.1002/asjc.2422
31.
HeSWangHYuW. Distributed fast finite-time tracking consensus of multi-agent systems with a dynamic leader. IEEE Trans Circuits Syst Express Briefs (2022) 69(4):2176–80. 10.1109/tcsii.2021.3125700
32.
SunJBolltEMNishikawaT. Master stability functions for coupled nearly identical dynamical systems. EPL (2016) 85(6):60011. 10.1209/0295-5075/85/60011
33.
ZhouCKurthsJ. Noise-induced phase synchronization and synchronization transitions in Chaotic oscillators. Phys Rev Lett (2002) 88:230602. 10.1103/physrevlett.88.230602
34.
ZhuSZhouJYuXLuJ-A. Bounded synchronization of heterogeneous complex dynamical networks: A unified approach. IEEE Trans Autom Control (2021) 66(4):1756–62. 10.1109/tac.2020.2995822
35.
LiuXHoDSongQXuW. Finite/fixed-time pinning synchronization of complex networks with stochastic disturbances. IEEE Trans Cybern (2019) 49(6):2398–403. 10.1109/tcyb.2018.2821119
36.
LiNWuXFengJXuYLüJ. Fixed-time synchronization of coupled neural networks with discontinuous activation and mismatched parameters. IEEE Trans Neural Networks Learn Syst (2021) 32(6):2470–82. 10.1109/tnnls.2020.3005945
37.
XiangJChenG. On the V-stability of complex dynamical networks. Automatica (2007) 43(6):1049–57. 10.1016/j.automatica.2006.11.014
38.
TangLWuXLüJLuJ-AD’SouzaRM. Master stability functions for complete, intralayer, and interlayer synchronization in multiplex networks of coupled Rössler oscillators. Phys Rev E (2019) 99(1):012304. 10.1103/physreve.99.012304
39.
TangLLuJ-ALüJWuX. Bifurcation analysis of synchronized regions in complex dynamical networks with coupling delay. Int J Bifurcation Chaos (2014) 24(1):1450011. 10.1142/s0218127414500114
40.
TangLWuXLüJLuJ-A. Bifurcation behaviors of synchronized regions in logistic map networks with coupling delay. Chaos (2015) 25:033101. 10.1063/1.4913854
41.
YaoWWangCSunYZhouC. Robust multimode function synchronization of memristive neural networks with parameter perturbations and time-varying delays. IEEE Trans Syst Man, Cybern Syst (2022) 52(1):260–74. 10.1109/tsmc.2020.2997930
42.
GhoshDFrascaMRizzoAMajhiSRakshitSAlfaro-BittnerKet alThe synchronized dynamics of time-varying networks. Phys Rep (2022) 949:1–63. 10.1016/j.physrep.2021.10.006
43.
WenGZhengW. On constructing multiple Lyapunov functions for tracking control of multiple agents with switching topologies. IEEE Trans Autom Control (2019) 64(9):3796–803. 10.1109/tac.2018.2885079
44.
XiangLChenFChenG. Synchronized regions of pinned complex networks: Spectral analysis. Nonlinear Dyn (2014) 78(3):1609–28. 10.1007/s11071-014-1538-3
45.
TangLLuJ-ALüJYuX. Bifurcation analysis of synchronized regions in complex dynamical networks. Int J Bifurcation Chaos (2012) 22(11):1250282. 10.1142/s0218127412502823
46.
PreciadoVMVergheseGC. Low-order spectral analysis of the Kirchhoff matrix for a probabilistic graph with a prescribed expected degree sequence. IEEE Trans Circuits Syst Regular Pap (2009) 56(6):1231–40. 10.1109/tcsi.2009.2023758
47.
PreciadoVMJadbabaieAVergheseGC. Structural analysis of Laplacian spectral properties of large-Scale networks. IEEE Trans Autom Control (2013) 58(9):2338–43. 10.1109/tac.2013.2261187
48.
PreciadoVMJadbabaieA. Moment-based spectral analysis of large-scale networks using local structural information. IEEE/ACM Trans Networking (2013) 21(2):373–82. 10.1109/tnet.2012.2217152
49.
XiangLYuYZhuJ. Moment-based analysis of pinning synchronization in complex networks. Asian J Control (2022) 24(2):669–85. 10.1002/asjc.2590
50.
YinJXiangLChenF. Pinning synchronization and optimization of complex networks with sign inner-coupling configurations. In: 13th IEEE International Conference on Control and Automation (ICCA). (2017).
51.
NishikawaTMotterAE. Network synchronization landscape reveals compensatory structures, quantization, and the positive effect of negative interactions. PNAS (2010) 107(23):10342–7. 10.1073/pnas.0912444107
52.
ZhuJXiangLYuYChenFChenG. Average controllability of complex networks with Laplacian dynamics. IEEE Trans Circuits Syst Regular Pap (2022) 69(4):1704–14. 10.1109/tcsi.2021.3133650
53.
XiangLChenG. Minimal edge controllability of directed networks. Adv Complex Syst (2019) 22(7 and 8):1950017. 10.1142/s0219525919500176
54.
LüJChenG. A new chaotic attractor coined. Int J Bifurcation Chaos (2002) 12(3):659–61. 10.1142/s0218127402004620
55.
LüJChenGChengDCelikovskýS. Bridge the gap between the Lorenz system and the Chen system. Int J Bifurcation Chaos (2002) 12(12):2917–26. 10.1142/s021812740200631x
56.
PreciadoVM. Spectral analysis for stochastic models of large-scale complex dynamical networks. Massachusetts Institute of Technology (2009).
57.
LiuSLiCHuQ. Cryptanalyzing two image encryption algorithms based on a first-order time-delay system. IEEE MultiMedia (2022) 29(1):74–84. 10.1109/mmul.2021.3114589
58.
WangDWangDWangW. Necessary and sufficient conditions for containment control of multi-agent systems with time delay. Automatica (2019) 103:418–23. 10.1016/j.automatica.2018.12.029
59.
ChenLWangYRenWHouZ-GTanM. On convergence rate of leader-following consensus of linear multi-agent systems with communication noises. IEEE Trans Automatic Control (2016) 61(11):3586–92. 10.1109/tac.2016.2522647
60.
YeMLiDHanQ-LDingL. Distributed Nash equilibrium seeking for general networked games with bounded disturbances. IEEE/CAA J Autom Sin (2022) 9.
61.
SunHSunQSunMTaoJChenZ. Accurate modeling and homing control for parafoil delivery system based on wind disturbance rejection. IEEE Trans Aerospace Electron Syst (2022) 58(4):2916–34. 10.1109/taes.2022.3141033
Summary
Keywords
complex network, spectral moment, pinning control, synchronization, sign inner-coupling
Citation
Yu Y, Xiang L, Liu B and Xia C (2023) Moment-based analysis of pinning synchronization in complex networks with sign inner-coupling configurations. Front. Phys. 11:1179469. doi: 10.3389/fphy.2023.1179469
Received
04 March 2023
Accepted
24 March 2023
Published
07 April 2023
Volume
11 - 2023
Edited by
Fei Yu, Changsha University of Science and Technology, China
Reviewed by
Yanzhi Wu, Kyoto University, Japan
Yongqiang Guan, Xidian University, China
Updates
Copyright
© 2023 Yu, Xiang, Liu and Xia.
This is an open-access article distributed under the terms of the Creative Commons Attribution License (CC BY). The use, distribution or reproduction in other forums is permitted, provided the original author(s) and the copyright owner(s) are credited and that the original publication in this journal is cited, in accordance with accepted academic practice. No use, distribution or reproduction is permitted which does not comply with these terms.
*Correspondence: Linying Xiang, xianglinying@neuq.edu.cn
This article was submitted to Interdisciplinary Physics, a section of the journal Frontiers in Physics
Disclaimer
All claims expressed in this article are solely those of the authors and do not necessarily represent those of their affiliated organizations, or those of the publisher, the editors and the reviewers. Any product that may be evaluated in this article or claim that may be made by its manufacturer is not guaranteed or endorsed by the publisher.