Next Article in Journal
Global Bifurcation Behaviors and Control in a Class of Bilateral MEMS Resonators
Next Article in Special Issue
A Novel Nonlinear Pseudorandom Sequence Generator for the Fractal Function
Previous Article in Journal
Portfolio Selection Models Based on Interval-Valued Conditional Value-at-Risk (ICVaR) and Case Study on the Data from Stock Markets
Previous Article in Special Issue
Fractional-Order Financial System and Fixed-Time Synchronization
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Synchronizability of Multilayer Directed Dutch Windmill Networks

1
Department of Mathematics, College of Science, Liaoning Technical University, Fuxin 123000, China
2
School of Software, Liaoning Technical University, Huludao 125105, China
*
Author to whom correspondence should be addressed.
Fractal Fract. 2022, 6(10), 537; https://doi.org/10.3390/fractalfract6100537
Submission received: 30 July 2022 / Revised: 6 September 2022 / Accepted: 19 September 2022 / Published: 23 September 2022
(This article belongs to the Special Issue Fractional-Order Chaotic System: Control and Synchronization)

Abstract

:
This paper investigates the synchronizability of multilayer directed Dutch windmill networks with the help of the master stability function method. Here, we propose three types of multilayer directed networks with different linking patterns, namely, inter-layer directed networks (Networks-A), intra-layer directed networks (Networks-B), and hybrid directed networks (Networks-C), and rigorously derive the analytical expressions of the eigenvalue spectrum on the basis of their supra-Laplacian matrix. It is found that network structure parameters (such as the number of layers and nodes, the intra-layer and the inter-layer coupling strengths) have a significant impact on the synchronizability in the case of the two typical synchronized regions. Finally, in order to confirm that the theoretical conclusions are correct, simulation experiments of multilayer directed network are delivered.

1. Introduction

The emergence of small-world networks and scale-free networks [1,2] has been the beginning of a large amount of significant research outcomes that have been obtained in complex networks. They are widely used in information networks, biological networks, neural networks, social networks, power grids, and other frontier fields [3,4,5,6,7]. It is recognized that most networks in reality do not exist independently but are composed of multiple networks coupling and interacting with each other [8,9]. With the development of network theory, many innovative advances in the field of multilayer networks have been gained, for instance, the control and synchronization of systems [10,11,12,13,14], the diffusion and superdiffusion in networks [15,16,17], consensus problems and robustness of multilayer networks [18,19,20].
Synchronization, such as clapping in unison and chorus cicadas, is a significant collective behavior on complex networks. Previous research has been conducted on different synchronization effects of single network, such as complete synchronization, generalized synchronization, phase synchronization, and finite-time synchronization [21,22,23,24]. Based on the asymptotic analysis, Fan et al. [25] provided some criteria of synchronization about complex dynamical networks that allowed us to infer the behavior of dynamics. In terms of the master stability function method, Xu et al. [26] focused on the two-layer star networks and studied that network parameters are important roles in affecting the synchronization capabilities of multilayer networks with more than two layers. Zhang et al. [27] derived an analytic expression for the eigenvalue spectrum of a multiplex k-nearest neighbor coupled network, and discussed the relationship between structure parameters and the synchronizability. Li et al. [28] analyzed the synchronization of dumbbell networks with two layers, comparing two interlink patterns between layers, and found that the coupling patterns is a discussion point for exploring the multilayer networks. It is necessary to study more types of networks with more than two layers to study the synchronizability. There are many regular and typical network structures; windmill network is one of them, and common windmill network types are the Dutch windmill network [29] and the French windmill network. Estrada [30] proved that the clustering coefficient was divergent with the network size increasing to infinity, as well as the transitivity. In addition, Kooij [31] considered three generalizations of windmill graphs, and studied topological properties and eigenvalue spectrum for all three types. Sun et al. [32] employed the first two generalized noisy windmill networks to study the consensus and robustness, quantifying all eigenvalues of their matrixes, about the leaderless model and the leader–follower model. Zhu et al. [33] derived all eigenvalues of two different variable coupling multilayer windmill-type network models and gave numerical experiments to demonstrate that the synchronizability can be improved by changing the structural parameters. Research on windmill networks have been dedicated to network structures and synchronizability with only one layer, and there are relatively few results of multilayer networks which are closer to the actual situation. Moreover, systems in the real world are more likely to be weighted directed networks. The direction and coupling weights make it difficult to obtain analytical expressions of eigenvalues of the Laplacian matrix.
Summarizing the above findings, it was found that the master stability function (MSF) method [34], used in this paper, is a particularly useful approach to investigate complex networks. We have the following innovations about multilayer directed Dutch windmill networks.
(1)
We propose three kinds of multilayer directed Dutch windmill networks with different inter-layer and intra-layer connection pattern.
(2)
With the help of graph spectra methods, we obtain the supra-Laplace matrix based on the structure of these networks. It is obvious that the expressions for the eigenvalues are expressed.
(3)
It is worth exploring to know that the synchronizability is associated with topological structure parameters (for example, network size N, the number of layers M, intra-layer coupling weights a, and inter-layer coupling weights d), which is studied by MSF when the synchronized regions are bounded and unbounded.
(4)
Under the given initial conditions, numerical experiments are conducted to show that the state trajectory of nodes could achieve synchronization. In addition, we verify the correctness of analytical results and offer a theoretical support for strengthening their ability of reaching synchronization.
This paper has the following section arrangement. Section 2 gives essential preliminaries and the models of multilayer directed networks. The eigenvalue spectrum of Networks-A, B, and C are rigorously derived in Section 3 and numerical examples are performed in Section 4 for interpreting the realizability of theoretical findings. Lastly, Section 5 draws the summarized comments.

2. Preliminaries

2.1. The Dynamic Models of Multilayer Networks

For a multilayer network consisting of M layers and N nodes each layer, the dynamics of x i α can be described as [35]:
d x i α d t = f ( x i α ) a j = 1 N w i j α Γ 1 ( x j α ) d β = 1 M d i α β Γ 2 ( x i β ) ,
where x i α R s is the state of the i th node in the α th layer, 1 i N ,   1 α M . f : R s R s is a nonlinear vector function governing the dynamics of the i th node in the α th. a denotes intra-layer coupling strength inside each layer and Γ 1 : R s R s is the corresponding inner coupling function. d respects inter-layer coupling strength between replicas and Γ 2 : R s R s is the inter-layer coupling function. For simplicity, let Γ 1 ( x j α ) = Γ 1 x j α , Γ 2 ( x i β ) = Γ 2 x i β and Γ 1 = Γ 2 = Γ . For an undirected network, if there is an edge connecting the i th node and the j th node in the α th layer ( i j ), w i j α = 1 , otherwise w i j α = 0 with w i i α = j = 1 , j i N w i j α . Thus, the intra-layer Laplacian matrix of the α th layer is described as L ( α ) = ( a w i j α ) R N × N . Similarly, if there is a link connecting the i th node and its replica across layers, d i α β = 1 , otherwise d i α β = 0 , and d i α α = β = 1 , β α M d i α β . L I = ( d d i α β ) R M × M is the inter-layer Laplacian matrix. In particular, when a node is unidirectionally connected to its other replica nodes, L I may be an upper triangular matrix or a lower triangular matrix.
For simplicity, we denote
x ( α ) = x 1 α x 2 α x N α , X = x ( 1 ) x ( 2 ) x ( M ) , f ˜ ( x ( α ) ) = f ( x 1 α ) f ( x 2 α ) f ( x N α ) , F ( x ) = f ˜ ( x ( 1 ) ) f ˜ ( x ( 2 ) ) f ˜ ( x ( M ) ) .
It follows that Equation (1) has a concise matrix form, namely,
X ˙ = F ( X ) ( L L + L I ) Γ X ,
where ⨂ is the Kronecker product. The intra-layer supra-Laplacian matrix L L , reflecting the coupling relationships within each layer, is the direct sum of L ( α ) . In detail,
L L = L ( 1 ) 0 0 0 L ( 2 ) 0 0 0 L ( M ) = α = 1 M L ( α ) .
L I = L I I N represents the links across layers, where I N stands for the identity matrix of N-dimensional. The supra-Laplacian matrix L of the multilayer network is replaced by L I and L L [36]:
L = L I + L L .

2.2. Synchronized Regions of Multilayer Networks

L represents the supra-Laplacian matrix of multilayer networks, having one zero eigenvalue and all other eigenvalues are positive: 0 = λ 1 < λ 2 λ m a x . Based on the concept of MSF, it is general to group the synchronized region ( S R ) in four cases as follows [37]:
(1)
S R = ( α 1 , + ) denotes the unbounded synchronized region, where α 1 is a finite positive real number. If λ 2 is greater than the threshold α 1 , which portrays the synchronizability of the network, and all larger eigenvalues will be included in the S R . Therefore, the larger λ 2 is, the stronger the synchronizability is.
(2)
S R = ( α 1 , α 2 ) denotes the bounded synchronized region, where α 1 and α 2 are finite positive real numbers and α 1 < α 2 . In order to make all values fall within the synchronization field, it is obvious that after deformation the eigenratio can be found, which satisfies r = λ m a x / λ 2 < α 2 / α 1 . Moreover, the lower ratio r demonstrates higher capability of achieving synchronization.
(3)
The synchronized region is the union of several intervals. For instance, in the form of S R = ( α 1 , α 2 ) ( α 3 , α 4 ) . If all λ i are restricted to the range of S R , then the synchronization can be realized and the states of all nodes in the network converge to a steady state.
(4)
The synchronized region is an empty set. In this case, synchronization is not possible regardless of the variation of the coupling function and coupling strength.
Which type of synchronization domain a network belongs to is primarily decided by the inner coupling function Γ and dynamics functions f. Here, the study of the first two scenarios, the bounded and unbounded synchronous regions, is representative. When it comes to the synchronizability, it is of vital simplicity for us to derive the second smallest eigenvalue and eigenratio of its Laplacian matrix for directed Dutch windmill networks.

2.3. Multilayer Directed Dutch Windmill Networks

This paper gives the eigenvalue expression and studies the synchronizability for multilayer directed Dutch windmill networks. It can be supposed simply that multiplex networks has M layers and the network size N is identical for each layer. One possible type of inter-layer connections means the each node is one-to-one connected into its replicas that are not on the same layer. Generally, a windmill graph contains η copies of the complete network K k [38] and windmill networks are rule networks. In this article, the nodes on each layer, related to the multilayer directed Dutch windmill networks, satisfies N = 2 η + 1. It is quite easy to see that N is proportional to η .
The two interlayer connection methods of each node, undirected one-to-one connection and unidirectional one-to-one coupling, are considered. For the former, undirected links, or bidirectional, exist between the nodes of each two layers. For the latter, nodes within a layer are unidirectionally connected to replicated nodes in other layers, without duplicating. Moreover, there are different types of linking patterns, occurring among nodes within each layer: directed with the same sequence and undirected. Because of the aim of studying the synchronizability of directed networks, three kinds of multilayer directed Dutch windmill networks, multilayer inter-layer directed Dutch windmill networks (Networks-A), multilayer intra-layer directed Dutch windmill networks (Networks-B), and multilayer both inter-layer and intra-layer directed Dutch windmill networks (Networks-C) are defined. For Networks-A, the inter-layer interconnection method is unidirectional coupling between replica nodes, and the intra-layer interconnection method is undirected. On the contrary, Networks-B means that the nodes are directionally connected in the same sequence within each layer but undirected between replica nodes across layers. In addition, Networks-C is a combination of Networks-A and Networks-B which is directed connected within layers and unidirectional coupling between layers. Figure 1 shows the corresponding structure with two layers.
To make convenient the following theoretical derivation, useful lemmas are presented as follows:
Lemma 1
([39]). If A i i is a square matrix, i = 1 , , k , then
A 11 A 12 A 1 k 0 A 22 A 2 k 0 0 A k k = | A 11 | · | A 22 | | A k k | .
Lemma 2
([40]). Let S be a square matrix and T have the same size, then
S T T T S T T T S M × M = | S T | M 1 · | S + ( M 1 ) T | .

3. The Synchronizability of Multilayer Directed Dutch Windmill Networks

3.1. The Eigenvalues of Networks-A

This section considers the generalized Networks-A with M layers each is made up of N nodes whose diagram is shown in Figure 2. The corresponding supra-Laplacian matrix is obtained, expressed as L A :
L A = a L A + ( M 1 ) d I N d I N d I N 0 a L A + ( M 2 ) d I N d I N 0 0 a L A M × M ,
where
L A = 2 η 1 1 1 1 1 1 1 2 1 0 0 0 0 1 1 2 0 0 0 0 1 0 0 0 0 2 1 1 0 0 0 0 1 2 N × N .
In accordance with Lemma 1 introduced earlier, the characteristic polynomial of L A can be given:
| λ I M N L A | = [ λ ( M 1 ) d ] I N a L A d I N d I N 0 [ λ ( M 2 ) d ] I N a L A d I N 0 0 λ I N a L A | [ λ ( M 1 ) d ] I N a L A | · [ λ ( M 2 ) d ] I N a L A d I N 0 λ I N a L A = | λ I N a L A | · | ( λ d ) I N a L A | · | ( λ 2 d ) I N a L A | | ( λ ( M 2 ) d ) I N a L A | · | ( λ ( M 1 ) d ) I N a L A | .
Let | λ I N a L A | = 0 , the undirected Dutch windmill network has the eigenvalues:
0 , a , , a η 1 , 3 a , , 3 a η , ( 2 η + 1 ) a .
Let | ( λ k d ) I N a L A | = 0 , k = 1 , 2 , , M 1 , it follows that:
k d , a + k d , , a + k d η 1 , 3 a + k d , , 3 a + k d η , ( 2 η + 1 ) a + k d .
Therefore, L A has the following eigenvalues:
0 , a , , a η 1 , 3 a , , 3 a η , ( 2 η + 1 ) a , d , a + d , , a + d η 1 , 3 a + d , , 3 a + d η , ( 2 η + 1 ) a + d , 2 d , a + 2 d , , a + 2 d η 1 , 3 a + 2 d , , 3 a + 2 d η , ( 2 η + 1 ) a + 2 d , , ( M 1 ) d , a + ( M 1 ) d , , a + ( M 1 ) d η 1 , 3 a + ( M 1 ) d , , 3 a + ( M 1 ) d η , ( 2 η + 1 ) a + ( M 1 ) d .
Deduced from the preliminary knowledge, we get the minimum non-zero eigenvalue
λ 2 = m i n { a , d } ,
and the maximum eigenvalues
λ m a x = ( M 1 ) d + ( 2 η + 1 ) a .
Then we have
r = ( M 1 ) d + ( 2 η + 1 ) a m i n { a , d } = ( M 1 ) d a + 2 η + 1 , a < d , ( M 1 ) + ( 2 η + 1 ) a d , a d .
From Equation (11), we can get that λ 2 is only related to coupling strength a and d, not to M and η . This means that λ 2 changes with increasing a or d, and keeps invariant with increasing M or η . In Equation (13), for example, when a < d , r is proportional to η , M, d respectively, and inversely proportional to a. This means that when η , M, d (controlling for only one parameter change) becomes larger, r increases; when a becomes larger, r decreases. For the sake of brief overview, Table 1 summarises the changes of λ 2 , r.

3.2. The Eigenvalues of Networks-B

According to the structural definition of M-layer Networks-B having N nodes each layer, the supra-Laplacian matrix L B is:
L B = a L B + ( M 1 ) d I N d I N d I N d I N a L B + ( M 1 ) d I N d I N d I N d I N a L B + ( M 1 ) d I N M × M ,
where
L B = η 1 0 1 0 1 0 0 1 1 0 0 0 0 1 0 1 0 0 0 0 0 0 0 0 0 1 1 1 0 0 0 0 0 1 N × N .
By the second lemma mentioned earlier, the eigenpolynomial of L B is:
| λ I 2 N L B | = [ λ ( M 1 ) d ] I N a L B d I N d I N d I N [ λ ( M 1 ) d ] I N a L B d I N d I N d I N [ λ ( M 1 ) d ] I N a L B = | λ I N a L B | · | ( λ M d ) I N a L B | M 1 .
The eigenvalues of L B are:
0 , a , , a 2 ( η 1 ) , ( η + 2 ) + η ( η 4 ) 2 a , ( η + 2 ) η ( η 4 ) 2 a , M d , , M d M 1 , a + M d , , a + M d 2 ( η 1 ) ( M 1 ) , ( η + 2 ) + η ( η 4 ) 2 a + M d , , ( η + 2 ) + η ( η 4 ) 2 a + M d M 1 , ( η + 2 ) η ( η 4 ) 2 a + M d , , ( η + 2 ) η ( η 4 ) 2 a + M d M 1 .
The secondary smallest eigenvalue λ 2 is not related to η and the maximum eigenvalue λ m a x is affected by all parameters which are respectively shown as:
λ 2 = m i n { a , M d } , λ m a x = ( η + 2 ) + η ( η 4 ) 2 a + M d ,
where η 4 . The relations between the structural parameters variables and the indicators, λ 2 and r = λ m a x / λ 2 , are summarized in Table 2.

3.3. The Eigenvalues of Networks-C

Similar to the analysis of Networks-A and Networks-B, the Laplacian matrix of Networks-C consisting of M layers is shown:
L C = a L C + ( M 1 ) d I N d I N d I N d I N 0 a L C + ( M 2 ) d I N d I N d I N 0 0 0 a L C M × M ,
where L C = L B , and we can get the characteristic polynomials of L C :
| λ I M N L C | = | λ I N a L C | · | ( λ d ) I N a L C | · | ( λ 2 d ) I N a L C | | ( λ ( M 2 ) d ) I N a L C | · | ( λ ( M 1 ) d ) I N a L C | = | λ I N a L B | · | ( λ d ) I N a L B | · | ( λ 2 d ) I N a L B | | ( λ ( M 2 ) d ) I N a L B | · | ( λ ( M 1 ) d ) I N a L B | .
Then, the eigenvalue spectrum of L C can be written as:
0 , a , , a 2 ( η 1 ) , ( η + 2 ) + η ( η 4 ) 2 a , ( η + 2 ) η ( η 4 ) 2 a , d , a + d , , a + d 2 ( η 1 ) , ( η + 2 ) + η ( η 4 ) 2 a + d , ( η + 2 ) η ( η 4 ) 2 a + d , 2 d , a + 2 d , , a + 2 d 2 ( η 1 ) , ( η + 2 ) + η ( η 4 ) 2 a + 2 d , ( η + 2 ) η ( η 4 ) 2 a + 2 d , , ( M 1 ) d , a + ( M 1 ) d , , a + ( M 1 ) d 2 ( η 1 ) , ( η + 2 ) + η ( η 4 ) 2 a + ( M 1 ) d , ( η + 2 ) η ( η 4 ) 2 a + ( M 1 ) d .
It is apparently possible for us to obtain λ 2 and λ m a x ,
λ 2 = m i n { a , d } , λ m a x = ( η + 2 ) + η ( η 4 ) 2 a + ( M 1 ) d .
Changes of λ 2 and the eigenratio r = λ m a x / λ 2 are summarized in Table 3.

4. Numerical Simulation

This section provides simulation experiments and explanation of results to investigate the synchronizability of three kinds of directed Dutch windmill M layer networks, which are performed by Matlab. First, we study the state trajectory of nodes in a specific directed networks with given dynamical equations. By calculating the synchronized region and selecting appropriate values of coupling strength, it can be seen that the network can achieve synchronization. Then, the variation of synchronizability, keeping one parameter variable while the others are constant, can be explained by the curves in figures. Finally, an optimization scheme in these experiments and optimal solution for general case are obtained.
Taking a concrete structure of Network-C (see Figure 1c) as an example, having two layers and seven nodes in each layer, we can analyze its synchronization. It can expressed that the dynamical equations of nodes in this network is
d x i α d t = a r c t a n ( x i α ) a j = 1 N w i j α x j α d β = 1 M d i α β x i β ,
where x i α is the state of nodes for i = 1 , 2 , , 7 , α , β = 1 , 2 . In accordance with the master stability equation of Equation (22), the synchronized region can be calculated as S R = ( 1 , + ) . Let a = 1.5 , d = 2 , we get the eigenvalue λ 2 = m i n { a , d } = 1.5 S R . Randomly select the initial state of the nodes in this system and display the evolution of state in Figure 3. It can be seen that the synchronization is achieved.

4.1. The Synchronizability of Networks-A

(1)
Let M = 2 , η = 100 , d = 1 , Figure 4a,b show the ralationship between synchronizability of Networks-A and the intra-layer coupling strength a. When the synchronized region is unbounded, it is clear that the value of λ 2 grows linearly with increasing a ( a < a * = d ), and then remains unchanged at λ 2 = 1 ( a a * ). This means that the synchronizability of Networks-A is first strengthened and then remains unchanged with increasing a. When the synchronized region is bounded, the value of r decreases slowly with small a ( a < a * ) and then increases linearly with ever-increasing a. This indicates the synchronizability is strengthened firstly, and gets diminished continuously after reaching the maximum with increasing intra-layer coupling weight a. The synchronizability of inter-layer directed Networks-A is optimum at a * = d = 1 .
(2)
Let M = 2 , η = 100 , a = 1 , the relationship between the synchronizability and the inter-layer coupling strength d is shown in Figure 4c,d. When it comes to the unbounded synchronized region, Figure 4c depicts that the value of λ 2 = d increases linearly when d d * = a. When d > d * , it remains an invariant value λ 2 = 1 . This implies with improving a, the synchronizability of Networks-A is strengthened firstly and then remains unchanged. When it comes to the bounded synchronized region, Figure 4d depicts that the value of r decreases firstly ( d d * ) and then enlarges slowly ( d > d * ). This implies that the synchronizability is improved at the begining, and then continuously reduced after reaching the optimum at d * = a = 1 .
(3)
Let a = 2 , d = 1 , M = 2 , the relationship between the number of leaves η and the synchronizability of Networks-A is shown in Figure 5a,b. Because each layer has N nodes, satisfying N = 2 η + 1 , we can plot λ 2 and r changing with η to analyze the impact of the number of leaves η on network synchronizability. From Figure 5a, when talking about the unbounded synchronized region, it is clear that the value of λ 2 remains invariant with the increase of η . This indicates that the network size N does not take into account the synchronizability of Networks-A. Figure 5b shows that the synchronizability, the bounded synchronized region, is weakened because r increases as η increases.
(4)
Let a = 2 , d = 1 , η = 50 , the relationship between the value of M and the synchronizability is shown in Figure 5c,d. In the unbounded synchronized region, λ 2 of the supra-Laplacian matrix does not change with the increase of M which means that the capacity of synchronization is unaffected by the number of layers. In the bounded synchronized region, the value of r increases and the network synchronizability is eroded when M increases from 2 to 50, indicating that synchronizability is diminished as the layers increases.

4.2. The Synchronizability of Networks-B

(1)
Let M = 2 , η = 100 , d = 1 . Figure 6a,b show the variation of λ 2 and r relative to different values of the intra-layer coupling strength a. For the unbounded synchronized region, it clearly shows that the value of λ 2 increases linearly at first with a ( a < a * = 2 d ), and then remains invariant at λ 2 = 2 ( a a * ). This implies that the synchronizability of Networks-B is first strengthened and then holds constant with the increase of intra-layer coupling strength a. For the unbounded synchronized region, panel (b) shows that the value of r firstly decreases slowly and indicates that the synchronizability of Networks-B is enlarged when a < a * . It increases monotonically when a > a * , representing the capacity becoming weaker. The synchronizability, reaching the optimum with the increase of a, is maximized at a * = M d = 2 .
(2)
Let M = 2 , η = 100 , a = 1 , the influence of the inter-layer coupling strength d on the synchronizability of Networks-B is display in Figure 6c,d. When d increases from 0 to 0.5 ( d d * ), the smallest nonzero eigenvalue λ 2 increases, the eigenratio r decreases sharply, and the network synchronizability is strengthened. When d increases from 0.5 to 5 ( d > d * ), λ 2 remains a fixed value at 1 means that the capability of synchronization is not influenced by d. While r increases slightly showing a weakening in synchronizability of intra-layer directed networks. The optimal solution of Networks-B is derived at d * = a / 2 = 0.5 .
(3)
Let a = 0.5 , d = 1 , M = 2 , η 4 . In the case of the unbounded synchronized region, panel (a) in Figure 7 shows that the value of λ 2 does not vary with the increase of η , which indicates that the number of nodes N does not show any effect on the synchronization ability of Networks-B. In the bounded synchronized region, panel (b) shows that the synchronizability is weakened because r becomes larger when η changes from 1 to 100.
(4)
Let a = 1 , d = 0.1 , η = 50 . Unlike the analysis result of Networks-A for the number of layers, panel (c) shows that λ 2 monotonically increases from 0.2 to 1, and then keeps invariant at 1. panel (d) shows that the eigenratio r, determined with λ m a x and λ 2 , decreases and then increases slightly when the number M changes from 2 to 50.

4.3. The Synchronizability of Networks-C

According to the numerical examples shown in Figure 8 and Figure 9, the synchronizability of Networks-C changing with the increasing network parameters is similar to Networks-A. In the case of the unbounded synchronized region, λ 2 increases firstly and then transforms into a constant value whether with the intra-layer linking intensity a or the inter-layer linking intensity d. This property that the synchronizability of multilayer networks first increases and then remains constant is reflected in the figures. For the number of leaves η within each layer and the number of layers M, λ 2 remains constant. This means that the synchronization capacity always remains a constant when the network size tends to infinity. In other words, in the case of the bounded synchronized region, the value of r, decreasing firstly and then increasing slightly whether for a or d, represents the evolution of synchronization capacity. When talking about the bounded synchronized region the synchronizability for this particular network is enhanced firstly, and then is diminished after achieving the optimum. For η and M, the value of r increases linearly which means that the network synchronizability gets weaker as the network size increases.

5. Conclusions

This paper examined the synchronizability for multilayer directed Dutch windmill networks. The analytical expressions for all eigenvalues of the three networks have been rigorously derived and specific relations of synchronizability are given in Table 1, Table 2 and Table 3 that have been well verified by numerical simulation. By varying a single parameter, we discussed the impacts of the intra-layer coupling weights a, the inter-layer coupling weights d, network size N as well as the number of layers M on network synchronizability.
The effects of changes in all structure parameters upon the network synchronizability for Networks-A and Networks-C are similar. When taking into account the synchronization region with unbounded range, there are only two coupling weights a and d have remarkable influence on the synchronizability of Networks-A and Networks-C. However, for Networks-B, not only the coupling strength but also the number of layers have an influence on the synchronizability of the network. When taking into account the synchronization region with bounded range, the fewer nodes, the better the synchronizability. In addition, we would further discuss methods to improve or weaken the synchronization of multilayer directed networks in order to control the synchronization phenomenon in real life. There are still many problems to be solved in directed Dutch windmill networks. For example, when the strength of inter-layer coupling between central nodes differs from the strength of coupling between leaf nodes, we can study the change of synchronizability. Recently, the diffusion and coherence of networks are challenging and attractive topics, which are worthy of our further study of multilayer directed windmill networks.

Author Contributions

Y.W. and X.Z. contributed to the conception of the formulation or evolution of overarching study goals and aims. Y.W. organized the literature. X.Z. wrote the initial draft and performed the design of numerical experiments. All authors have read and agreed to the published version of the manuscript.

Funding

This work was supported by the National Natural Science Foundations of China (Grant No. 52174184).

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Data sharing is not applicable to this article, as no new data were created or analyzed in this study.

Acknowledgments

The authors are very grateful to the anonymous referees for their thorough review of this work and their comments.

Conflicts of Interest

The authors declare no conflict of interest regarding the publication of this paper.

References

  1. Watts, D.J.; Strogatz, S.H. Collective dynamics of ‘small-world’networks. Nature 1998, 393, 440–442. [Google Scholar] [CrossRef] [PubMed]
  2. Barabási, A.L.; Albert, R. Emergence of scaling in random networks. Science 1999, 286, 509–512. [Google Scholar] [CrossRef] [PubMed]
  3. Buldyrev, S.V.; Parshani, R.; Paul, G.; Stanley, H.E.; Havlin, S. Catastrophic cascade of failures in interdependent networks. Nature 2010, 464, 1025–1028. [Google Scholar] [CrossRef] [PubMed]
  4. Borgatti, S.P.; Mehra, A.; Brass, D.J.; Labianca, G. Network analysis in the social sciences. Science 2009, 323, 892–895. [Google Scholar] [CrossRef] [PubMed]
  5. 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]
  6. Wu, X.; Li, Y.N.; Wei, J.; Zhao, J.; Feng, J.; Lu, J.A. Inter-layer synchronization in two-layer networks via variable substitution control. J. Frankl. Inst. 2020, 357, 2371–2387. [Google Scholar] [CrossRef]
  7. Xiao, J.; Zeng, Z.G.; Wen, S.P.; Wu, A.L.; Wang, L.M. Finite-/fixed-time synchronization of delayed coupled discontinuous neural networks with unified control schemes. IEEE Trans. Neural Netw. Learn. Syst. 2020, 32, 2535–2546. [Google Scholar] [CrossRef]
  8. Newman, M. Networks: An Introduction, 1st ed.; Oxford University Press: Oxford, MI, USA, 2010. [Google Scholar]
  9. Bianconi, G. Multilayer Networks: Structure and Function, 1st ed.; Oxford University Press: Oxford, MI, USA, 2018. [Google Scholar]
  10. Wang, S.; Zheng, S.; Cui, L. Finite-Time Projective Synchronization and Parameter Identification of Fractional-Order Complex Networks with Unknown External Disturbances. Fractal Fract. 2022, 6, 298. [Google Scholar] [CrossRef]
  11. Qi, F.; Qu, J.; Chai, Y.; Chen, L.; Lopes, A.M. Synchronization of incommensurate fractional-order chaotic systems based on linear feedback control. Fractal Fract. 2022, 6, 221. [Google Scholar] [CrossRef]
  12. Wei, J.; Wu, X.; Lu, J.A.; Wei, X. Synchronizability of duplex regular networks. EPL (Europhys. Lett.) 2018, 120, 20005. [Google Scholar] [CrossRef]
  13. Wei, X.; Emenheiser, J.; Wu, X.; Lu, J.A.; D’Souza, R.M. Maximizing synchronizability of duplex networks. Chaos Interdiscip. J. Nonlinear Sci. 2018, 28, 013110. [Google Scholar] [CrossRef] [PubMed]
  14. Wei, X.; Wu, X.; Lu, J.A.; Wei, J.; Zhao, J.; Wang, Y. Synchronizability of two-layer correlation networks. Chaos Interdiscip. J. Nonlinear Sci. 2021, 31, 103124. [Google Scholar] [CrossRef] [PubMed]
  15. Gomez, S.; Diaz-Guilera, A.; Gomez-Gardenes, J.; Perez-Vicente, C.J.; Moreno, Y.; Arenas, A. Diffusion dynamics on multiplex networks. Phys. Rev. Lett. 2013, 110, 028701. [Google Scholar] [CrossRef] [PubMed]
  16. 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]
  17. Yan, H.; Zhou, J.; Li, W.; Lu, J.A.; Fan, R. Superdiffusion criteria on duplex networks. Chaos Interdiscip. J. Nonlinear Sci. 2021, 31, 073108. [Google Scholar] [CrossRef]
  18. Hu, T.; Li, L.; Wu, Y.; Sun, W. Consensus dynamics in noisy trees with given parameters. Mod. Phys. Lett. B 2022, 36, 2150608. [Google Scholar] [CrossRef]
  19. Hong, M.D.; Sun, W.G.; Liu, S.Y.; Xuan, T.F. Coherence analysis and Laplacian energy of recursive trees with controlled initial states. Front. Inf. Technol. Electron. Eng. 2020, 21, 931–938. [Google Scholar] [CrossRef]
  20. Li, Y.; Zhong, J.; Lu, J.; Wang, Z.; Alssadi, F.E. On robust synchronization of drive-response Boolean control networks with disturbances. Math. Probl. Eng. 2018, 2018, 1737685. [Google Scholar] [CrossRef]
  21. Leyva, I.; Sevilla-Escoboza, R.; Sendiña-Nadal, I.; Gutiérrez, R.; Buldú, J.; Boccaletti, S. Inter-layer synchronization in non-identical multi-layer networks. Sci. Rep. 2017, 7, 45475. [Google Scholar] [CrossRef]
  22. Yu, W.; Lu, J.; Yu, X.; Chen, G. Distributed adaptive control for synchronization in directed complex networks. SIAM J. Control Optim. 2015, 53, 2980–3005. [Google Scholar] [CrossRef]
  23. Wang, Y.W.; Bian, T.; Xiao, J.W.; Wen, C. Global synchronization of complex dynamical networks through digital communication with limited data rate. IEEE Trans. Neural Netw. Learn. Syst. 2015, 26, 2487–2499. [Google Scholar] [CrossRef] [PubMed]
  24. Wang, L.M.; Jiang, S.; Ge, M.F.; Hu, C.; Hu, J.H. Finite-/fixed-time synchronization of memristor chaotic systems and image encryption application. IEEE Trans. Circuits Syst. Regul. Pap. 2021, 68, 4957–4969. [Google Scholar] [CrossRef]
  25. Fan, C.X.; Jiang, G.P.; Jiang, F.H. Synchronization between two complex dynamical networks using scalar signals under pinning control. IEEE Trans. Circuits Syst. Regul. Pap. 2010, 57, 2991–2998. [Google Scholar] [CrossRef]
  26. Xu, M.M.; Lu, J.A.; Zhou, J. Synchronizability and eigenvalues of two-layer star networks. Acta Phys. Sin. 2016, 65, 028902. [Google Scholar]
  27. Zhang, L.; Wu, Y.Q. Synchronizability of Multilayer networks With K-nearest-neighbor Topologies. Front. Phys. 2020, 8, 571507. [Google Scholar] [CrossRef]
  28. Li, J.; Luan, Y.; Wu, X.; Lu, J.A. Synchronizability of double-layer dumbbell networks. Chaos Interdiscip. J. Nonlinear Sci. 2021, 31, 073101. [Google Scholar] [CrossRef]
  29. Kanna, M.R.; Kumar, R.P.; Jagadeesh, R. Computation of topological indices of Dutch windmill graph. Open J. Discret. Math. 2016, 6, 74–81. [Google Scholar] [CrossRef]
  30. Estrada, E. When local and global clustering of networks diverge. Linear Algebra Appl. 2016, 488, 249–263. [Google Scholar] [CrossRef]
  31. Kooij, R. On generalized windmill graphs. Linear Algebra Appl. 2019, 565, 25–46. [Google Scholar] [CrossRef]
  32. Sun, W.; Li, Y.; Liu, S. Noisy consensus dynamics in windmill-type graphs. Chaos Interdiscip. J. Nonlinear Sci. 2020, 30, 123131. [Google Scholar] [CrossRef]
  33. 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]
  34. Tang, L.; Wu, X.; Lü, J.; Lu, J.A.; D’Souza, R.M. 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]
  35. Zhang, S.; Wu, X.; Lu, J.A.; Feng, H.; Lü, J. Recovering structures of complex dynamical networks based on generalized outer synchronization. IEEE Trans. Circuits Syst. Regul. Pap. 2014, 61, 3216–3224. [Google Scholar] [CrossRef]
  36. Sole-Ribalta, A.; De Domenico, M.; Kouvaris, N.E.; Diaz-Guilera, A.; Gomez, S.; Arenas, A. Spectral properties of the Laplacian of multiplex networks. Phys. Rev. E 2013, 88, 032807. [Google Scholar] [CrossRef] [PubMed]
  37. Wang, X.F.; Li, X.; Chen, G.R. Network Science: An Introduction, 1st ed.; High Education Press: Beijing, China, 2012. (In Chinese) [Google Scholar]
  38. Gallian, J.A. A survey: Recent results, conjectures, and open problems in labeling graphs. J. Graph Theory 1989, 13, 491–504. [Google Scholar] [CrossRef]
  39. Horn, R.A.; Johnson, C.R. Matrix Analysis, 2nd ed.; Cambridge University Press: New York, NY, USA, 2013. [Google Scholar]
  40. Deng, Y.; Jia, Z.; Yang, F. Synchronizability of multilayer star and star-ring networks. Discret. Dyn. Nat. Soc. 2020, 2020, 9143917. [Google Scholar] [CrossRef]
Figure 1. Schematic diagram of multilayer directed Dutch windmill networks. (a) Networks-A with two layers; (b) Networks-B with two layers; (c) Networks-C with two layers.
Figure 1. Schematic diagram of multilayer directed Dutch windmill networks. (a) Networks-A with two layers; (b) Networks-B with two layers; (c) Networks-C with two layers.
Fractalfract 06 00537 g001
Figure 2. Structure schematic diagram of Networks-A with M layers.
Figure 2. Structure schematic diagram of Networks-A with M layers.
Fractalfract 06 00537 g002
Figure 3. State trajectories of the two-layer Networks-C with 7 nodes in each layer. The trajectories of the first layer are plotted as red dashed lines, and the trajectories of the second layer are plotted as blue solid lines.
Figure 3. State trajectories of the two-layer Networks-C with 7 nodes in each layer. The trajectories of the first layer are plotted as red dashed lines, and the trajectories of the second layer are plotted as blue solid lines.
Fractalfract 06 00537 g003
Figure 4. The synchronizability of Networks-A. Panel (a) depicts λ 2 vs. a and (b) depicts r vs. a when M = 2 , η = 100 , d = 1 ; Panel (c) depicts λ 2 vs. d and (d) depicts r vs. d when M = 2 , η = 100 , a = 1 .
Figure 4. The synchronizability of Networks-A. Panel (a) depicts λ 2 vs. a and (b) depicts r vs. a when M = 2 , η = 100 , d = 1 ; Panel (c) depicts λ 2 vs. d and (d) depicts r vs. d when M = 2 , η = 100 , a = 1 .
Fractalfract 06 00537 g004
Figure 5. The synchronizability of Networks-A. Panel (a) depicts λ 2 vs. η and (b) depicts r vs. η when a = 2 , d = 1 , M = 2 ; Panel (c) depicts λ 2 vs. M and (d) depicts r vs M when a = 1 , d = 1 , η = 50 .
Figure 5. The synchronizability of Networks-A. Panel (a) depicts λ 2 vs. η and (b) depicts r vs. η when a = 2 , d = 1 , M = 2 ; Panel (c) depicts λ 2 vs. M and (d) depicts r vs M when a = 1 , d = 1 , η = 50 .
Fractalfract 06 00537 g005
Figure 6. The synchronizability of Networks-B. Panel (a) depicts λ 2 vs. a and (b) depicts r vs. a when M = 2 , η = 100 , d = 1 ; Panel (c) depicts λ 2 vs. d and (d) depicts r vs. d when M = 2 , η = 100 , a = 1 .
Figure 6. The synchronizability of Networks-B. Panel (a) depicts λ 2 vs. a and (b) depicts r vs. a when M = 2 , η = 100 , d = 1 ; Panel (c) depicts λ 2 vs. d and (d) depicts r vs. d when M = 2 , η = 100 , a = 1 .
Fractalfract 06 00537 g006
Figure 7. The synchronizability of Networks-B. Panel (a) depicts λ 2 vs. η and (b) depicts r vs. η when a = 0.5 , d = 1 , M = 2 ; Panel (c) depicts λ 2 vs. M and (d) depicts r vs. M when a = 1 , d = 0.1 , η = 50 .
Figure 7. The synchronizability of Networks-B. Panel (a) depicts λ 2 vs. η and (b) depicts r vs. η when a = 0.5 , d = 1 , M = 2 ; Panel (c) depicts λ 2 vs. M and (d) depicts r vs. M when a = 1 , d = 0.1 , η = 50 .
Fractalfract 06 00537 g007
Figure 8. The synchronizability of Networks-C. Panel (a) depicts λ 2 vs. a and (b) depicts r vs. a when η = 100 , d = 1 , M = 2 ; Panel (c) depicts λ 2 vs. d and (d) depicts r vs. d when η = 100 , a = 1 , M = 2 .
Figure 8. The synchronizability of Networks-C. Panel (a) depicts λ 2 vs. a and (b) depicts r vs. a when η = 100 , d = 1 , M = 2 ; Panel (c) depicts λ 2 vs. d and (d) depicts r vs. d when η = 100 , a = 1 , M = 2 .
Fractalfract 06 00537 g008aFractalfract 06 00537 g008b
Figure 9. The synchronizability of Networks-C. Panel (a) depicts λ 2 vs. η and (b) depicts r vs. η when a = 1 , d = 1 , M = 2 ; Panel (c) depicts λ 2 vs. M and (d) depicts r vs. M when a = 1 , d = 1 , η = 50 .
Figure 9. The synchronizability of Networks-C. Panel (a) depicts λ 2 vs. η and (b) depicts r vs. η when a = 1 , d = 1 , M = 2 ; Panel (c) depicts λ 2 vs. M and (d) depicts r vs. M when a = 1 , d = 1 , η = 50 .
Fractalfract 06 00537 g009
Table 1. Changes of λ 2 , r with a , d , M , η of multilayer Networks-A.
Table 1. Changes of λ 2 , r with a , d , M , η of multilayer Networks-A.
  Increase ofadM η
λ 2 a < d λ 2 = a
a d λ 2 = d
r = λ m a x λ 2 a < d r = 2 η + 1 + ( M 1 ) d a
a d r = ( 2 η + 1 ) a d + ( M 1 )
↑: increase; ↓: decrease; −: unchange.
Table 2. Changes of λ 2 , r with a , d , M , η of multilayer Networks-B.
Table 2. Changes of λ 2 , r with a , d , M , η of multilayer Networks-B.
  Increase ofadM η
λ 2 a < M d λ 2 = a
a M d λ 2 = M d
r = λ m a x λ 2 a < M d r = ( η + 2 ) + η ( η 4 ) 2 + M d a
a M d r = ( η + 2 ) + η ( η 4 ) 2 a M d + 1
↑: increase; ↓: decrease; −: unchange.
Table 3. Changes of λ 2 , r with a , d , M , η of multilayer Networks-C.
Table 3. Changes of λ 2 , r with a , d , M , η of multilayer Networks-C.
  Increase ofadM η
λ 2 a < d λ 2 = a
a d λ 2 = d
r = λ m a x λ 2 a < d r = ( η + 2 ) + η ( η 4 ) 2 + ( M 1 ) d a
a d r = ( η + 2 ) + η ( η 4 ) 2 a d + ( M 1 )
↑: increase; ↓: decrease; −: unchange.
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Wu, Y.; Zhang, X. Synchronizability of Multilayer Directed Dutch Windmill Networks. Fractal Fract. 2022, 6, 537. https://doi.org/10.3390/fractalfract6100537

AMA Style

Wu Y, Zhang X. Synchronizability of Multilayer Directed Dutch Windmill Networks. Fractal and Fractional. 2022; 6(10):537. https://doi.org/10.3390/fractalfract6100537

Chicago/Turabian Style

Wu, Yongqing, and Xiao Zhang. 2022. "Synchronizability of Multilayer Directed Dutch Windmill Networks" Fractal and Fractional 6, no. 10: 537. https://doi.org/10.3390/fractalfract6100537

Article Metrics

Back to TopTop