Next Article in Journal
An Equivalent Homogenization Theoretical Method for Composite Sandwich Cylinders Subjected to Pure Bending
Previous Article in Journal
Influence of Molding Technology on Thermal Efficiencies and Pollutant Emissions from Household Solid Fuel Combustion during Cooking Activities in Chinese Rural Areas
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Synchronizability of Multi-Layer-Coupled Star-Composed Networks

1
Department of Basic Science, Xinjiang Institute of Light Industry Technology, Urumqi 830023, China
2
Department of Mathematics and Physics, Xinjiang Institute of Engineering, Urumqi 830023, China
3
School of Computer and Software Engineering, Xihua University, Chengdu 610039, China
*
Author to whom correspondence should be addressed.
Submission received: 18 October 2021 / Revised: 16 November 2021 / Accepted: 17 November 2021 / Published: 21 November 2021

Abstract

:
In this paper, several multi-layer-coupled star-composed networks with similar symmetrical structures are defined by using the theory of graph operation. The supra-Laplacian matrix of the corresponding multi-layer networks is obtained according to the master stability equation (MSF). Two important indexes that reflect the synchronizability of these kinds of networks are derived in the case of bounded and unbounded synchronized regions. The relationships among the synchronizability, the number of layers, the length of the paths, the branchings, and the interlayer and intralayer coupling strengths in the two cases are studied. At the same time, the simulation experiments are carried out with the MATLAB software, and the simulated images of the two symmetrical structure networks’ synchronizability are compared. Finally, the factors affecting the synchronizability of multi-layer-coupled star-composed networks are found. On this basis, optimization schemes are given to improve the synchronizability of multi-layer-coupled star-composed networks and the influences of the number of central nodes on the networks’ synchronizability are further studied.

1. Introduction

Complex networks have appeared in many aspects of our lives; they are used in the prevention of the spread of epidemic diseases, computer networks, social networks, and other fields [1,2,3,4]. These networks are an important interdisciplinary research field that has attracted the interest of many scholars. In recent years, many new advances have been made in the research of complex networks, such as the spread and stability of complex networks [5,6], the synchronization and consensus of multi-layer complex networks [7,8,9,10,11,12,13,14,15], diffusion in multi-layer networks [16,17,18,19,20], and the modeling and robustness of multi-layer complex networks [21,22,23,24,25].
Common network synchronization types are complete synchronization [8] and phase synchronization [26]. This paper studies the complete synchronization of networks according to the master stability equation (MSF) proposed by Pecora and Carroll [27]. Research on the synchronizability of multi-layer networks mostly focuses on structures such as star-like networks, and there has been little research on the synchronizability of multi-layer star-composed networks. On the one hand, the symmetrical structures of multi-layer-coupled star-composed networks are more complex and the calculation of the synchronizability indexes in these symmetrical structures is more difficult than the calculation of the indexes of other types of structure. On the other hand, the characteristic polynomials of many star-composed coupled networks can not be solved analytically.
In recent years, scholars have obtained many classical results on the synchronization of star-like networks. Aguirre et al. [28] studied how the degree of nodes connected between two layers of networks affects the synchronizability of the whole system and proposed an effective synchronization strategy. Zhu et al. [29] studied the relationships among the synchronizability of two k-layer variable-coupling windmill-type networks, the number of nodes, the coupling strength, and other parameters in the case of unbounded and bounded synchronized regions and provided an optimization scheme to improve the synchronizability. Deng et al. [30] gave the characteristic polynomials of multi-layer-coupled chain networks, discussed the relationships between synchronizability and different parameters in the case of unbounded and bounded synchronized regions, and further provided image examples to verify the effectiveness of their theoretical analysis. Li et al. [31] studied the bipartite synchronization of coupled inertial memory neural networks with cooperative and competitive interaction. Two simulation examples were given to verify the effectiveness of the proposed discontinuous control strategy for bipartite synchronization. Inspired by the above works of literature, the main contents of this paper are as follows:
  • We provide definitions of star-composed networks and introduce the relevant theoretical knowledge required for the synchronization of multi-layer networks.
  • The supra-Laplacian matrix of multi-layer-coupled star-composed networks is given according to the MSF. With the help of graph theory and graph operation, the important indexes reflecting the synchronizability are obtained for the cases of bounded and unbounded synchronized regions.
  • According to the important indexes of synchronizability, we obtain the relationships between synchronizability and the parameters of multi-layer-coupled star-composed networks.
  • Through simulation experiments, we obtain the relationships between the synchronizability and various parameters, and provide a theoretical basis for optimizing the synchronizability of multi-layer-coupled star-composed networks.
The structure of this paper is as follows. In Section 2, the preliminaries required to study the synchronization of multi-layer-coupled star-composed networks are given. In Section 3, the eigenvalue spectrum and the synchronizability indexes of multi-layer-coupled star-composed networks are studied and extended to a more general case. In Section 4, the synchronizability of multi-layer-coupled star-composed networks is simulated numerically. In Section 5, the main conclusions of this paper are given.

2. Preliminaries

2.1. The Synchronizability of Multi-Layer Networks

According to the dynamic equation of the ith node of the Lth layer in the Q-layer network [32]:
d x i L d t = f ( x i L ) a L j = 1 N ω i j L Φ ( x j L ) d T = 1 Q d i L T Y ( x i L ) ,
i = 1 , 2 , , N , L = 1 , 2 , , Q .
where N is the number of nodes in each layer; Q is the number of layers; x i L is the state variable of the ith node of the Lth layer; f ( * ) is the dynamic function; a L is the intralayer coupling strength of the Lth layer; d is the interlayer coupling strength; Φ is the intralayer coupling function; and Y is the interlayer coupling function. The property of the Laplacian matrix can ensure the block diagonalization of the Jacobian, which means that the MSF can be used to determine the stability of a synchronized solution by reducing the dimensionality of the synchronization problem [27], H L = ( ω i j L ) = S L W L is the Laplacian matrix of the Lth layer. Additionally, S L = ( s i i L ) R N × N is the degree matrix of the Lth layer, where s i i L = d ( v i ) , and d ( v i ) is the degree of the vertex v i . W L = ( w i j L ) R N × N is the adjacency matrix of the Lth layer. If there is an edge between the vertex v i and v j of the Lth layer, w i j L = 1 ; otherwise, w i j L = 0 ( i , j = 1 , 2 , 3 , , N 1 , N ) .
In this paper, we consider the coupling strength of multi-layer networks. The weighted Laplacian matrix of the Lth layer is H ( L ) = a L ( S L W L ) . The interlayer-weighted Laplacian matrix is defined as d D = d ( d i L T ) R Q × Q ( L , T = 1 , 2 , 3 , , Q ) . If there is an edge between the ith node of the Lth layer and the ith node of the Tth layer, d i L T = 1 ; otherwise, d i L T = 0 and d i L L = T = 1 , T L Q d i L T ( L , T = 1 , 2 , 3 , , Q ) .
The supra-Laplacian matrix of the multi-layer network is H = H L + H I , where H I = d D I N , I N is the identity matrix of N × N , and ⨂ is the Kronecker product.
H L = H ( 1 ) 0 0 0 0 H ( 2 ) 0 0 0 0 H ( Q 1 ) 0 0 0 0 H ( Q ) = L = 1 Q H ( L )
The eigenvalues of a square matrix A are the roots of its characteristic polynomial Ψ ( λ ) , Ψ ( λ ) = | λ I A | . The eigenvalues of matrices have many applications [8,33]. In this paper, the eigenvalues of the supra-Laplacian matrix H are used to study the synchronizability of the networks. The eigenvalues of the supra-Laplacian matrix H are λ 1 , λ 2 , λ 3 , , λ n 1 , λ n . λ 1 = 0 is obtained from the properties of the supra-Laplacian matrix. According to the MSF, when the synchronized region is unbounded, the larger the λ 2 is, the stronger the synchronizability of the network is; when the synchronized region is bounded, the smaller the r = λ m a x / λ 2 is, the stronger the synchronizability of the network is [29].

2.2. Graph Theory and Star-Composed Networks

In this paper, we consider undirected and connected graph G. The vertex set of G is V ( G ) = { v 1 , v 2 , v 3 , , v n 1 , v n } , and the edge set of G is E ( G ) = { ( v i , v j ) | i , j = 1 , 2 , 3 , n ; i j } . The edge set and the vertex set uniquely determine the graph. Let K p be a complete graph with p nodes, P n be a path of length n, and E k be a graph that has k vertices with an empty edge set.
The star-composed networks studied in this paper are introduced below. We first give two graph operations.
Definition 1.
([34]) Let G 1 , G 2 represent two simple graphs with n 1 , n 2 vertices and m 1 , m 2 edges, respectively. The corona operation G 1 G 2 is the graph obtained from one copy of G 1 and n 1 copies of G 2 , before joining the ith vertex of G 1 to every vertex in the ith copy of G 2 ( i = 1 , 2 , , n 1 ) .
Definition 2.
([35]) Let G 1 , G 2 represent two simple graphs. The conjunction operation G 1 G 2 is defined as the graph, which is obtained from the disjoint union of G 1 and G 2 by adding the edges { a b : a V ( G 1 ) , b V ( G 2 ) } .
G 1 ( 1 , k , n ) = ( K 1 E k ) P n is composed of one center node, k branchings, and paths of length n. G 2 ( 2 , k 1 , n ) = ( K 2 E k 1 ) P n is composed of two center nodes, k 1 branchings, and paths of length n. Its connection relationships are shown in Figure 1. The red nodes represent the central nodes, the yellow nodes represent the branchings nodes, the green nodes represent the nodes of the paths, and the black solid lines represent the interlayer connection relationships between the nodes.
G 1 Q ( 1 , k , n ) and G 2 Q ( 2 , k 1 , n ) are composed of Q layers G 1 ( 1 , k , n ) and G 2 ( 2 , k 1 , n ) , respectively. The total number of nodes is Q ( n k + n + k + 1 ) , and the connection relationships are shown in Figure 2. The colored dotted lines represent the connection relationships between each layer.
Lemma 1.
([30]) Let A , B be two M × M square matrices, and K be an integer; then,
A B B B A B B B A K × K = | A + ( K 1 ) B | · | A B | ( K 1 ) .

3. The Eigenvalue Spectrum and Synchronizability Indexes of Multi-Layer Coupled Star-Composed Networks

3.1. The Eigenvalue Spectrum and Synchronizability Indexes of G 1 Q ( 1 , k , n )

Similar to the network structure of G 1 2 ( 1 , 8 , 4 ) in Figure 2, each layer has the same topology. We assume that a is the intralayer coupling strength and d is the interlayer coupling strength. According to the concept of supra-Laplacian matrix, it is not difficult to obtain the supra-Laplacian matrix of G 1 Q ( 1 , k , n ) :
H 1 = ( k + n ) a a a a a Θ 1 0 0 a 0 Θ 1 0 a 0 0 Θ 1 ( k + 1 ) × ( k + 1 ) ,
where Θ 1 = ( n + 1 ) a .
H 2 = a 0 0 0 0 a 0 0 0 0 a 0 0 0 0 a ( k + 1 ) × ( k + 1 ) ,
H 3 = 2 a 0 0 0 0 2 a 0 0 0 0 2 a 0 0 0 0 2 a ( k + 1 ) × ( k + 1 ) ,
H 4 = 3 a 0 0 0 0 3 a 0 0 0 0 3 a 0 0 0 0 3 a ( k + 1 ) × ( k + 1 ) ,
The supra-Laplacian matrix of Lth layer is:
H 1 ( L ) = H 1 H 2 H 2 H 2 H 2 H 2 H 2 H 3 H 2 0 0 0 H 2 H 2 H 4 H 2 0 0 H 2 0 H 2 H 4 0 0 H 2 0 0 0 H 4 H 2 H 2 0 0 0 H 2 H 3 ,
Combined with the interlayer supra-Laplacian matrix:
H = Θ 2 d I d I d I d I Θ 2 d I d I d I d I Θ 2 d I d I d I d I Θ 2 ,
where Θ 2 = H 1 ( L ) + ( Q 1 ) d I .
Then, the characteristic polynomial is:
Ψ I ( λ ) = d e t ( λ I H ) = Θ 3 d I d I d I d I Θ 3 d I d I d I d I Θ 3 d I d I d I d I Θ 3 ,
where Θ 3 = λ I H 1 ( L ) ( Q 1 ) d I .
According to Lemma 1, we have:
Ψ I ( λ ) = | λ I H 1 ( L ) | | λ I H 1 ( L ) Q d I | Q 1 .
The eigenvalue spectrum of H is:
0 , ( n + 1 ) a , k + n + 2 ± ( k + n + 2 ) 2 4 ( k + 1 ) 2 a , n + 2 ± ( n + 2 ) 2 4 2 a k 1 ,
Q d , ( n + 1 ) a + Q d Q 1 , 4 a s i n 2 ( α π 2 n ) + a k + 1 ( α = 1 , 2 , , n 1 ) ,
k + n + 2 ± ( k + n + 2 ) 2 4 ( k + 1 ) 2 a + Q d Q 1 ,
n + 2 ± ( n + 2 ) 2 4 2 a + Q d ( Q 1 ) ( k 1 ) , 4 a s i n 2 ( α π 2 n ) + a + Q d ( Q 1 ) ( k + 1 ) ( α = 1 , 2 , , n 1 ) .
Deduced from the preliminary knowledge, the minimum nonzero eigenvalue is:
λ 2 = m i n { n + 2 ( n + 2 ) 2 4 2 a , Q d } .
The maximum eigenvalue is:
λ m a x = k + n + 2 + ( k + n + 2 ) 2 4 ( k + 1 ) 2 a + Q d .
Then, we have:
r = ( k + n + 2 + ( k + n + 2 ) 2 4 ( k + 1 ) 2 a + Q d ) / λ 2 .

3.2. The Eigenvalue Spectrum and Synchronizability Indexes of G 2 Q ( 2 , k 1 , n )

Similar to the network structure of G 2 2 ( 2 , 7 , 4 ) in Figure 2, we examine the eigenvalue spectrum of G 2 Q ( 2 , k 1 , n ) using a similar method:
H 5 = ( k + n ) a a a a a ( k + n ) a a a a a Θ 4 0 a a 0 Θ 4 ( k + 1 ) × ( k + 1 ) ,
where Θ 4 = ( n + 2 ) a .
The supra-Laplacian matrix of the Lth layer is:
H 2 ( L ) = H 5 H 2 H 2 H 2 H 2 H 2 H 2 H 3 H 2 0 0 0 H 2 H 2 H 4 H 2 0 0 H 2 0 H 2 H 4 0 0 H 2 0 0 0 H 4 H 2 H 2 0 0 0 H 2 H 3 ,
Combined with the interlayer supra-Laplacian matrix:
H ˜ = Θ 5 d I d I d I d I Θ 5 d I d I d I d I Θ 5 d I d I d I d I Θ 5 ,
where Θ 5 = H 2 ( L ) + ( Q 1 ) d I .
The characteristic polynomial is:
Ψ I I ( λ ) = | λ I H 2 ( L ) | | λ I H 2 ( L ) Q d I | Q 1 .
The eigenvalue spectrum of H ~ is: 0 , ( n + 1 ) a , k + n + 2 ± ( k + n + 2 ) 2 4 ( k + 1 ) 2 a , n + 3 ± ( n + 3 ) 2 8 2 a k 2 ,
Q d , ( n + 1 ) a + Q d Q 1 , 4 a s i n 2 ( β π 2 n ) + a k + 1 ( β = 1 , 2 , , n 1 ) ,
k + n + 2 ± ( k + n + 2 ) 2 4 ( k + 1 ) 2 a + Q d ( Q 1 ) ,
n + 3 ± ( n + 3 ) 2 8 2 a + Q d ( k 2 ) ( Q 1 ) , 4 a s i n 2 ( β π 2 n ) + a + Q d ( k + 1 ) ( Q 1 ) ( β = 1 , 2 , , n 1 ) .
By comparison, the minimum nonzero eigenvalue is:
λ 2 = m i n { n + 3 ( n + 3 ) 2 8 2 a , Q d } .
The maximum eigenvalue is:
λ m a x = k + n + 2 + ( k + n + 2 ) 2 4 ( k + 1 ) 2 a + Q d .
Then, we have:
r = ( k + n + 2 + ( k + n + 2 ) 2 4 ( k + 1 ) 2 a + Q d ) / λ 2 .

3.3. The Eigenvalue Spectrum and Synchronizability Indexes of G p Q ( p , k + 1 p , n )

The multi-layer-coupled star-composed networks with p central nodes are considered, ( 3 p k ) , and the multi-center-coupled star-composed networks can be written as G p Q ( p , k + 1 p , n ) = ( K p E k + 1 p ) P n .
The eigenvalue spectrum of the supra-Laplace matrix obtained by the same method is: 0 , ( n + 1 ) a , k + n + 2 ± ( k + n + 2 ) 2 4 ( k + 1 ) 2 a p , n + p + 1 ± ( n + p + 1 ) 2 4 p 2 a k p ,
Q d , ( n + 1 ) a + Q d Q 1 , 4 a s i n 2 ( γ π 2 n ) + a k + 1 ( γ = 1 , 2 , , n 1 ) ,
k + n + 2 ± ( k + n + 2 ) 2 4 ( k + 1 ) 2 a + Q d p ( Q 1 ) ,
n + p + 1 ± ( n + p + 1 ) 2 4 p 2 a + Q d ( k p ) ( Q 1 ) , 4 a s i n 2 ( γ π 2 n ) + a + Q d ( k + 1 ) ( Q 1 ) ( γ = 1 , 2 , , n 1 ) .
We can easily obtain the required indicators. The minimum nonzero eigenvalue is as follows:
λ 2 = m i n { n + p + 1 ( n + p + 1 ) 2 4 p 2 a , Q d } .
The maximum eigenvalue is:
λ m a x = k + n + 2 + ( k + n + 2 ) 2 4 ( k + 1 ) 2 a + Q d .
Then, we have:
r = ( k + n + 2 + ( k + n + 2 ) 2 4 ( k + 1 ) 2 a + Q d ) / λ 2 .

4. Numerical Simulation Experiment and Analysis

In the analysis of the above sections, we can obtain the relationships between the synchronizability and various parameters of multi-layer-coupled star-composed networks. This section tests the accuracy of the above mentioned theoretical results through a large number of numerical simulation experiments. Firstly, the state trajectories of star-composed networks are described to illustrate that their synchronization can be realized by MATLAB. Secondly, considering the actual initial value, the change images of the synchronizability of the star-composed networks are obtained by MATLAB. Finally, we analyze the relationships between the synchronizability and parameters of multi-layer-coupled star-composed networks.
We consider an example of a coupling system composed of two layers. The network topology is shown in Figure 3. The number of layers is Q = 2 , N = 9 is the number of nodes in each layer, and the dynamics of each node are given as follows [36]:
d x i L d t = | x i L + 1 | | x i L 1 | 2 + j N i a i j ( x j L x i L ) + j N i b i j ( x j 3 L x i L )
where x i L is the state of a node, | x + 1 | | x 1 | 2 represents the inherent nonlinear dynamics of the node, i = 1 , 2 , 3 , , 8 , 9 , L = 1 , 2 ; a i j represents the intralayer connection, and the connection weight is 1. b i j denotes the interlayer connection, and the connection weight is 2.5 . The initial value of the system is randomly selected. Through the simulation, the state trajectory of the system is shown in Figure 4 and Figure 5. It can be seen that the state trajectory of nodes achieves synchronization under the coupling effect.
In the following analysis, in order to distinguish the synchronizability indexes of multi-layer-coupled star-composed networks, when the synchronized region is unbounded, we use λ 2 a and λ 2 b to represent the synchronizability indexes of G 1 Q ( 1 , k , n ) and G 2 Q ( 2 , k 1 , n ) . When the synchronized region is bounded, the synchronizability indexes of G 1 Q ( 1 , k , n ) and G 2 Q ( 2 , k 1 , n ) are represented by r a and r b , respectively.
  • When the synchronized region is unbounded, we set n = 5 , a = 2 , d = 0.008 , Q = 40 , with the increase in k as in Figure 6. λ 2 a remains unchanged at 0.2918 and λ 2 b remains unchanged at 0.32. The synchronizability is not affected by k. We set k = 10 , a = 2 , d = 0.008 , Q = 40 . With the increase in n in Figure 7, λ 2 a remains unchanged at 0.32 and then decreases monotonically to 0.0196, while λ 2 b remains unchanged at 0.32 and then decreases monotonically to 0.0486. The synchronizability of G 1 Q ( 1 , k , n ) and G 2 Q ( 2 , k 1 , n ) reached the maximum at n = a / Q d + Q d / a 2 and n = 2 a / Q d + Q d / a 3 , respectively, and the length of the paths reaches the maximum. We set k = 10 , n = 5 , d = 0.008 , Q = 40 , with the increase in a as in Figure 8. λ 2 a monotonically increases from 0.0729 to 0.32 and then remains unchanged, while λ 2 b monotonically increases from 0.1629 to 0.32 and then remains unchanged. The synchronizability of G 1 Q ( 1 , k , n ) and G 2 Q ( 2 , k 1 , n ) reaches the maximum at a = ( n + 2 + ( n + 2 ) 2 4 ) Q d / 2 and a = ( n + 3 + ( n + 3 ) 2 8 ) Q d / 4 , respectively, and the intralayer coupling strength is the minimum. We set k = 10 , n = 5 , a = 2 , Q = 40 . With the increase in d in Figure 9, λ 2 a monotonically increases from 0.04 to 0.2918 and then remains unchanged, while λ 2 b monotonically increases from 0.04 to 0.6515 and then remains unchanged. The synchronizability of G 1 Q ( 1 , k , n ) and G 2 Q ( 2 , k 1 , n ) reaches the maximum at d = ( n + 2 ( n + 2 ) 2 4 ) a / 2 Q and d = ( n + 3 ( n + 3 ) 2 8 ) a / 2 Q , respectively, and the interlayer coupling strength is the minimum. We set k = 10 , n = 5 , a = 2 , d = 0.008 , with the increase in as Q in Figure 10. λ 2 a monotonically increases from 0.016 to 0.2918 and then remains unchanged, while λ 2 b monotonically increases from 0.016 to 0.6515 and then remains unchanged. The synchronizability of G 1 Q ( 1 , k , n ) and G 2 Q ( 2 , k 1 , n ) reaches the maximum at Q = ( n + 2 ( n + 2 ) 2 4 ) a / 2 d and Q = ( n + 3 ( n + 3 ) 2 8 ) a / 2 d , respectively, and the number of layers is the minimum.
  • When the synchronized region is bounded, we set n = 5 , a = 2 , d = 0.008 , Q = 40 , with the increase in k as in Figure 6. r a monotonically increases from 91.2508 to 1094.7 and r b monotonically increases from 83.2082 to 998.1725. When k is the minimum, the synchronizability is the maximum. We set k = 10 , a = 2 , d = 0.008 , Q = 40 . With the increase in n in Figure 7, r a rapidly increases from 127.0276 to 17141 and r b rapidly increases from 127.0276 to 6922.5. When n is the minimum, the synchronizability is the maximum. We set k = 10 , n = 5 , d = 0.008 , Q = 40 . With the increase in a in Figure 8, r a decreases slowly from 174.5482 to 171.1677 and then increases rapidly to 233.7460, while r b decreases slowly from 78.1736 to 77.2113 and then increases rapidly to 233.7460. The synchronizability of G 1 Q ( 1 , k , n ) and G 2 Q ( 2 , k 1 , n ) reaches the maximum at a = ( n + 2 + ( n + 2 ) 2 4 ) Q d / 2 and a = ( n + 3 + ( n + 3 ) 2 8 ) Q d / 4 , respectively. We set k = 10 , n = 5 , a = 2 , Q = 40 . With the increase in d in Figure 9, r a decreases rapidly from 1242.3 to 171.2582 and then increases monotonically to 581.4077, while r b decreases slowly from 1242.3 to 77.2526 and then increases rapidly to 260.3906. The synchronizability of G 1 Q ( 1 , k , n ) and G 2 Q ( 2 , k 1 , n ) reaches the maximum at d = ( n + 2 ( n + 2 ) 2 4 ) a / 2 Q and d = ( n + 3 ( n + 3 ) 2 8 ) a / 2 Q , respectively. We set k = 10 , n = 5 , a = 2 , d = 0.008 . With the increase in Q in Figure 10, r a rapidly decreases from 3104.3 to 171.1760 and then slowly increases to 172.9032, while r b decreases rapidly from 3104.3 to 77.2158 and then increases slowly to 77.4368. The synchronizability of G 1 Q ( 1 , k , n ) and G 2 Q ( 2 , k 1 , n ) reaches the maximum at Q = ( n + 2 ( n + 2 ) 2 4 ) a / 2 d and Q = ( n + 3 ( n + 3 ) 2 8 ) a / 2 d , respectively.

5. Main Results

5.1. The Parameters That Affect the Synchronizability of Star-Composed Networks

Based on the above situation, for G 1 Q ( 1 , k , n ) networks when the synchronized region is unbounded, the synchronizability of the networks is only related to the number of layers, the length of paths, the interlayer coupling strength, and the intralayer coupling strength. When the synchronized region is bounded, the synchronizability of the networks is related to the interlayer coupling strength, the intralayer coupling strength, the length of paths, the branchings, and the number of layers. See Table 1 for the specific relationships. For G 2 Q ( 2 , k 1 , n ) networks, whether the synchronized region is bounded or unbounded, the factors affecting the networks’ synchronizability are the same as G 1 Q ( 1 , k , n ) ; see Table 2 for the specific relationships.

5.2. Optimizing Synchronizability of G p Q ( p , k + 1 p , n ) Networks

We further discuss the synchronizability of the multi-layer-coupled star-composed networks with the central nodes p. Figure 6, Figure 7, Figure 8, Figure 9 and Figure 10 show the relationships between the synchronizability of G p Q ( p , k + 1 p , n ) ( p = 1 , 2 ) and the affecting factors. G p Q ( p , k + 1 p , n ) have similar figures; the specific relationship is shown in Table 3.
  • When the synchronized region is unbounded, the synchronizability is not affected by k. With the increase in the length of paths n, the synchronizability of the networks remains unchanged and then decreases. The synchronizability of G p Q ( p , k + 1 p , n ) reaches the maximum at n = a p / Q d + Q d / a ( p + 1 ) and the length of paths reaches the maximum. With the increase in intralayer coupling strength a, the synchronizability of the networks increases first and then remains unchanged. The synchronizability of G p Q ( p , k + 1 p , n ) reaches the maximum at a = ( n + p + 1 + ( n + p + 1 ) 2 4 p ) Q d / 2 p , and the intralayer coupling strength is the minimum. With the increase in interlayer coupling strength d, the synchronizability of the networks increases first and then remains unchanged. The synchronizability of G p Q ( p , k + 1 p , n ) reaches the maximum at d = ( n + p + 1 ( n + p + 1 ) 2 4 p ) a / 2 Q and the interlayer coupling strength is the minimum. With the increase in the number of layers Q, the synchronizability of the networks increases first and then remains unchanged. The synchronizability of G p Q ( p , k + 1 p , n ) reaches the maximum at Q = ( n + p + 1 ( n + p + 1 ) 2 4 p ) a / 2 d and the number of layers is the minimum. It can be seen that in order to improve the synchronizability of the networks, the length of paths n should be appropriately reduced, and the intralayer coupling strength a, interlayer coupling strength d, and number of layers Q should be appropriately increased.
  • When the synchronized region is bounded, with the increase in the branchings k and the length of paths n, the synchronizability of the networks continues to weaken. With the increase in the intralayer coupling strength a, the synchronizability of the networks increases first and then decreases. The synchronizability of G p Q ( p , k + 1 p , n ) reaches the maximum at a = ( n + p + 1 + ( n + p + 1 ) 2 4 p ) Q d / 2 p . With the increase in the interlayer coupling strength d, the synchronizability of the networks increases first and then decreases. The synchronizability of G p Q ( p , k + 1 p , n ) reaches the maximum at d = ( n + p + 1 ( n + p + 1 ) 2 4 p ) a / 2 Q . With the increase in the number of layers Q, the synchronizability of the networks increases first and then decreases. The synchronizability of G p Q ( p , k + 1 p , n ) reaches the maximum at Q = ( n + p + 1 ( n + p + 1 ) 2 4 p ) a / 2 d . From the above analysis, in order to improve the synchronizability of the networks, we reduce the branchings k and the length of paths n and appropriately increase the intralayer coupling strength a, interlayer coupling strength d, and number of layers Q to the corresponding inflection points.

5.3. Impact of the Number of Central Nodes on the Synchronizability

In the numerical simulation, we determined that the synchronizability of the networks with two central nodes is better than that of the networks with one central node. Whether the synchronized region is bounded or unbounded, with the increase in the central nodes p, the synchronizability of the networks will not be weaker than the synchronizability of the networks with fewer central nodes.
There are still many problems that need to be solved in multi-layer-coupled star-composed networks. For example, what will happen to the synchronizability after giving different coupling strengths to multi-layer-coupled star-composed networks? For multi-layer-coupled star-composed networks, we need to further study how to keep the synchronizability unchanged when changing multiple parameters.

Author Contributions

Conceptualization, H.G. and J.Z.; methodology, H.G. and J.Z.; software, H.G. and J.Z.; validation, H.G., J.Z. and X.C.; formal analysis, H.G. and X.C.; writing—original draft preparation, H.G. and J.Z.; writing—review and editing, X.L.; supervision, X.L. and X.C.; project administration, H.G. All authors have read and agreed to the published version of the manuscript.

Funding

This work was supported by the National Natural Science Foundation of China (No. 61802316) and the National Science Foundation of Xinjiang (NSFXJ), (No. 2021D01A65), the Scientific Research and Education Project of Xinjiang Institute of Engineering, (No. 2020xgy332302), and the National innovation and entrepreneurship training program for College Students (No. 202110994006).

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Some or all of the data, models, or code generated or used during the study are available from the corresponding author by request.

Acknowledgments

We express our sincere gratitude to the people who gave us valuable comments.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Granell, C.; Gómez, S.; Arenas, A. Dynamical interplay between awareness and epidemic spreading in multiplex networks. Phys. Rev. Lett. 2013, 111, 128701. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  2. Min, B.; Yi, S.; Lee, K.; Goh, K. Network robustness of multiplex networks with interlayer degree correlations. Phys. Rev. E 2014, 89, 042811. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  3. Borgatti, S.; Mehra, A.; Brass, D.; Labianca, G.; Labianca, G. Network analysis in the social sciences. Science 2009, 323, 892–895. [Google Scholar] [CrossRef] [Green Version]
  4. Huang, S.; Zhang, J.; Wang, L.; Hu, X. Social friend recommendation based on multiple network correlation. IEEE Trans. Multimed. 2016, 18, 287–299. [Google Scholar] [CrossRef]
  5. Ramos, L.A.A.; Jaquez, R.B.; Schaum, A. Output-Feedback Control for Discrete-Time Spreading Models in Complex Networks. Entropy 2018, 20, 204. [Google Scholar] [CrossRef] [Green Version]
  6. Jaquez, R.B.; Ramos, L.A.A.; Schaum, A. Spreading Control in Two-Layer Multiplex Networks. Entropy 2020, 22, 1157. [Google Scholar] [CrossRef]
  7. Jalan, S.; Kumar, A.; Schaum, I.L. Explosive synchronization in frequency displaced multiplex networks. Chaos 2019, 29, 041102. [Google Scholar] [CrossRef]
  8. Li, J.; Luan, Y.; Wu, X.; Lu, J. Synchronizability of double-layer dumbbell net-works. Chaos 2021, 31, 073101. [Google Scholar] [CrossRef]
  9. Zhang, H.; Ye, M.; Ye, R.; Cao, J. Synchronization stability of Riemann-Liouville fractional delay-coupled complex neural networks. Phys. A Stat. Mech. Its Appl. 2018, 508, 155–165. [Google Scholar] [CrossRef]
  10. Xu, M.; Lu, J.; Zhou, J. Synchronizability and eigenvalues of two-layer star networks. Acta Phys. Sin. 2016, 65, 028902. [Google Scholar]
  11. Huang, D.; Zhu, J.; Yu, Z.; Jiang, H. Cluster-delay consensus in MASS with layered intermittent communication: A multi-tracking approach. Symmetry 2021, 13, 1248. [Google Scholar] [CrossRef]
  12. Sun, W.; Li, Y.; Liu, S. Noisy consensus dynamics in windmill-type graphs. Chaos 2020, 30, 123131. [Google Scholar] [CrossRef] [PubMed]
  13. Zhou, M.; Li, X.; Xiong, W.; Wu, X.; Liao, H. Cooperation of local and collective synchronization in complex networks. Phys. A Stat. Mech. Its Appl. 2019, 526, 120963. [Google Scholar] [CrossRef]
  14. Vaseghi, B.; Mobayen, S.; Hashemi, S.S.; Fekih, A. Fast reaching fifinite time synchronization approach for chaotic systems with application in medical image encryption. IEEE Access 2021, 9, 25911–25925. [Google Scholar] [CrossRef]
  15. Hu, C.; He, H.; Jiang, H. Synchronization of complex-valued dynamic networks with intermittently adaptive coupling: A direct error method. Automatica 2019, 112, 108675. [Google Scholar] [CrossRef]
  16. Kan, J.; Ma, C.; Zhang, H.; Xiang, B. Interplay of epidemic spreading and strategy-mixed awareness diffusion on multiplex networks. Int. J. Mod. Phys. C 2020, 31, 2050085. [Google Scholar] [CrossRef]
  17. Niu, R.; Wu, X.; Lu, J.; Lü, J. Adaptive Diffusion Processes of Time-Varying Local Information on Networks. IEEE Trans. Circuits Syst. II Express Briefs 2019, 66, 1592–1596. [Google Scholar] [CrossRef] [Green Version]
  18. Yu, Q.; Yu, Z.; Ma, D. A Multiplex Network Perspective of Innovation Diffusion: An Information-Behavior Framework. IEEE Access 2020, 8, 36427–36440. [Google Scholar] [CrossRef]
  19. Wang, X.; Tejedor, A.; Wang, Y.; Moreno, Y. Unique superdiffusion induced by directionality in multiplex networks. New J. Phys. 2021, 23, 013016. [Google Scholar] [CrossRef]
  20. Yan, H.; Zhou, J.; Li, W.; Lu, J.; Fan, R. Superdiffusion criteria on duplex networks. Chaos 2021, 31, 073108. [Google Scholar] [CrossRef]
  21. Sun, W.; Sun, M.; Guan, J.; Jia, Q. Robustness of Coherence in Noisy Scale-Free Networks and Applications to Identification of Influential Spreaders. IEEE Trans Circuits Syst. II Express Briefs 2020, 67, 1274–1278. [Google Scholar] [CrossRef]
  22. Mofifid, O.; Momeni, M.; Mobayen, S.; Fekih, A. A disturbance-observer-based sliding mode control for the robust synchronization of uncertain delayed chaotic systems: Application to data security. IEEE Access 2021, 9, 16546–16555. [Google Scholar] [CrossRef]
  23. Kang, H.; Liu, K.; Fu, X. Dynamics of an epidemic model with quarantine on scale-free networks. Phys. Lett. A 2017, 381, 3945–3951. [Google Scholar] [CrossRef]
  24. Mei, G.; Wu, X.; Wang, Y.; Hu, M.; Lu, J.A.; Chen, G. Compressive-sensing based structure identifification for multi-layer networks. IEEE Trans. Cybern. 2018, 48, 754–764. [Google Scholar] [CrossRef] [PubMed]
  25. Huang, C.; Zhu, L. Robust evaluation method of communication network based on the combination of complex network and big data. Neural Comput. Appl. 2021, 33, 887–896. [Google Scholar] [CrossRef]
  26. Chutani, M.; Tadic, B.; Gupte, N. Hysteresis and synchronization processes of Kuramoto oscillators on high-dimensional simplicial complexes with the competing simplex-encoded couplings. Phys. Rev. E 2021, 104, 034206. [Google Scholar] [CrossRef]
  27. Pecora, M.; Carroll, L. Master Stability Functions for Synchronized Coupled Systems. Phys. Rev. Lett. 1998, 80, 2109–2112. [Google Scholar] [CrossRef]
  28. Aguirre, J.; Sevilla-Escoboza, R.; Gutíerrez, R.; Papo, D.; Buldú, J. Synchronization of Interconnected Networks: The Role of Connector Nodes. Phys. Rev. Lett. 2014, 112, 248701. [Google Scholar] [CrossRef] [Green Version]
  29. Zhu, J.; Huang, D.; Jiang, H.; Bian, J.; Yu, Z. Synchronizability of multi-layer variable coupling windmill-type networks. Mathematics 2021, 9, 2721. [Google Scholar] [CrossRef]
  30. Deng, Y.; Jia, Z.; Deng, G.; Zhang, Q. Eigenvalue spectrum and synchronizability of multiplex chain networks. Phys. A Stat. Mech. Its Appl. 2020, 537, 122631. [Google Scholar] [CrossRef]
  31. Li, N.; Zheng, W. Bipartite synchronization for inertia memristor-based neural networks on coopetition networks. Neural Netw. 2020, 124, 39–49. [Google Scholar] [CrossRef] [PubMed]
  32. Tang, L.; Wu, X.; Lü, J.; Lu, J.; D’Souza, R. Master stability functions for complete, intralayer, and interlayer synchronization in multiplex networks of coupled Rössler oscillators. Phys. Rev. E 2019, 99, 012304. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  33. Jäntschi, L. The Eigenproblem Translated for Alignment of Molecules. Symmetry 2019, 11, 1027. [Google Scholar]
  34. Barik, S.; Sahoo, G. On the Laplacian spectra of some variants of corona. Linear Algebra Its Appl. 2017, 512, 32–47. [Google Scholar] [CrossRef]
  35. Cvetkovic, D.; Rowlinson, P.; Simic, S. An Introduction to the Theory of Graph Spectra; Cambridge University Press: Cambridge, UK, 2010. [Google Scholar]
  36. Li, X.; Li, X.; Hu, C. Some new results on stability and synchronization for delayed inertial neural networks based on non-reduced order method. Neural Netw. 2017, 96, 91–100. [Google Scholar] [CrossRef]
Figure 1. Single-layer star-composed network.
Figure 1. Single-layer star-composed network.
Symmetry 13 02224 g001
Figure 2. Double-layer star-composed network.
Figure 2. Double-layer star-composed network.
Symmetry 13 02224 g002
Figure 3. An example of double-layer star-composed network.
Figure 3. An example of double-layer star-composed network.
Symmetry 13 02224 g003
Figure 4. The state trajectories of the first layer.
Figure 4. The state trajectories of the first layer.
Symmetry 13 02224 g004
Figure 5. The state trajectories of the second layer.
Figure 5. The state trajectories of the second layer.
Symmetry 13 02224 g005
Figure 6. λ 2 and r change with k.
Figure 6. λ 2 and r change with k.
Symmetry 13 02224 g006
Figure 7. λ 2 and r change with n.
Figure 7. λ 2 and r change with n.
Symmetry 13 02224 g007
Figure 8. λ 2 and r change with a.
Figure 8. λ 2 and r change with a.
Symmetry 13 02224 g008
Figure 9. λ 2 and r change with d.
Figure 9. λ 2 and r change with d.
Symmetry 13 02224 g009
Figure 10. λ 2 and r change with Q.
Figure 10. λ 2 and r change with Q.
Symmetry 13 02224 g010
Table 1. Relationships among all parameters affecting G 1 Q ( 1 , k , n ) networks’ synchronizability.
Table 1. Relationships among all parameters affecting G 1 Q ( 1 , k , n ) networks’ synchronizability.
k n a d Q
λ 2 = min { Q d , Δ 1 } Δ 1 < Q d
Δ 1 > Q d
r = λ m a x / λ 2 Δ 1 < Q d
Δ 1 > Q d
Δ 1 = n + 2 ( n + 2 ) 2 4 2 a , ↑ strengthen, ↓ weaken, − unchanged.
Table 2. Relationships among all parameters affecting G 2 Q ( 2 , k 1 , n ) networks’ synchronizability.
Table 2. Relationships among all parameters affecting G 2 Q ( 2 , k 1 , n ) networks’ synchronizability.
k n a d Q
λ 2 = min { Q d , Δ 2 } Δ 2 < Q d
Δ 2 > Q d
r = λ m a x / λ 2 Δ 2 < Q d
Δ 2 > Q d
Δ 2 = n + 3 ( n + 3 ) 2 8 2 a , ↑ strengthen, ↓ weaken, − unchanged.
Table 3. Relationships between all parameters affecting G p Q ( p , k + 1 p , n ) ( 3 p k ) networks’ synchronizability.
Table 3. Relationships between all parameters affecting G p Q ( p , k + 1 p , n ) ( 3 p k ) networks’ synchronizability.
k n a d Q
λ 2 = min { Q d , Δ 3 } Δ 3 < Q d
Δ 3 > Q d
r = λ m a x / λ 2 Δ 3 < Q d
Δ 3 > Q d
Δ 3 = n + p + 1 ( n + p + 1 ) 2 4 p 2 a , ↑ strengthen, ↓ weaken, − unchanged.
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Gao, H.; Zhu, J.; Li, X.; Chen, X. Synchronizability of Multi-Layer-Coupled Star-Composed Networks. Symmetry 2021, 13, 2224. https://0-doi-org.brum.beds.ac.uk/10.3390/sym13112224

AMA Style

Gao H, Zhu J, Li X, Chen X. Synchronizability of Multi-Layer-Coupled Star-Composed Networks. Symmetry. 2021; 13(11):2224. https://0-doi-org.brum.beds.ac.uk/10.3390/sym13112224

Chicago/Turabian Style

Gao, Haiping, Jian Zhu, Xianyong Li, and Xing Chen. 2021. "Synchronizability of Multi-Layer-Coupled Star-Composed Networks" Symmetry 13, no. 11: 2224. https://0-doi-org.brum.beds.ac.uk/10.3390/sym13112224

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop