- Research
- Open Access
Outer synchronization of stochastic complex networks with time-varying delay
- Tao Jin^{1}Email author,
- Wenxue Li^{2} and
- Junyan Feng^{2}
https://doi.org/10.1186/s13662-015-0691-4
© Jin et al. 2015
Received: 20 March 2015
Accepted: 10 November 2015
Published: 24 November 2015
Abstract
In this paper, the outer synchronization of stochastic complex networks with time-varying delay is investigated. A systematic method that allows one to construct global Lyapunov functions for these systems is provided by employing results from graph theory and Lyapunov method. By the construction of the Lyapunov function, some sufficient conditions of pth moment exponential outer synchronization are given. The theoretic result is also applied to an investigation of the outer synchronization of stochastic time-varying delayed coupled oscillators on networks. Finally, a numerical example is examined to illustrate the effectiveness of the results developed.
Keywords
- stochastic complex networks
- time-varying delay
- outer synchronization
MSC
- 99Z99
- 00A00
1 Introduction
In the real world, the structure of many coupled systems can be described by complex networks [1, 2]. The complex networks, as a fundamental tool in understanding dynamical behavior of real systems, have been gaining increasing recognition. Networks exhibit complexities in the overall topological properties and dynamical properties of the network nodes. A series of important research problems have resulted from the complex nature of networks. Synchronization is one of the typical problems of complex networks, which has attracted lots of attention. Synchronization of complex networks is widely applied to many fields, such as neural networks, biological systems, and so on [3–6].
In fact, there are two kinds of network synchronization. One network synchronization is concerned with the synchronization among the nodes within a network, which is called inner synchronization. The other is outer synchronization, which is a synchronization between two or more complex networks. Li et al. were first to study the complete outer synchronization problem for two complex networks with identical topological structure [7]. Then in [8], the outer synchronization for two complex networks was extended to the discrete time case. Later on, an increasing number of researchers devoted themselves to the work about outer synchronization. It is noticed that the outer synchronization between two nonidentical networks with circumstance noise was investigated in [9], which analyzed both the inner and the outer synchronization between two coupled discrete-time networks with time delays. In [10], the finite-time stochastic outer synchronization between two complex dynamical networks with different topological structure was studied. The authors of [11] studied the effect of noise on the outer synchronization of two unidirectionally coupled complex dynamical networks. Reference [12] obtained several sufficient conditions for the generalized outer synchronization between complex dynamical networks. More research on outer synchronization can be found in [13–18] and the references therein.
In real networks, time delays cannot be neglected due to the finite information transmission and processing speeds among the network nodes. Hence, it is reasonable and necessary to study the effect of time delays which may affect the dynamical behavior of complex networks. For instance, in [13], outer synchronization of uncertain complex delayed networks with adaptive coupling was studied. References [16] and [17] investigated mixed outer synchronization and finite-time outer synchronization of complex networks with coupling time-varying delay, respectively. On the other hand, another addition which exists in nature and man-made systems should also be considered, that is, noise, which is commonly regarded as a random and persistent disturbance obscuring or reducing the clarity of the signal. Hence, noise is another important factor affecting the behavior for dynamical networks. For this reason, synchronization criteria for stochastic systems have been obtained in the literature [9, 11, 14, 19] by various approaches. Furthermore, it is a significant task to understand how noise influences the dynamics of complex networks. For example, [19] studied the synchronization between two coupled chaotic systems determined by the distribution of white noise and analytically proved that synchronizability of coupled chaotic systems could be promoted by white noise. In [9], the synchronization criteria have been established for two nonidentical networks with circumstance noise.
Over the years, lots of efficient synchronization methods for complex networks have been developed by many researchers. In most of the studies above, the criteria ensuring synchronization on networks have been derived mainly based on the Lyapunov method. However, how to construct a global Lyapunov function for the system on networks by means of the Lyapunov method is a challenge for researchers. Fortunately, [20] provided a systematic method which is on the base of graph theory, which allows us to construct a global Lyapunov function for large-scale coupled systems. Based on graph theory, a network can be mathematically described by a directed graph consisting of vertices and directed arcs connecting them.
Motivated by the above discussion, outer synchronization of stochastic complex networks with time-varying delay (SCNVD) is studied in this paper. Based on graph theory, SCNVD can be described as a directed graph in which a system of stochastic time-varying delayed differential equations is assigned at each vertex, and the directed arcs indicate interconnections and interactions among vertex systems. A systematic method to construct a global Lyapunov function for the SCNVD is provided. Then several sufficient criteria for pth moment exponential outer synchronization of SCNVD will be established by constructing a global Lyapunov function and utilizing stochastic stability theory. Moreover, the theoretic result will be applied to an investigation of the outer synchronization of stochastic time-varying delayed coupled oscillators on networks.
The rest of the paper is organized as follows. In the next section, some basic concepts and results on graph theory, our mathematical model of the SCNVD and some preliminary results are introduced. In Section 3, a systematic method to construct a global Lyapunov function for the SCNVD based on the Lyapunov method and graph theory is given, and the sufficient criteria for the outer synchronization are derived. In Section 4, we will introduce stochastic time-varying delayed coupled oscillators on networks and present the sufficient conditions of the outer synchronization. In Section 5, a numerical simulation is given to show the effectiveness of the theoretical results.
Notation
Throughout the paper, unless otherwise specified, we will employ the following notations. Let \(\mathbb{R}\) and \(\mathbb{R}^{n}\) be the set of real numbers and n-dimensional Euclidean space, respectively. We have \(\mathbb {R}^{1}_{+}=[0,+\infty)\), \(\mathbb{L}=\{1,2,\ldots,L\}\). Let \((\Omega, \mathcal{F}, \mathbb{F}, \mathbb{P})\) be a complete probability space with filtration \(\mathbb{F}={\mathcal{F}}_{t\geq0}\) satisfying the usual conditions, and \(B(\cdot)\) be the one-dimensional Brownian motion defined on the space. The mathematical expectation with respect to the given probability measure \(\mathbb{P}\) is denoted \(\mathbb{E}(\cdot)\). Let \(|\cdot|\) denote the Euclidean norm for vectors or the trace norm for matrices. Denote by \(C([-\tau, 0], \mathbb{R}^{n})\) the space of continuous functions \(x:[-\tau, 0]\rightarrow\mathbb{R}^{n}\) with norm \(|x|=\sup_{-\tau\leq t\leq0}|x(t)|\). Write \(C^{2,1}(\mathbb {R}^{n}\times\mathbb{R}_{+}^{1};\mathbb{R}_{+}^{1})\) for the family of all nonnegative functions \(V(x,t)\) on \(\mathbb{R}^{n}\times\mathbb {R}_{+}^{1}\) that are continuously twice differentiable in x and once in t. If A is a vector or matrix, its transpose is denoted by \(A^{T}\). I stands for the identity matrix of appropriate dimensions.
2 Preliminaries
In this section, we will give some useful preliminaries and a model description.
2.1 Basic concepts on graph theory
Since the complex network considered in this paper is built on a directed graph, it is necessary to recall some concepts and results on graph theory in this subsection.
A directed graph \(\mathcal{G}=(V,E)\) contains a set \(V=\{1,2,\ldots,N\} \) of vertices and a set of E of arcs \((i,j)\) leading from initial vertex i to terminal vertex j. A subgraph \(\mathcal{H}\) of \(\mathcal{G}\) is said to be spanning if \(\mathcal{H}\) and \(\mathcal{G}\) have the same vertex set. A graph \(\mathcal{G}\) is weighted if each arc \((j,i)\) is assigned a positive weight \(a_{ij}\). In our convention, \(a_{ij}>0\) if and only if there exists an arc from vertex j to vertex i in \(\mathcal{G}\), and we call \(A=(a_{i j})_{N\times N}\) as the weight matrix. The weight \(W(\mathcal{G})\) of \(\mathcal{G}\) is the product of the weights on all its arcs. A directed path \(\mathcal{P}\) in \(\mathcal{G}\) is a subgraph with distinct vertices \(\{i_{1}, i_{2},\ldots,i_{s}\}\) such that its set of arcs is \(\{(i_{k}, i_{k+1}): k = 1, 2,\ldots,s-1\}\). If \(i_{s}=i_{1}\), we call \(\mathcal{P}\) a directed cycle. A connected subgraph \(\mathcal{T}\) is a tree if it contains no cycles. A tree \(\mathcal{T}\) is rooted at vertex i, called the root, if i is not a terminal vertex of any arcs, and each of the remaining vertices is a terminal vertex of exactly one arc. A subgraph \(\mathcal {Q}\) is unicyclic if it is a disjoint union of rooted trees whose roots form a directed cycle. A digraph \(\mathcal{G}\) is strongly connected if, for any pair of distinct vertices, there exists a directed path from one to the other. Denote the digraph with weight matrix A as \((\mathcal{G},A)\). A weighted digraph \((\mathcal{G}, A)\) is said to be balanced if \(W(\mathcal{C}) =W(-\mathcal{C})\) for all directed cycles \(\mathcal{C}\). Here, \(-\mathcal{C}\) denotes the reverse of \(\mathcal{C}\) and is constructed by reversing the direction of all arcs in \(\mathcal{C}\). For a unicyclic graph \(\mathcal{Q}\) with cycle \(\mathcal{C_{Q}}\), let \(\tilde{\mathcal{Q}}\) be the unicyclic graph obtained by replacing \(\mathcal{C_{Q}}\) with \(-\mathcal{C_{Q}}\). Suppose that \((\mathcal{G},A)\) is balanced, then \(W(\mathcal {Q})=W(\tilde{\mathcal{Q}})\).
Here we show a lemma which will be used in the proofs of our main results.
Lemma 2.1
[20]
2.2 Model formulation
In this paper, we describe the SCNVD as a weighted diagraph \((\mathcal{G},A)\). We first have L (≥2) individual networks and describe them on a digraph \(\mathcal{G}\).
Assumption 2.2
Assume that functions \(\tau_{k}(t)\) and \(\tau^{(kh)}(t)\), \(k, h\in \mathbb{L}\) are differentiable and theirs derivative are bounded by a constant \(\bar{\tau}\in[0, 1)\).
Definition 2.3
Definition 2.4
Function \(V_{k}(e_{k}, t)\in C^{2,1}(\mathbb{R}^{m_{k}}\times\mathbb {R}_{+}^{1}; \mathbb{R}_{+}^{1})\) is called vertex-Lyapunov function for the system (2.4), if the following assumptions hold:
3 Main results
We investigate outer synchronization of SCNVD in this section, and our main results for the outer synchronization criteria of SCNVD are presented.
3.1 Lyapunov-type theorem
Theorem 3.1
Proof
Remark 3.2
Theorem 3.1 shows that the Lyapunov function \(V(e,t)\) for the system (2.4) can be obtained by the weighted sum of \(V_{k}(e_{k},t)\). Hence finding the vertex-Lyapunov function \(V_{k}(e_{k},t)\) is a key point in the study of the stability for the system (2.4). In the practical applications, complex networks are coupled together in regular ways by the simple and nearly identical dynamical systems whose Lyapunov functions have been obtained. The Lyapunov function of these systems can be chosen as the Lyapunov function of vertex systems.
3.2 Coefficients-type theorem
In this subsection, based on the Lyapunov method, a sufficient criterion of exponential outer synchronization which is easily verifiable is established in the form of coefficients.
Theorem 3.4
Suppose that the following conditions hold:
Then the networks (2.2) and (2.3) can reach ME-synchronization.
Proof
It is easy to see that the conditions in Definition 2.4 are satisfied, which means \(V_{k}(e_{k}, t)\) is the vertex-Lyapunov function. Therefore, by Theorem 3.1, the networks (2.2) and (2.3) will reach ME-synchronization. □
4 Synchronization of stochastic time-varying delayed coupled oscillators on networks
The phenomenon of synchronization of oscillatory dynamics is observed in a wide variety of natural systems. In some physical and biological applications, the system of coupling oscillators with time-varying delay will be studied in this part by the analytical results established in the previous section.
Theorem 4.1
Let the digraph \((\mathcal{G},A)\) be strongly connected. Suppose that the following conditions hold:
Proof
Hence, from Theorem 3.4, the drive system (4.2), and the response system (4.3) we obtain ME-synchronization. □
5 Numerical test
Declarations
Acknowledgements
This research was supported by the NNSF of China (Nos. 11301112, 11171081, and 11171056), by the NNSF of Shandong Province (No. ZR2013AQ003), by the China Postdoctoral Science Foundation funded project (Nos. 2013M541352, 2014T70313), by HIT.IBRSEM.A.2014014 and HIT.NSRIF.2016103, and by the Key Project of Science and Technology of Weihai (No. 2013DXGJ04). The authors really appreciate the reviewers’ valuable comments.
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
Authors’ Affiliations
References
- Strogatz, SH: Exploring complex networks. Nature 410, 268-276 (2001) View ArticleGoogle Scholar
- Boccaletti, S, Latora, V, Mereno, Y, et al.: Complex networks: structure and dynamics. Phys. Rep. 424, 175-308 (2006) MathSciNetView ArticleGoogle Scholar
- Alex, A, Albert, D, Jurgen, K, Yamir, M, Zhou, C: Synchronization in complex networks. Phys. Rep. 469, 93-153 (2008) MathSciNetView ArticleGoogle Scholar
- Deng, Y, Ding, M, Feng, J: Synchronization in stochastic coupled systems: theoretical results. J. Phys. A, Math. Gen. 37, 2163-2173 (2004) MATHMathSciNetView ArticleGoogle Scholar
- Zhou, J, Xiang, L, Liu, Z: Global synchronization in general complex delayed dynamical networks and its applications. Physica A 385, 729-742 (2007) MathSciNetView ArticleGoogle Scholar
- Li, H, Nin, Z, Yin, Y, Tang, Y: Synchronization and state estimation for singular complex dynamical networks with time-varying delays. Commun. Nonlinear Sci. Numer. Simul. 18, 194-208 (2013) MATHMathSciNetView ArticleGoogle Scholar
- Li, C, Sun, W, Kurths, J: Synchronization between two coupled complex networks. Phys. Rev. E 76, 046204 (2007) View ArticleGoogle Scholar
- Li, C, Xu, C, Sun, W, Xu, J, Kurths, J: Outer synchronization of coupled discrete-time networks. Chaos 19, 013106 (2009) MathSciNetView ArticleGoogle Scholar
- Wang, G, Cao, J, Lu, J: Outer synchronization between two nonidentical networks with circumstance noise. Physica A 389, 1480-1488 (2010) View ArticleGoogle Scholar
- Sun, Y, Li, W, Zhao, D: Finite-time stochastic outer synchronization between two complex dynamical networks with different topologies. Chaos 22, 023152 (2012) MathSciNetView ArticleGoogle Scholar
- Sun, Y, Zhao, D: Effects of noise on the outer synchronization of two unidirectionally coupled complex dynamical networks. Chaos 22, 023131 (2012) MathSciNetView ArticleGoogle Scholar
- Wu, X, Zheng, W, Zhou, J: Generalized outer synchronization between complex dynamical networks. Chaos 19, 013109 (2009) MathSciNetView ArticleGoogle Scholar
- Wu, X, Lu, H: Outer synchronization of uncertain general complex delayed networks with adaptive coupling. Neurocomputing 82, 157-166 (2012) View ArticleGoogle Scholar
- Sun, Y, Li, W, Ruan, J: Generalized outer synchronization between complex dynamical networks with time delay and noise perturbation. Commun. Nonlinear Sci. Numer. Simul. 18, 989-998 (2013) MATHMathSciNetView ArticleGoogle Scholar
- Li, Z, Xue, X: Outer synchronization of coupled networks using arbitrary coupling strength. Chaos 20, 023106 (2010) MathSciNetView ArticleGoogle Scholar
- Wang, J, Ma, Q, Zeng, L, Abd-Elouahab, MS: Mixed outer synchronization of coupled complex networks with time varying coupling delay. Chaos 21, 013121 (2011) MathSciNetView ArticleGoogle Scholar
- He, P, Ma, S, Fan, T: Finite-time mixed outer synchronization of complex networks with coupling time-varying delay. Chaos 22, 043151 (2012) MathSciNetView ArticleGoogle Scholar
- Wang, G, Cao, J, Lu, J: Outer synchronization between two nonidentical networks with circumstance noise. Physica A 389, 1480-1488 (2010) View ArticleGoogle Scholar
- Li, W, Chen, G: Using white noise to enhance synchronization of coupled chaotic systems. Chaos 16, 013134 (2006) MathSciNetView ArticleGoogle Scholar
- Li, MY, Shuai, Z: Global-stability problem for coupled systems of differential equations on networks. J. Differ. Equ. 248, 1-20 (2010) MATHMathSciNetView ArticleGoogle Scholar