The pinning synchronization problem for a class of complex networks is studied by a stochastic viewpoint, in which both time-varying coupling strength and nondelayed and delayed coupling are included. Different from the traditionally similar methods, its interval is separated into two subintervals and described by a Bernoulli variable. Both bounds and switching probability of such subintervals are contained. Particularly, the nondelayed and delayed couplings occur alternately in which another independent Bernoulli variable is introduced. Then, a new kind of pinning controller without time-varying coupling strength signal is developed, in which only its bounds and probabilities are contained. When such probabilities are unavailable, two different kinds of adaption laws are established to make the complex network globally synchronous. Finally, the validity of the presented methods is proved through a numerical example.

1. Introduction

In the recent years, because of many systems in all fields of sciences and society, complex networks (CNs) have drawn a lot of attention. The property of CNs is that a large set of interconnected nodes are contained, and each node is an essential unit. Many natural and manmade systems can be found in our surroundings, such as ecosystems, internet, World Wide Web, social networks, and power grids, which are very important in our daily life. Due to the broad applications, the research of complex behaviors in complex networks has become a hot topic across many fields such as in [17].

In complex networks, such as ER random, small-world, and scale-free CNs [810], one of the most important collective behaviors is named as synchronization and has been studied extensively. Because of a large number of nodes existing in CNs, it is unrealistic to control CN by adding controllers to all nodes. Then, it is natural to exploit a practical control strategy reducing the number of controllers usually referred to as pining control [11, 12]. Up to now, a lot of results on pinning synchronization of various CNs have emerged, for example, [1321]. When there are some parameters unknown, the problem of adaptive synchronization was reported in [2224]. If there are constant or time-varying delays in coupling, some delay-dependent criteria for synchronization stability were established in [2527]. As for CN with nondelayed and delayed coupling, the pinning synchronization problem was considered in [28]. It is seen that the underlying system in this reference has the nondelayed and delayed couplings occurring simultaneously. If such two couplings happen separately with some probability, how to consider the pinning synchronization problem will be necessary and interesting. On the other hand, by investigating the aforementioned works, it is known that the coupling strength (CS) in most of them is constant. When CS is time-varying in a limited range, the global synchronization was realized by adjusting time-varying coupling strength (TCS) [29]. Based on the proposed methods, it is concluded that the adjusted CS will vary in a range, whose lower and upper bounds are finite. Though the given adjusting TCS is time-varying, its bounds used in realizing global synchronization may be different from the ones of the original TCS. Moreover, even if such bounds can be equal in theory, they may not be realized in practice. That is because the ability of instruments or actuators is limited in many practical applications. Thus, the method without considering the upper bound of CS may be conservative. In addition, the synchronization in [29] achieved by adjusting TCS needs every node state. It will make the realization not easy when CS has a great deal of nodes. Via exploiting the existing pinning algorithms, a state feedback controller will be constructed as one with TCS signal. In this case, the implementation of the designed pinning controller requires such a signal exactly available online. Unfortunately, from the point of application, this assumption is very ideal and hard to be satisfied. To the best of authors’ knowledge, the pinning control problem of complex networks with TCS and nondelayed and delayed coupling has not yet been investigated, which motivates the current research.

In this paper, the pinning synchronization of complex networks with TCS and nondelayed and delayed coupling is studied by a stochastic viewpoint. Compared with the existing results of pinning control methods, the main contributions of this paper are as follows: The pinning synchronization is realized by using a stochastic method. The original range of TCS is separated into two different subintervals, whose switching between such subintervals is described by a Bernoulli variable; based on the proposed method, a kind of local state feedback controller is developed such that the resulting system is global synchronization in probability. It is seen that, without depending on TCS signal directly, the desired pinning controller is only related to the bounds and probabilities of such separated subintervals; instead of the nondelayed and delayed couplings existing simultaneously, such couplings act on the underlying system asynchronously, which is modeled by another independent Bernoulli variable; by the proposed results in this paper, it is concluded that such bounds and probabilities play important roles in the pinning synchronization, whose relationships are given and demonstrated in detail; when such probabilities are unknown or inaccessible, two different adaptation laws for global synchronization are proposed, respectively.

Notations. denotes the dimensional Euclidean space, is the set of all real matrices. is the Banach space of continuous functions mapping the interval into with the norm , where denotes the usual Euclidean norm of a vector. is the expectation operator with respect to some probability measure. denote largest eigenvalues of a matrix . is the infinitesimal generator of from to .

2. Problem Formulation

Consider a class of complex networks consisting of identical linearly and diffusively coupled nodes; it is described aswhere , is a differentiable function and is continuous, is the coupling delay, is the time-varying coupling strength and varies in with , and matrices and are the coupling configuration matrices and irreducible, whose elements and are described as follows: , for , , and , for , and , . The initial conditions are given by , . is a Bernoulli variable and is described as follows:whose probability is

In this paper, TCS varies in . That is, for any given constant , will take value in or randomly. Without loss of generality, can be chosen as . So for any , two sets are described asA Bernoulli variable is described aswithwhere and denote the probabilities of taking values in and , respectively. Moreover, it can be readily verified thatThen, is expressed aswhere and are described as Then, system (1) is equivalent towhere Let be a solution to the isolated node of CN; we havewhere may be an equilibrium point, a nontrivial periodic orbit, or even a chaotic attractor. For complex network (10) with stochastic variable, some assumptions, definitions, and lemmas are needed to derive our main results.

Assumption 1 (see [15]). Supposing is a positive definite diagonal matrix and is a diagonal matrix, then, for some , all , and , can make the following inequality establish:

Definition 2. Complex network (5) is said to achieve globally asymptotical synchronization almost surely, for any initial conditions and , if the following condition holds.

Definition 3. The solution to complex network (5) is said to be bounded almost surely if holds for all with .

Lemma 4 (see [15]). Suppose is in accordance with the following conditions: (1), for , and , ;(2) is irreducible; then one has the following:(i)Real parts of the eigenvalues of are all negative, in addition to an eigenvalue with the multiplicity .(ii) has the right eigenvector corresponding to the eigenvalue .(iii)Let be the left eigenvector of corresponding to the eigenvalue 0; then one can let , .

Lemma 5. If is irreducible with for and for , then all the eigenvalues of the matrix are negative, where with , , and , .

Proof. Based on the result [12], it can be obtained directly. Thus it is omitted here.
If is an irreducible coupling matrix, let be the left eigenvector of corresponding to the eigenvalue 0 and with , one has that matrix is positive definite. If is irreducible, we havewhich is irreducible. Letting , it is known from Lemma 5 that is negative definite.

Lemma 6. For any given appropriate matrices , , and and scalars and , thenif and only if

Proof. The necessity is obvious, since (18) holds. Next, we prove the sufficiency. From and  , it is concluded thatThen, from (19)  plus (21) , one getsSimilarly,By applying similar method to (24) and (25), we obtainwhere “” is satisfied if and only if or and or hold simultaneously. However, without loss of generality, if and , it is seen thatwhich is contradicted with (22). This completes the proof.

Here, the objective of pinning synchronization is to achieve , , by using pinning control strategy on a small fraction    of the total nodes in (5). Suppose that nodes are selected, where is the smaller, but a nearest integer to the real number . Without loss of generality, assume that the first nodes are selected to be pinned. A kind of local pinning controller without but containing its bounds and probability distributions is designed aswhere Letting , we have the error system aswhere , .

Remark 7. It is worth mentioning that, compared with some existing results such as [5, 11, 18, 28, 29], complex network (28) in this paper is more general and has its properties. Firstly, the underlying system is more general in terms of having time-varying coupling strength, where nondelayed and delayed couplings take place synchronously. Secondly, a new kind of controller depending on its lower and upper bounds in addition to probabilities will be designed to realize the pinning synchronization, which is without TCS signal. However, in order to achieve this aim, new problems will be confronted, which will be mentioned below and should be dealt with.

3. Main Results

Theorem 8. Suppose Assumption 1 holds and is a irreducible coupling matrix. If are positive constants andwhere is the spectral radius of  , , and , complex network (28) achieves globally asymptotical synchronization almost surely.

Proof. The Lyapunov function is defined aswhere is the element of the left eigenvector of corresponding the eigenvalue 0, and , . Then we havewhere By Lemma 6, it is concluded that ifhold, which could be obtained by (31). Then, (33) holds. Thus, there is always a small scalar such thatwhich impliesBy Dynkins formula, one getswhich impliesThis completes the proof.

Remark 9. From Theorem 8, it is seen that both the lower bounds of the separated subintervals and the probabilities and are involved. By using the existing methods dealing with TCS , it is known that only its lower bound is considered. Thus, for any given , it is concluded that the lower bound obtained by Theorem 8 will be smaller than one obtained by the traditional methods only using its lower bound. In this sense, it is said that our result is less conservative. In other words, the range of determined by (28) is usually larger than one obtained by considering only. Particularly, it is worth mentioning that such Bernoulli variables can also be replaced with Markov processes such as [30], since Bernoulli process is a special case of Markov process.

It is worth mentioning that the pinning controller in (28) needs and to be known. When either of and is unavailable, how to synchronize the complex network via using a pinning controller without signal and to estimate such probabilities should be considered. In the following, adaptive pinning control laws will be developed to deal with them separately.

Theorem 10. Suppose Assumption 1 holds and the coupling matrix is irreducible. If are positive constants andhold for , complex network (28) achieves globally asymptotical synchronization almost surely under the adaptive pinning controllerwhere , and the updating lawwith and .

Proof. Choose a Lyapunov functionwhere . Then, for , we havewhere By Lemma 6, it is known that ifhold for . Similarly, is equivalent toFrom conditions (31)-(32), it is obtained that (46)-(47) hold. Then, one has (44) which impliesFor any , , when , and from (48), one obtainswhich impliesFrom (43), it is concluded that , as . Based on this and taking into account (50), one concludes that is bounded almost surely. On the other hand, because of (44), there is such thatThen, it is directly obtained thatSimilar to the proof of (37), it is concluded that complex network (28) plus adaptive pinning controller (41) is asymptotical synchronization almost surely and the unknown probability is estimated. This completes the proof.

Remark 11. Compared with some existing references, the adaptive pinning controller (33) has its properties which are listed as follows. Firstly, the adaptive controller is used to estimate a scalar in a range and having an upper finite bound, while the other results such as [20, 22, 28] are used to estimate control gains and without this restriction. Secondly, when varies in a range, a new class of pinning controller in this paper is designed without signal , which is different from that in [29]. Moreover, instead of without an upper bound, it is more practical that it is in a finite range. Thirdly, some adaption controllers such as in [17, 22, 24] should be added to all the nodes of complex network. It is impossible to realize these controllers for complex network with large nodes. In addition, the adaption controller in [17] can cause chattering as the error state can reach the discontinuity region before the complex network achieves the global synchronization. However, this is not true for adaption controller (33) which is also on a small fraction of nodes in complex networks.

Theorem 12. Suppose Assumption 1 holds and the coupling matrix is irreducible. If are positive constants and satisfythe complex network achieves globally asymptotical synchronization almost surely under the adaptive pinning controllerwith and the updating lawswith and .

Proof. Define the Lyapunov function aswhere is the element of the left eigenvector of corresponding to the eigenvalue 0 and . Then, for , we havewhereSimilarly, one has that is guaranteed bywhere is obtained byBased on (53), we have (59)-(60). The next is similar to the proof of Theorem 10. This completes the proof.

4. Numerical Examples

In this section, a simulation example is used to illustrate the usefulness of our main results.

Example 1. Consider that a dynamical node of complex network is a Lorenz system. It is described asWhen the parameters are given as , , and , Lorenz system has a chaotic attractor shown in Figure 1. We take and such that Lorenz system (61) satisfies Assumption 1. Suppose an undirected E-R random network consisting of nodes with , where the coupling matrix is In this example, we randomly choose nodes with a fraction . For this E-R network with and given control gains , when the upper bound and , by Theorem 8, we could get the curve of along with varying in . Based on Figure 2, it is known that the larger results in the smaller . This conclusion is consistent with constant coupling strength case that the larger coupling strength results in the easier synchronization of complex network. In order to establish the correlation between and , we select and . Under the similar conditions and by Theorem 8, one can have the correlation between and , which is illustrated in Figure 3. It is also concluded that the smaller leads to the larger . Moreover, when is smaller, , the value of changes actually and is very near to the upper bound . Particularly, it is worth mentioning that when is very small, , there will be no solvable solution to in terms of being larger than its upper bound . In this sense, it is seen that such probabilities play important roles in pinning synchronization of complex networks. Next, we will demonstrate the correlation between probabilities and . Letting with and , a simulation of probabilities and will be obtained by Theorem 8, which is shown in Figure 4. Based on Figure 4, one knows that the larger results in the larger . In other words, the larger means that the probability of delayed coupling taking place is larger, which needs the desired pinning controller to be added with a higher probability. When such probabilities are unavailable, we will exploit the adaptive control to realize the purpose of pinning synchronization. Without loss of generality, here it is assumed that is known, while is inaccessible. If is unknown, let the initial condition ; by Theorem 10, we have the state responses of synchronization error and estimation shown in Figures 5 and 6. Particularly, Figure 5 is the simulation of state error ,