Inverse Log-logistic distribution for Extreme Wind Speed modeling: Genesis, identification and Bayes estimation

1.   Introduction

In recent years, complex networks research has aroused particular concern in many different realms of science. With the development of the telecommunication, internet and international exchange, the conception of complex networks increasingly appears in human's productive activity, scientific research and daily life, such as e-commerce warehouse logistics, multinational social media and unmanned aerial vehicle (UAV) formation. Erdös and Rényi Explored a random graph model firstly in 1959 ^[1]. In a random graph, the probability of a connection emerged between a pair of nodes is a random constant. Watts and Strogatz ^[2] investigated the mechanism that a regular graph gradually converts to a random graph and proposed a small-world network model. Newman and Watts ^[3] modified it to generate another variant of the small-world model. In 1999 ^[4], Barabási and Albert proposed a scale-free network model that aroused intense scholarly interest. The degree distribution of nodes in a scale-free network follows a power-law form. The founding of scale-free networks is significant since plenty of real-word systems have the power-law property.

The research of complex networks simultaneously raised the attention on synchronization. Pecora and Carroll's work was the early research on synchronization ^[5]. Wu studied a linearly coupled identical dynamical system and obtained synchronization sufficient conditions of the system ^[6]. Louis M. Pecora and Thomas L studied a coupled oscillator array described as a complex network ^[7]. The author put the complex network into a simple form so that the determination of the stability of the synchronous state can be done by a master stability function. Substantial work has been devoted to the study of synchronization since there are many systems in real-word that can be described by complex networks ^[8,9]. A synchronization of heterogeneous dynamics networks via three-layer communication framework was established in ^[10]. An explicit synchronization algorithm was proposed, in which the synchronization errors of all the agents are decoupled. In ^[11], the author addresses the leader-follower consensus for linear and nonlinear multi-agent systems with three-layer network framework and dynamic interaction jointly connected topology. Wang ^[12] studied heterogeneous uncertain dynamical networks under switching communication typologies. This work established an explicit synchronization framework and solved the zero error synchronization problem. Based on this work, Wang further studied the leader-follower consensus of a high-order nonlinear complex system ^[13]. In ^[14], A united directed complex network with multi-links was studied and exponential synchronization conditions were obtained. Multi-agent systems are typical complex networks. Li utilized linear feedback control and adaptive linear feedback control to achieve successive lag synchronization in a multi-agent system.

The works as mentioned above have studied the synchronization of complex networks in various angles, however, most of which focus on the networks with time-invariant couplings under the global control and pinning synchronization of complex networks with time-varying coupling have been seldom explored. Many systems in the real word have time-varying feature. Time-varying exists in interior parts of systems, links and coupling among systems. Besides, it is impossible to control all nodes in a system to achieve global synchronization. Yu ^[15] investigated how the local controllers on pinned nodes affect global network synchronization. The research gave a general criterion for ensuring network synchronization and obtained appropriate coupling strengths for achieving network synchronization. Today, many results of pinning synchronization have been established ^[16,17]. Zhang ^[18] investigated the synchronization of complex networks with time-varying coupling matrices and established suitable linear controllers and adaptive controllers. Furthermore, a large amount of research on synchronization with the time-varying feature have been proposed ^[19,20]. Time-varying inner coupling and outer coupling are common and complicated situations in complex networks. In a single system, state variables do not transform separately. We regard variables affecting each other from different angles along the entire dynamic process as the inner coupling of systems. In large-scale systems and complex systems, small components and parts are not isolated. They are often connected by electric wires or signal wires. That is, they are coupled by each other and their states depend on the neighbors' states, external magnetic field and electric field. We regard this situation as the outer coupling of systems. Complicated inner coupling and outer coupling lead systems hardly to be controlled or be stabilized. It prompts us to find effective methods to decompose the coupling and design feedback controllers. Motivated by Yu and Zhang's contributions, this paper aims to the synchronization of time-varying random networks by respectively setting linear pinning controllers and adaptive pinning controllers. We take inner, outer coupling and stochastic behaviors into consideration. Potential correlations among the parameters are also investigated in this paper.

The rest of this paper is organized as follows. In Section 2, some preliminaries are outlined. In Section 3, the main theorems and corollaries for pinning synchronization on complex networks are given. In Section 4, simulation examples are shown to demonstrate the effectiveness of the proposed method. Finally, conclusions are drawn in Section 5.

2.   Preliminaries

Consider a complex network consisting of $N$ identical coupled nodes, described by

where, $i = 1, 2, ..., N$, $x_i\left(t \right) = \left(x_{i1}\left(t \right), x_{i2}\left(t \right), ..., x_{in}\left(t \right) \right) ^T\in R^n$ is the state vector of the $i$th node. The node in the system is an $n$ dimensional nonlinear time-varying dynamical system. $c\left(t \right)$ is the time-varying outer coupling strength. $f:R^n\times R^+\rightarrow R^n$ is a nonlinear continuously differentiable vector function. $\varGamma \left(t \right) \in R^{n\times n}$ is the time-varying inner coupling matrix. $G(t) = [G_{ij}(t)]_{i, j = 1}^n\in R^{N\times N}$ represents the topological structure and the coupling strength of the the complex network at time $t$, where $G_{ij}\left(t \right)$ is defined as follows: If there is a connection between nodes $j$ to $i$ time, then $G_{ij}\left(t \right) > 0$; otherwise $G_{ij}\left(t \right) = G_{ji}\left(t \right) = 0\left(j\ne i \right)$. The corresponding Laplacian matrix with respect to this complex network is given by

Definition 1 ([33]). The matrix $\mathscr{L}\left(t \right)$ is said to be dissipative if

Obviously, $\mathscr{L}\left(t \right)$ in Eq (2.2) satisfies the dissipative condition.

In this paper, the complex network is an random network in which the probability that $G_{ij} = 1$ is a constant $p\in \left[0, 1 \right]$. When $p = 0$, all nodes in are isolated; when $p = 1$, the complex network is a fully coupled network; and when $p\in \left(0, 1 \right)$ the coupling strength between nodes $i$ and $j$ is the expectation of the connection

Remark 1. In random networks, the existence of links between nodes depends on the probability value $p$. Large $p$ creates dense complex networks and vice versa. Note that isolated nodes do not have information exchange with other nodes and it is hard to synchronize in complex networks if there is no common equilibrium in the nonlinear dynamic. If the number of links are too small, nodes in complex networks turn to hardly achieve synchronization since the information exchanging is ineffective. Therefore, $p$ can be regarded as an external condition. As the value of $p$ changes, the controllability of the complex systems changes accordingly. In this paper, the complex network is a jointly connected network. The complex network topology is under arbitrary switching during the entire dynamic process and may be not connected in every single switching state since the value of $p$ could be very small that leads some isolated nodes. However, in the entire dynamic process, the superposition of all switching states is a connected network. Equivalently, Eq (2.1) can be simplified as follows

Set $s\left(t \right)$ be the solution of an isolated node with

whose trajectory may be may be an equilibrium point, a periodic orbit, or a chaotic orbit of the nonlinear function $f\left(x_i\left(t \right), t \right)$. The aim of this paper is to find out some appropriate controllers such that the state of all nodes in complex network with time-varying inner and outer coupling Eq (2.5) synchronize with the solution of Eq (2.6)

where $\left\| \cdot \right\|$ is the Euclidean vector norm.

Assumption 1 (^[21]). The nonlinear function satisfies the Lipschitz condition, that is, for any time, there exists a constant matrix $K$ and $\forall x, y\in R^n$, such that

Lemma 1 (^[22]). Assume that $A$ is a dissipative coupling matrix and satisfies $a_{ij} > 0\left(i\ne j \right)$, then the following results hold

(1) 0 is an eigenvalue of matrix $A$ and the associated eigenvector is $\left(1, 1\cdots 1 \right) ^T$,

(2) The real parts of all eigenvalues of matrix $A$ are less than or equal to 0 and all possible eigenvalues with zero real part are the real eigenvalue 0,

(3) If $A$ is irreducible, then 0 is its eigenvalue of multiplicity 1.

Lemma 2 (^[23]). Let $\lambda _1, \lambda _2\cdots \lambda _n$ be eigenvalues of matrix $A\in R^n$ and $\mu _1, \mu _2\cdots \mu _n$ are eigenvalues of matrix $B\in R^n$, then, there is $\left| \lambda _{\min} \right|\left| \mu _{\min} \right|I_{nm\times mn}\leqslant A\otimes B\leqslant \left| \lambda _{\max} \right|\left| \mu _{\max} \right|I_{nm\times mn}$ in which $\otimes$ is the Kronecker product, $\lambda _{\max}$ and $\lambda _{\min}$ are the maximum and the minimum eigenvalues of $A$, while $\mu _{\max}$ and $\mu _{\min}$ are the maximum and the minimum eigenvalues of $B$.

To realize the synchronization, pinning control will be used in part of nodes. As the complex network is a jointly connected network, without loss of generality, we randomly choose one node in minimal spanning tree of every connected component as the controlled node. Suppose nodes $i_1, i_2, ..., i_l$ are selected to be controlled, where $l$ represents the integer part of the real number $N$. The complex network with pinning control can be rewritten as

where

The error dynamic equation can be described by

where $e_i\left(t \right) = x_i\left(t \right) -s\left(t \right), \left(i = 1, 2..., N\, \, \right)$. Denote $e\left(t \right) = \left(e_{1}^{T}\left(t \right), e_{2}^{T}\left(t \right), ..., e_{N}^{T}\left(t \right) \right) ^T$.

3.   Pinning synchronization of complex networks

3.1.   Pinning synchronization

In this section, some general criterion of pinning synchronization are derived.

Theorem 1. Suppose that Assumption 1 is established, under the control of linear controllers (2.10), complex network (2.9) can achieve synchronization and the synchronous solution is asymptotically stable if the following condition is satisfied

where $I_N$ is the $N$-dimensional identity matrix and $D = \mathrm{diag}\left(d_1, d_2, \cdots, d_l, 0\cdots 0 \right) \in R^{n\times n}$.

Proof. For simplicity, we first investigate the connected network with $l$ randomly choosed controlled nodes. Consider the Lyapunov functional candidate

The declarative of $V\left(t \right)$ along the trajectories of Eq (2.11) gives

If $\mathscr{L}\left(t \right)+D$ is large such that $I_N\otimes K\varGamma \left(t \right) -pc\left(t \right) \left(\mathscr{L}\left(t \right) +D \right) \otimes \varGamma \left(t \right) < 0$ hold, then $\dot{V}\left(t \right) < 0$ and complex network (2.9) is globally synchronized.

When the connected network degrades into a jointly connected network mentioned in Remark 1, arbitrary one single node in minimal spanning tree of all connected components are chosen as pinning controlled nodes. Suppose that complex nework (2.9) contains $l$ connected component and the $s$th component contains $N_s$ nodes, namely $\sum_{s = 1}^q{N_s = N}$. Each component is associated with a zero eigenvalue and $l$ zero eigenvalues are associated with the $l$ dimensions zero eigen-subspace that is spun by the corresponding eigenvectors $\zeta _1, \cdots, \zeta _l$. The base vectors satisify

where $\zeta _{ij} = 1_{N_i},$ if $j = i$, otherwise $\zeta _{ij} = 0_{N_j}.$ $1_n(0_n)$ indicate the $n$-dimensional column vector with each entry being 1(0). $col\left\{ \zeta _{i1}, \cdots, \zeta _{il} \right\}$ means column a vector composed by $\zeta _{i1}, \cdots, \zeta _{ik}$. There exists a set of constants $\ell _i, i = 1, \cdots, N$ such that arbitrary nonzero vector $\forall \zeta \ne 0$ can be decomposed as $\zeta _{i1}, \cdots, \zeta _{il}$ and $\zeta _{i}^{T}\zeta _j = 0$. Set $D = \mathrm{diag}\left\{ D_1, \cdots, D_k \right\}$ be a block diagonal matrix, where each $D_i, i = 1, \cdots, l$ are all diagonal matrices. Since arbitrary single node in minimal spanning tree of all connected components are chosen as pinning controlled nodes, there is at least 1 nonzero element in the main diagonal of each $D_i, i = 1, \cdots, l$. If $i > l$, for $\forall \zeta \ne 0$.

$\zeta \ne 0$ and at least one $\ell_i \ne 0$. If there exis ts one $\ell_i \ne 0, i = k+1, \cdots, N$, the right-hand side of Eq (3.5) is positive. If not, Eq (3.5) can be simplified as

Therefore, jointly connected network status remains the $\mathscr{L}\left(t \right)+D$ conditon in Eq (3.3) that guarantees the complex network synchronization. The proof is completed.

Remark 2. Equation (3.1) is a general condition to ensure the pinning synchronization of complex networks. Note that Eq (3.1) is a $N \times n$ dimension matrix and it contains multiple parameters. Therefore, it is difficult to realize these parameter conditions simultaneously. To solve this problem, based on Eq (3.1), we will seek to derive a more practicable condition to guarantee the synchronization of complex networks. Let $\varGamma$ be a positive definite matrix. If $\varGamma$ and $K$ are commutable, let $\theta = \left\| K \right\| > 0$ [33].

Corollary 1. Suppose that Assumption 1 is established and $\varGamma \left(t \right)$ is a positive definite matrix. Under the control of linear controllers (2.10), complex network (2.9) can achieve synchronization and the synchronous solution is asymptotically stable if the following condition is satisfied

where $\theta = \left\| K \right\|$ defined in Assumption 1. $\lambda_i$ and $\lambda _{\max}$ are the eigenvalues and maximum eigenvalue of $\mathscr{L}\left(t \right)$. $L_{\lambda_i}$ is the diagonal matrix of $\mathscr{L}\left(t \right)$ satisfies $\varPhi ^{-1}\mathscr{L}\left(t \right) \varPhi = L_{\lambda_i}$. $L_{ \lambda _{\max}}$ is a diagonal matrix composed by $\lambda _{\max}$.

Proof. First based on Eq (3.1) and Remark 2, the following inequality holds

Taking the similarity transformation on both sides of Eq (3.5) yields

On the right-hand side, we have

$\varGamma \left(t \right)$ is a positive definite matrix. According to the property of Kronecker product, matrix multiplication and similarity transformation, if $\theta I_N-pc\left(t \right) \left(\lambda _{\max}I_N+\varPhi ^{-1}D\varPhi \right) < 0$, then $\varPhi ^{-1}\left(\left(\theta I_N-pc\left(t \right) \left(\mathscr{L}\left(t \right) +D \right) \right) \otimes \varGamma \left(t \right) \right) \varPhi < 0$. Furthermore, we can easily obtain $\varPhi ^{-1}\left(I_N\otimes K\varGamma \left(t \right) -pc\left(t \right) \left(\mathscr{L}\left(t \right) +D \right) \otimes \varGamma \left(t \right) \right) \varPhi < 0$ and $I_N\otimes K\varGamma \left(t \right) -pc\left(t \right) \left(\mathscr{L}_{ij}\left(t \right) +D \right) \otimes \varGamma \left(t \right) < 0$. Therefore, condition (3.1) is satisfied, complex network (2.7) can achieve synchronization. The proof is completed.

Remark 3. Equation (3.7) is distinctly simpler. To ensure the global synchronization of the complex networks, appropriate maximum eigenvalues of $\mathscr{L}\left(t \right)$ and outer coupling strength $c\left(t \right)$ need to be determined. Another problem is that the value of $c\left(t \right)$ often determines the speed of the network synchronization.The required theoretical value for the $\mathscr{L}\left(t \right)$ is too conservative, usually much more extensive than that needed in practice.

3.2.   Connection possibility and coupling strength in pinning synchronization

In this subsection, correlation between the random network connection possibility and coupling strength are derived.

Corollary 2. Suppose that Assumption Assumption 1 is established, under the control of linear controllers (2.10), complex network (2.9) can achieve synchronization and the synchronous solution is asymptotically stable if one of the following condition is satisfied

where $\lambda _{\max}$ and $\lambda _{\min}$ are the norms of the maximum and minimum eigenvalues of $\mathscr{L}\left(t \right).$ $\eta _{\max}$ and $\eta _{\min}$ are the norms of the maximum and minimum eigenvalues of $D$, respectively.

Proof. First, based on Lemma 1 and Lemma 2, Eq (3.1) satisfies the following inequality

where $\mu _{\min} = 0$ is the minimum eigenvalues of $\varGamma \left(t \right)$. If $\left| \lambda _{\max} \right|+pc\left(t \right) \left| \lambda _{\min} \right|\left| \eta _{\min} \right| < 0$, then $I_N\otimes K\varGamma \left(t \right) -pc\left(t \right) \left(\mathscr{L}_{ij}\left(t \right) +D \right) \otimes \varGamma \left(t \right) < 0$ holds. Condition (3.1) is satisfied, completing the proof.

Remark 4. In Corollary 2, condition $(i)$ reveals that a cluster of appropriate pinning controllers can synchronize the complex networks under the fixed topological structure and outer coupling strength. Condition $(ii)$ reveals that there is a lower bound of the connection probability, under the fixed topological structure and outer coupling strength. Condition $(iii)$ proposes a way to choose the coupling strength with fixed network structure and pinning scheme (2.9).

From Corollary 2, we can see that random network connection possibility $p$ has a inversely proportional relationship with coupling strength $c(t)$. When the network is sparse, strong coupling strength is needed to synchronize all nodes and vice versa. However, we are interested in the question if connection possibility is fixed and how to adequately lower the coupling strength $c(t)$. Let $c_p\left(t \right) = c\left(t \right) p$. Next, adaptive technique are utilized to reduce the value of $c_p\left(t \right)$.

With the pinning controllers (2.10) and the adaptive coupling law, complex network (2.9) can be expressed as

Theorem 2. Suppose that Assumption 1 holds and $\varGamma$ is a positive definite matrix. Then, the adaptively controlled undirected network (2.9) is globally synchronized for a small constant $\rho > 0$.

Proof. Consider the Lyapunov functional candidate

where $\varphi$ and $c^*$ are positive constants. Based on lemma 1 and lemma 2, we yield

where $\mu _{\min} = 0$ is the minimum eigenvalues of $\varGamma \left(t \right)$. If $\theta I_N-c_p\left(t \right) \left(\varphi I_N-D \right) -\varphi c^*I_N < 0$ then the $\dot{V}\left(t \right) < 0$ is negative definite. Complex network (2.9) can achieve synchronization, and the synchronous solution is asymptotically stable.

Remark 5. $c_p\left(t \right)$ can be caculated through the adaptive technique. Consequently, $c\left(t \right)$ can be obtained under a fixed $p$. Note that the value of feedback gain is another factor, which determines the speed of network synchronization and the required theoretical value for the feedback gain is probably much larger than that needed in practice. Therefore, in the same way, an adaptive technique is exploited to compute the lower bound of feedback gain for achieving the complex network synchronization.

3.3.   Adaptive controllers in pinning synchronization

The pinning controllers selected by Eq (2.9) yield the following controlled network

where $q_i$ are positive constants.

Theorem 3. Suppose that Assumption 1 holds and $\varGamma$ is a positive definite matrix, then the undirected network (3.15) is globally synchronized under the adaptive scheme.

Proof. Consider the Lyapunov functional candidate

where $d$ is a positive constant. Based on Lemma 1 and Lemma 2, the derivative of $V\left(t \right)$ gives

where $\widetilde{I}_N = \mathrm{diag}\underset{l}{\underbrace{\left(1, ..., 1, \right. }}\underset{N-l}{\underbrace{\left. 0, ..., 0 \right) }}$. If $I_N\theta -pc\left(t \right) \mathscr{L}\left(t \right) -pd\widetilde{I}_N < 0$, then $\dot{V}\left(t \right) = e^T\left(t \right) \left[\left[I_N\theta -pc\left(t \right) \mathscr{L}\left(t \right) -pd\widetilde{I}_N \right] \otimes \varGamma \left(t \right) \right] e\left(t \right) < 0$. Note that $pc\left(t \right) \mathscr{L}\left(t \right)$ and $pd\widetilde{I}_N$ are negative definite. $I_N\theta -pc\left(t \right) \mathscr{L}\left(t \right) -pd\widetilde{I}_N$ is also negative definite when $p$ is sufficiently small. Therefore we can select an appropriate $d$ to guarantee $\dot{V}\left(t \right) < 0$. This completes the proof.

In the adaptive control process, if the initial value of$d_i\left(0 \right)$ is very large, then $d_i\left(t \right)$ increases very slowly according to the change of $e_i\left(t \right)$. Finally, the synchronization can be achieved when $d_i\left(t \right)$ is large enough and converges to a constant $d^*$. $d^*$ is the bound of adaptive controllers $d_i\left(t \right)$.

4.   Simulation examples

In this section, some numerical simulations are presented to verify the criteria established above. Consider complex network (2.9) that consists of $N$ identical Chen systems, described by

where $\varGamma = \left[\begin{matrix} 3+\sin ^2\left(t \right) & 0 & 0\\ 0 & 2+\sin ^2\left(t \right) & 0\\ 0 & 0 & 5\sin ^2\left(t \right)\\ \end{matrix} \right],$ and $f\left(x_i, t \right) = \left\{ \begin{array}{c} 35\left(x_{i2}-x_{i1} \right)\\ -7x_{i1}-x_{i1}x_{i3}+28x_{i2}\\ x_{i1}x_{i2}-3x_{i3}\\ \end{array} \right.$.

It is found that the chaotic attractor $\left(\begin{matrix}s_1, & s_2, & s_3\\\end{matrix} \right)$ of the Chen system satisfies $\left| S_1 \right| < M_1$, $\left| S_2 \right| < M_2$, and $\left| S_3 \right| < M_3$, $M1 = 23$, $M2 = 32$, and $M3 = 61$. Based on Lemma 3

$\upsilon$ and $\varepsilon$ are chosen as 1.3139 and 0.4715, then $\theta = 31.0122$.

4.1.   Pinning synchronization of complex networks with linear controllers

According to Theorem 1 and Corollary 2, when maximum eigenvalues of feedback matrix $D$ satisfies $\eta _{\max} > \frac{\left| \lambda _{\max} \right|}{pc\left(t \right) \left| \lambda _{\min} \right|}\, \,$, complex networks can realize synchronization. The states of error are under different value of linear controllers illustrated in Figures 1 and 2.

4.2.   Pinning synchronization of complex networks with adaptive controllers

According to Theorem 3, same parameters are chosen to simulate complex network (2.8) with adaptive controllers. With different adaptive control factors, complex network can realize synchronization. The states of error $e_{it}$ are illustrated in Figure 2. Moreover, state trajectories were simulated to show the rate of convergence under different controllers in Figure 4. The graphs from left to right and top to bottom illustrate the system state evolution corresponding to Figures 1–3.

5.   Conclusions

In this paper, we investigated the pinning synchronization problem for complex networks with time-varying inner and outer coupling. We derived a general criterion for ensuring network synchronization. Pinning controllers and adaptive pinning controllers were respectively obtained based on the Lyapunov function theory. We found that the complex networks with two kinds of time-varying coupling can achieve global synchronization by adaptively adjusting the coupling strength or feedback gain. Simulations on random networks verify well the theoretical results.

Acknowledgments

This work are supported by National Natural Science Foundation of China (No. 61633019) and Shaanxi Provincial Key Project, China (2018ZDXM-GY-168).

Conflict of interest

The authors declare no conflict of interest.