_{1}

^{*}

In this paper, the distributed synchronization of stochastic coupled neural networks with time-varying delay is concerned via randomly occurring control. We use two Bernoulli stochastic variables to describe the occurrence of distributed adaptive control and updating law according to certain probabilities. The distributed adaptive control and updating law for each vertex in the network depend on the state information on each vertex’s neighborhood. Based on Lyapunov stability theory, It ô differential equations, etc., by constructing the appropriate Lyapunov functional, we study and obtain sufficient conditions for the distributed synchronization of such networks in mean square.

With the rapid development of the information age, complex networks have received extensive attention as a frontier of interdisciplinary and challenging research fields. In real life, complex networks are everywhere, from the huge Internet to WWW [

As one of the more significant dynamic behaviors of complex dynamical networks, synchronization widely exists in real life, for example, the chorus of crickets, the applause of the audience at a concert, the spread of computer viruses, the epidemic of infectious diseases in the crowd, etc. All of these are well-known phenomena of synchronization, because it can describe many natural phenomena and has many potential applications, such as image processing, neuronal synchronization, secure communication, etc. [

As we all know, there are random uncertainties in any actual system and its external environment, for example, stochastic errors in system input and output, environmental noise, etc. With the deepening of research, people gradually realized that stochastic models can sometimes better reflect the inherent essential properties of natural and engineering systems. Various random emergencies or environmental noise will have a significant impact on natural systems, engineering systems, stock prices and other socio-economic systems, and some of them may even be subversive. For example, due to the existence of random interference factors, the modeling and analysis of the system become complicated, and the control and design of the system become difficult. Conventional deterministic algebraic equations and differential equations are no longer sufficient to accurately describe such network systems. In fact, since scientists discovered the Brownian motion (1827, Brown), proposed the Markov chain (1907, Markov), presented Langevin stochastic differential equation (1908, Langevin), gave an accurate mathematical description of Brownian motion (1923, Wiener), proposed Ornstein-Uhlenbeck noise (1930), laid the mathematical theoretical foundation of stochastic process (1931, Kolmogorov), discussed the mathematical theory of stochastic process (1951, Doob), and established Itô calculus theory, published a famous paper on stochastic differential equations (1951, K.Itô), laid the theoretical foundation of stochastic differential equations. In the past two hundred years, scientists have studied and analyzed stochastic phenomena, explored stochastic laws, and established a complete theoretical system of stochastic systems. Since then, the theory of stochastic systems based on stochastic analysis and stochastic differential equations has received full attention, and a large number of research results have been obtained which have permeated into many research fields and been widely applied. Therefore, the stochastic system control theory has become a hot research topic today and has important research value.

In the past ten years, many scholars have obtained a large number of constructive results on the study of synchronization of complex networks, and have proposed many effective methods. In [

Time-delay is a universal objective phenomenon in nature and human society, which is usually caused by limited signal transmission and memory effects. For example, in the field of automation and information technology, information acquisition, processing and transmission of sensors all require time. In fact, communication systems, transmission systems, and power systems are all typical time-delay systems. Therefore, the phenomenon of time delay is ubiquitous. In the topological structure of complex dynamical networks, there are inevitably coupled time-delays. Moreover, the coupled time-delay of the network will have a certain impact on the synchronization capability and control effect of the network. Therefore, the analysis and research on time-delay systems is very meaningful.

In summary, randomness and time-delay are the most common phenomena in real systems, such as power and biological systems in actual engineering systems are typical time-delayed stochastic systems. In the past, the research on synchronization of complex networks mainly focused on the fixed controller. In reference [

Based on the above viewpoints, a more general coupled time-varying delay complex dynamical network model under randomly occurring control is proposed in this paper. This model has the following characteristics: both controller activation and updating law of control gain occur in a probabilistic way, and the synchronization of stochastic complex networks is studied by considering randomly occurring control and updating law. The complex network model proposed in reference [

Notations: Let ℝ ( ℝ + ) denote the set of real (positive) numbers. ℝ n and ℝ n × m denote , respectively, the n-dimensional Euclidean space and the set of all n × m -dimensional real matrices. A > 0 denotes that the matrix A is a symmetric and positive definite matrix. The notation A^{T} is the transpose of a vector or matrix A. I represents the identity matrix with appropriate dimensions. ‖ A ‖ denotes the Euclidean norm of a matrix A and λ max ( A ) (respectively, λ min ( A ) ) denotes the maximum (respectively, minimum) eigen value of matrix A. The symbol t r a c e ( A ) represents the trace of square matrix A = ( a i j ) n × n , i.e. t r a c e ( A ) = ∑ i = 1 n a i i . ⊗ stands for the Kronecker product. And E { X } represents the expectation of the random variable X. Define a graph by G = [ V , E ] , where V = { 1 , ⋯ , N } denotes the vertex set and E = { e ( i , j ) } denotes the edge set. N ( i ) denotes the neighborhood of vertex i in the sense N ( i ) = { j ∈ V : e ( i , j ) ∈ E } . In this paper, graph G is supposed to be undirected [ e ( i , j ) ∈ E implies e ( j , i ) ∈ E ] and simple (without self-loops and multiple edges). Let L = [ l i j ] i , j = 1 N be the Laplacian matrix of graph G , which is defined as follows: for any pair i ≠ j , l i j = l j i = − 1 if e ( i , j ) ∈ E and l i j = l j i = 0 otherwise . l i i = − ∑ j = 1 , j ≠ i N l i j stands for the degree of vertex i ( i = 1 , 2 , ⋯ , N ) . Let ( Ω , F , P ) be a complete probability space, where Ω represents a sample space, F is called an σ-algebra, and P is a probability measure.

In this paper, we consider the following model of a complex network stochastic system with coupled time-varying delays, which can be expressed as:

d x i ( t ) = [ f ( x i , t ) + C ∑ j ∈ N ( i ) Γ ( x j ( t − τ ( t ) ) − x i ( t − τ ( t ) ) ) ] d t + σ ( x i ( t ) , t ) d w ( t ) , i = 1 , 2 , ⋯ , N (1)

where x i ( t ) = [ x i 1 ( t ) , x i 2 ( t ) , ⋯ , x i n ( t ) ] T ∈ ℝ n ( i = 1 , 2 , ⋯ , N ) is the state vector of the ith vertex, f ( x i , t ) = [ f 1 ( x i , t ) , f 2 ( x i , t ) , ⋯ , f n ( x i , t ) ] T is a continuous vector function, C is the coupling strength of the network. The inner coupling matrix Γ is a constant diagonal matrix, and Γ > 0 . τ ( t ) is a time-varying coupling delay. Furthermore, σ ( x , t ) : ℝ n × ℝ + → ℝ n is the noise intensity function vector, and w ( t ) is a scalar Brownian motion defined on ( Ω , F , P ) satisfying E { d w ( t ) } = 0 and E { [ d w ( t ) ] 2 } = d t . Additionally, from the Gershgorin disk theorem, all the eigenvalues of the Laplacian matrix L corresponding to graph G satisfy 0 = λ 1 ( L ) ≤ λ 2 ( L ) ≤ ⋯ ≤ λ N ( L ) . Furthermore, G is connected if and only if λ 2 ( L ) > 0 : i.e., L is irreducible.

In order to achieve the synchronization of the stochastic complex network in (1), controllers are added to each vertex.

d x i ( t ) = [ f ( x i , t ) + C ∑ j ∈ N ( i ) Γ ( x j ( t − τ ( t ) ) − x i ( t − τ ( t ) ) ) + u i ( t ) ] d t + σ ( x i ( t ) , t ) d w ( t ) , i = 1 , 2 , ⋯ , N (2)

where u i ( t ) is a distributed adaptive controller.

For the ith vertex, u i ( t ) is designed as

u i ( t ) = ρ ( t ) ∑ j ∈ N ( i ) ε i ( t ) Γ ( x j ( t ) − x i ( t ) ) , i = 1 , 2 , ⋯ , N (3)

where ε i ( t ) is the control strength of vertex i.

In (3), ρ ( t ) is a Bernoulli stochastic variable that describes the following random events for (2):

{ E v e n t 1 : ( 2 ) e x p e r i e n c e s ( 3 ) E v e n t 2 : ( 2 ) d o e s n o t e x p e r i e n c e ( 3 ) (4)

Let ρ ( t ) be defined by

ρ ( t ) = { 1 , i f E v e n t 1 o c c u r s 0 , i f E v e n t 2 o c c u r s (5)

where the probability of event { ρ ( t ) = 1 } is Pr { ρ ( t ) = 1 } = ρ ∈ [ 0 , 1 ] , so the expectation of random variable ρ ( t ) is E { ρ ( t ) } = ρ .

The distributed controller (3) in this paper takes stochastic disturbances into account. The distributed controller u i ( t ) occurs in a probabilistic manner and uses feedback information from neighboring points. Different from the conventional adaptive controller, the distributed controller u i ( t ) is not always implemented and it can model control failure in a stochastic way. In short, randomly occurring distributed control can effectively use the information of neighboring points to simulate real-world disturbances.

ε i ( t ) in (3) is updated according to the following randomly occurring distributed updating law:

d ε i ( t ) = ξ ( t ) α [ ∑ j ∈ N ( i ) ( x j ( t ) − x i ( t ) ) ] T Γ [ ∑ j ∈ N ( i ) ( x j ( t ) − x i ( t ) ) ] d t , i = 1 , 2 , ⋯ , N (6)

where α > 0 and ξ ( t ) is a Bernoulli stochastic variable representing the following random events for (6):

{ E v e n t 3 : ε i ( t ) e x p e r i e n c e s ( 6 ) E v e n t 4 : ε i ( t ) d o e s n o t e x p e r i e n c e ( 6 ) (7)

Similarly, Let ξ ( t ) be defined by

ξ ( t ) = { 1 , i f E v e n t 3 o c c u r s 0 , i f E v e n t 4 o c c u r s (8)

where the probability of event { ξ ( t ) = 1 } is Pr { ξ ( t ) = 1 } = ξ ∈ [ 0 , 1 ] , so the expectation of stochastic variable ξ ( t ) is E { ξ ( t ) } = ξ .

Remark 1: If ρ = 1 and ξ = 1 , the control and updating rule will be simplified to normal control and updating law, as shown in [

It can be seen from the above model that the network studied in this paper has the following characteristics:

1) The activation of the controller and the updating law of control gain both occur in a probabilistic manner, and the distributed synchronization of stochastic complex networks is studied by considering randomly occurring control and updating law.

2) Considering the effect of coupled time-delays, the model is more general.

In order to get the main results, the following definitions, assumptions and lemmas are needed.

Definition 1: Let x i ( t ) ( 1 ≤ i ≤ N ) be the solution of the stochastic complex network with coupled time-varying delay in (1) or (2), if they satisfy the following condition:

lim t → ∞ E ∑ i = 1 N ‖ x i ( t ) − x j ( t ) ‖ 2 = 0 , i , j = 1 , 2 , ⋯ , N (9)

then the stochastic complex network is said to achieve synchronization in mean square.

Lemma 1 (Itô formula) [

d x ( t ) = f ( t ) d t + g ( t ) d w ( t )

Let V ( x , t ) be a real-valued function, which is continuously twice differentiable in x and once differentiable in t. Then V ( x ( t ) , t ) is again an Itô process with the stochastic differential given by

d V ( x ( t ) , t ) = [ V t ( x ( t ) , t ) + V x ( x ( t ) , t ) f ( t ) + 1 2 t r a c e ( g T ( t ) V x x ( x ( t ) , t ) g ( t ) ) ] d t + V x ( x ( t ) , t ) g ( t ) d w ( t ) (10)

Lemma 2 [

± 2 x T y ≤ x T P x + y T P y . (11)

Lemma 3 [

λ min ( P ) ‖ x ‖ 2 ≤ x T P x ≤ λ max ( P ) ‖ x ‖ 2 . (12)

Assumption 1 [

( x − y ) T [ f ( x , t ) − f ( y , t ) − θ Γ ( x − y ) ] ≤ − Δ ( x − y ) T ( x − y ) (13)

holds for all x , y ∈ ℝ n and t ≥ 0 .

Assumption 2 [

‖ σ ( x , t ) − σ ( y , t ) ‖ ≤ k ‖ x − y ‖ (14)

Assumption 2 can describe many real-world systems very well. It has been widely employed or discussed in [

Assumption 3: Time-varying delay τ ( t ) satisfies: 0 ≤ τ ˙ ( t ) ≤ τ ¯ < 1 , where τ ˙ ( t ) represents the derivative of τ ( t ) to t.

In this section, we study the distributed synchronization problem of the stochastic complex network in (2) coupled with time-varying delay via randomly occurring control and updating law and obtain sufficient conditions for the distributed synchronization of such networks in mean square.

Theorem 1: Suppose that Assumptions 1-3 hold, then the stochastic complex network in (2) under the distributed adaptive controller (3) and updating law (6) will be globally synchronized in mean square, if the following conditions are satisfied:

{ k 2 − Δ + C 2 ⋅ λ 2 ( L ) ( λ max ( Γ Γ T ) + 1 1 − τ ¯ ) < 0 θ − b ρ ⋅ λ 2 ( L ) < 0 (15)

Proof: It should be noted that the stochastic dynamical network in (2) with ρ ( t ) and ξ ( t ) is a special stochastic system with Markovian switching. Therefore, the existence and uniqueness of solutions to (2) can be transformed into the existence and uniqueness of solutions to a stochastic system with Markovian switching. The proof of the existence and uniqueness of solutions to a stochastic system with Markovian switching can be found in [

Let e i j ( t ) = x i ( t ) − x j ( t ) , ∀ i , j = 1 , 2 , ⋯ , N and x = [ x 1 T , x 2 T , ⋯ , x N T ] T ∈ ℝ n N .

Consider the following Lyapunov function

V ( t ) = V 1 ( t ) + V 2 ( t ) + V 3 ( t ) (16)

where

V 1 ( t ) = 1 4 ∑ i = 1 N ∑ j ∈ N ( i ) e i j T e i j (17)

V 2 ( t ) = ρ 2 ξ α ∑ i = 1 N ( ε i ( t ) − b ) 2 (18)

V 3 ( t ) = C 2 ( 1 − τ ¯ ) ∑ i = 1 N ∫ t − τ ( t ) t [ ∑ j ∈ N ( i ) e i j ( s ) ] T [ ∑ j ∈ N ( i ) e i j ( s ) ] d s (19)

where b is a positive constant. According to (2) and (3) we can easily obtain

d e i j ( t ) = d x i ( t ) − d x j ( t ) = { f ( x i , t ) − f ( x j , t ) + C ∑ k ∈ N ( i ) Γ ( x k ( t − τ ( t ) ) − x i ( t − τ ( t ) ) ) − C ∑ m ∈ N ( j ) Γ ( x m ( t − τ ( t ) ) − x j ( t − τ ( t ) ) ) + ρ ( t ) ε i ( t ) Γ ∑ k ∈ N ( i ) [ x k ( t ) − x i ( t ) ] − ρ ( t ) ε j ( t ) Γ ∑ m ∈ N ( j ) [ x m ( t ) − x j ( t ) ] } d t + [ σ ( x i ( t ) , t ) − σ ( x j ( t ) , t ) ] d w ( t ) (20)

By the Lemma 1 (Itô formula), the stochastic derivative of V ( t ) can be obtained as

d V ( t ) = L V ( t ) d t + 1 2 ∑ i = 1 N ∑ j ∈ N ( i ) e i j T [ σ ( x i ( t ) , t ) − σ ( x j ( t ) , t ) ] d w ( t ) (21)

and according to (20), the Itô differential operator L is given as

L V ( t ) = 1 2 ∑ i = 1 N ∑ j ∈ N ( i ) e i j T { f ( x i , t ) − f ( x j , t ) + C ∑ k ∈ N ( i ) Γ ( x k ( t − τ ( t ) ) − x i ( t − τ ( t ) ) ) − C ∑ m ∈ N ( j ) Γ ( x m ( t − τ ( t ) ) − x j ( t − τ ( t ) ) ) + ρ ( t ) ε i ( t ) Γ ∑ k ∈ N ( i ) [ x k ( t ) − x i ( t ) ] − ρ ( t ) ε j ( t ) Γ ∑ m ∈ N ( j ) [ x m ( t ) − x j ( t ) ] } + ∑ i = 1 N ρ ξ ε i ( t ) ⋅ ξ ( t ) [ ∑ j ∈ N ( i ) e i j ] T Γ [ ∑ j ∈ N ( i ) e i j ] − ∑ i = 1 N ρ ξ b ⋅ ξ ( t ) [ ∑ j ∈ N ( i ) e i j ] T Γ [ ∑ j ∈ N ( i ) e i j ] + C 2 ( 1 − τ ¯ ) ∑ i = 1 N [ ∑ j ∈ N ( i ) e i j ( t ) ] T [ ∑ j ∈ N ( i ) e i j ( t ) ] − C 2 ( 1 − τ ¯ ) ∑ i = 1 N [ ∑ j ∈ N ( i ) e i j ( t − τ ( t ) ) ] T [ ∑ j ∈ N ( i ) e i j ( t − τ ( t ) ) ] ⋅ ( 1 − τ ˙ ( t ) ) + ∑ i = 1 N ∑ j ∈ N ( i ) 1 4 [ σ ( x i ( t ) , t ) − σ ( x j ( t ) , t ) ] T [ σ ( x i ( t ) , t ) − σ ( x j ( t ) , t ) ] (22)

Note that

1 2 ∑ i = 1 N ∑ j ∈ N ( i ) e i j T { ρ ( t ) ε i ( t ) Γ ∑ k ∈ N ( i ) [ x k ( t ) − x i ( t ) ] − ρ ( t ) ε j ( t ) Γ ∑ m ∈ N ( j ) [ x m ( t ) − x j ( t ) ] } = − ∑ i = 1 N ( ∑ j ∈ N ( i ) e i j ) T ρ ( t ) ε i ( t ) Γ ( ∑ j ∈ N ( i ) e i j ) (23)

and take expectations of ρ ( t ) and ξ ( t ) , we obtain E [ ρ ( t ) ] = ρ and E [ ρ ξ ξ ( t ) ] = ρ , furthermore

E { 1 2 ∑ i = 1 N ∑ j ∈ N ( i ) e i j T ( ρ ( t ) ε i ( t ) Γ ∑ k ∈ N ( i ) [ x k ( t ) − x i ( t ) ] − ρ ( t ) ε j ( t ) Γ ∑ m ∈ N ( j ) [ x m ( t ) − x j ( t ) ] ) + ∑ i = 1 N ρ ξ ε i ( t ) ⋅ ξ ( t ) [ ∑ j ∈ N ( i ) e i j ] T Γ [ ∑ j ∈ N ( i ) e i j ] } = E { − ∑ i = 1 N ( ∑ j ∈ N ( i ) e i j ) T ρ ( t ) ε i ( t ) Γ ( ∑ j ∈ N ( i ) e i j ) + ∑ i = 1 N ρ ξ ε i ( t ) ⋅ ξ ( t ) [ ∑ j ∈ N ( i ) e i j ] T Γ [ ∑ j ∈ N ( i ) e i j ] } = 0 (24)

Then, using Assumptions 1 and 2, (22), and (24), we have

E L V ( t ) = E { 1 2 ∑ i = 1 N ∑ j ∈ N ( i ) e i j T [ f ( x i , t ) − f ( x j , t ) − θ Γ e i j ] + θ 2 ∑ i = 1 N ∑ j ∈ N ( i ) e i j T Γ e i j − C ∑ i = 1 N [ ∑ j ∈ N ( i ) e i j ] T Γ [ ∑ j ∈ N ( i ) e i j ( t − τ ( t ) ) ] − ρ b ∑ i = 1 N [ ∑ j ∈ N ( i ) e i j ] T Γ [ ∑ j ∈ N ( i ) e i j ] + C 2 ( 1 − τ ¯ ) ∑ i = 1 N [ ∑ j ∈ N ( i ) e i j ( t ) ] T [ ∑ j ∈ N ( i ) e i j ( t ) ] − C 2 ( 1 − τ ¯ ) ∑ i = 1 N [ ∑ j ∈ N ( i ) e i j ( t − τ ( t ) ) ] T [ ∑ j ∈ N ( i ) e i j ( t − τ ( t ) ) ] ⋅ ( 1 − τ ˙ ( t ) )

+ ∑ i = 1 N ∑ j ∈ N ( i ) 1 4 [ σ ( x i ( t ) , t ) − σ ( x j ( t ) , t ) ] T [ σ ( x i ( t ) , t ) − σ ( x j ( t ) , t ) ] } ≤ E { − Δ 2 ∑ i = 1 N ∑ j ∈ N ( i ) e i j T e i j + θ 2 ∑ i = 1 N ∑ j ∈ N ( i ) e i j T Γ e i j − C ∑ i = 1 N [ ∑ j ∈ N ( i ) e i j ] T Γ [ ∑ j ∈ N ( i ) e i j ( t − τ ( t ) ) ] − ρ b ∑ i = 1 N [ ∑ j ∈ N ( i ) e i j ] T Γ [ ∑ j ∈ N ( i ) e i j ] + C 2 ( 1 − τ ¯ ) ∑ i = 1 N [ ∑ j ∈ N ( i ) e i j ( t ) ] T [ ∑ j ∈ N ( i ) e i j ( t ) ] − C 2 ( 1 − τ ¯ ) ∑ i = 1 N [ ∑ j ∈ N ( i ) e i j ( t − τ ( t ) ) ] T [ ∑ j ∈ N ( i ) e i j ( t − τ ( t ) ) ] ⋅ ( 1 − τ ˙ ( t ) ) + 1 4 ∑ i = 1 N ∑ j ∈ N ( i ) k e i j T e i j } (25)

From the definitions of e i j , x and the Laplacian matrix L, we get

1 2 ∑ i = 1 N ∑ j ∈ N ( i ) e i j T e i j = x T ( L ⊗ I n ) x (26)

∑ i = 1 N [ ∑ j ∈ N ( i ) e i j ] T Γ [ ∑ j ∈ N ( i ) e i j ] = x T ( L 2 ⊗ Γ ) x (27)

Besides, by using Lemma 2 and Lemma 3, one obtains that

− C ∑ i = 1 N [ ∑ j ∈ N ( i ) e i j ] T Γ [ ∑ j ∈ N ( i ) e i j ( t − τ ( t ) ) ] ≤ C 2 ∑ i = 1 N [ ∑ j ∈ N ( i ) e i j ] T Γ Γ T [ ∑ j ∈ N ( i ) e i j ] + C 2 ∑ i = 1 N [ ∑ j ∈ N ( i ) e i j ( t − τ ( t ) ) ] T [ ∑ j ∈ N ( i ) e i j ( t − τ ( t ) ) ] ≤ C 2 λ max ( Γ Γ T ) ∑ i = 1 N [ ∑ j ∈ N ( i ) e i j ] T [ ∑ j ∈ N ( i ) e i j ] + C 2 ∑ i = 1 N [ ∑ j ∈ N ( i ) e i j ( t − τ ( t ) ) ] T [ ∑ j ∈ N ( i ) e i j ( t − τ ( t ) ) ] (28)

From Assumption 3 we can see that 1 − 1 − τ ˙ ( t ) 1 − τ ¯ ≤ 0 . And substitute (26), (27) and (28) into (25), one gets that

E L V ( t ) ≤ E { ( k 2 − Δ ) ⋅ x T ( L ⊗ I n ) x + x T ( θ L ⊗ Γ ) x + x T ( − ρ b L 2 ⊗ Γ ) x + ( C 2 λ max ( Γ Γ T ) + C 2 ( 1 − τ ¯ ) ) ⋅ x T ( L 2 ⊗ I n ) x } = E { x T [ { ( k 2 − Δ ) I N + ( C 2 λ max ( Γ Γ T ) + C 2 ( 1 − τ ¯ ) ) L } L ⊗ I n ] x + x T [ ( θ I N − ρ b L ) L ⊗ Γ ] x } (29)

Note that condition (15) in Theorem 1 yields

k 2 − Δ + C 2 ⋅ λ 2 ( L ) ( λ max ( Γ Γ T ) + 1 1 − τ ¯ ) < 0 ⇒ { ( k 2 − Δ ) I N + ( C 2 λ max ( Γ Γ T ) + C 2 ( 1 − τ ¯ ) ) L } L ≤ 0 (30)

θ − b ρ ⋅ λ 2 ( L ) < 0 ⇒ ( θ I N − ρ b L ) L ≤ 0 (31)

Therefore, from (26), (29), (30) and (31) we can derive

E L V ( t ) ≤ E { − μ ⋅ x T ( L ⊗ I n ) x } = E { − μ 2 ⋅ ∑ i = 1 N ∑ j ∈ N ( i ) e i j T e i j } ≤ 0 (32)

where μ is a positive constant. Thus, the distributed synchronization of the stochastic complex network with coupled time-varying delay in (2) via randomly occurring control and updating law can be achieved in mean square.

When the delay in the stochastic complex network in (2) is a constant delay, the following simpler conditions can be obtained.

Corollary 1: Suppose that Assumptions 1 and 2 hold, then the stochastic complex network in (2) under the distributed adaptive controller (3) and updating law (6) will be globally synchronized in mean square, if the following conditions are satisfied:

{ k 2 − Δ + C 2 ⋅ λ 2 ( L ) ( λ max ( Γ Γ T ) + 1 ) < 0 θ − b ρ ⋅ λ 2 ( L ) < 0 (33)

Proof: The Lyapunov function constructed at this time becomes

V ( t ) = 1 4 ∑ i = 1 N ∑ j ∈ N ( i ) e i j T e i j + ρ 2 ξ α ∑ i = 1 N ( ε i ( t ) − b ) 2 + C 2 ∑ i = 1 N ∫ t − τ t [ ∑ j ∈ N ( i ) e i j ( s ) ] T [ ∑ j ∈ N ( i ) e i j ( s ) ] d s (34)

where b is a positive constant. The subsequent proof process is similar to the proof of Theorem 1, and will not be described in detail here.

In this paper, we have studied the distributed synchronization problem of stochastic complex networks with coupled time-varying delays via randomly occurring control and updating law. The activation of the controller and the updating law of control gain both occur in a probabilistic manner. According to the Lyapunov stability theory, Itô differential equations, etc., by constructing the appropriate Lyapunov functional, the sufficient conditions for the distributed synchronization of such networks in mean square are obtained.

This work was supported by the Fujian Provincial Department of Education Young and Middle-aged Teacher Education Research Project (JAT170914). The author would also like to thank the Editor-in-Chief, the Associate Editor, and the anonymous reviewers for their careful reading of the manuscript and constructive comments.

The author declares no conflicts of interest regarding the publication of this paper.

Liu, X.Y. (2020) Distributed Synchronization of Coupled Time-Delay Neural Networks Based on Randomly Occurring Control. Applied Mathematics, 11, 698-711. https://doi.org/10.4236/am.2020.117047