- About this Journal ·
- Abstracting and Indexing ·
- Advance Access ·
- Aims and Scope ·
- Annual Issues ·
- Article Processing Charges ·
- Articles in Press ·
- Author Guidelines ·
- Bibliographic Information ·
- Citations to this Journal ·
- Contact Information ·
- Editorial Board ·
- Editorial Workflow ·
- Free eTOC Alerts ·
- Publication Ethics ·
- Reviewers Acknowledgment ·
- Submit a Manuscript ·
- Subscription Information ·
- Table of Contents

Abstract and Applied Analysis

Volume 2012 (2012), Article ID 603535, 25 pages

http://dx.doi.org/10.1155/2012/603535

## Stochastic Synchronization of Reaction-Diffusion Neural Networks under General Impulsive Controller with Mixed Delays

^{1}Department of Mathematics, Chongqing Normal University, Chongqing 400047, China^{2}Department of Mathematics, College of Mathematics and Computing Science, Changsha University of Science and Technology, Changsha, Hunan 410076, China

Received 23 September 2012; Accepted 25 November 2012

Academic Editor: Sabri Arik

Copyright © 2012 Xinsong Yang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

#### Abstract

This paper investigates drive-response synchronization of a class of reaction-diffusion neural networks with time-varying discrete and distributed delays via general impulsive control method. Stochastic perturbations in the response system are also considered. The impulsive controller is assumed to be nonlinear and has multiple time-varying discrete and distributed delays. Compared with existing nondelayed impulsive controller, this general impulsive controller is more practical and essentially important since time delays are unavoidable in practical operation. Based on a novel impulsive differential inequality, the properties of random variables and Lyapunov functional method, sufficient conditions guaranteeing the global exponential synchronization in mean square are derived through strict mathematical proof. In our synchronization criteria, the distributed delays in both continuous equation and impulsive controller play important role. Finally, numerical simulations are given to show the effectiveness of the theoretical results.

#### 1. Introduction

Since the pioneering work of Pecora and Carroll [1], the issue of synchronization and chaos control has been extensively studied [2] due to its potential engineering applications such as secure communication, biological systems, and information processing (see [3–10]). It is shown that neural networks exhibit chaotic behavior and provided that parameters and delays are appropriately chosen (see [11, 12]). Therefore, in recent years, synchronization and control of neural networks has been one of the hot research topics (see [13–15], etc.).

It is known that many pattern formation and wave propagation phenomena that appear in nature can be described by systems of coupled nonlinear differential equations, generally known as reaction-diffusion equations. These wave propagation phenomena are exhibited by systems belonging to very different scientific disciplines. The reaction-diffusion effects, therefore, cannot be neglected in both biological and man-made neural networks, especially when electrons are moving in noneven electromagnetic field [16]. So we must consider that the activations vary in space as well as in time, and in this case the model should be expressed by partial differential equations. There are some published papers concerning stability or synchronization of neural networks with reaction-diffusion terms and delays (see [17–25]). In [22], the authors investigated synchronization of reaction-diffusion neural networks with discrete and unbounded distributed delays. In [24], the authors investigated the boundedness and exponential stability for nonautonomous fuzzy cellular neural networks with unbounded distributed delays and reaction-diffusion terms. The authors of [25] studied exponential stability of reaction-diffusion Cohen-Grossberg neural networks with time-varying discrete delays and stochastic perturbations.

Time delays usually exist in neural networks due to finite speeds of switching of amplifiers and transmission of signals in hardware implementation. Ignoring them when studying dynamics of neural networks may lead to impractical results. Moreover, delays are commonly time varying and unknown [26]. Therefore, papers concerning synchronization or stability of neural networks with or without reaction-diffusion terms have considered various time delays. The authors in [11] studied exponential synchronization problem for coupled neural networks with constant time delay. In [27], both constant and time-varying discrete delays were considered for the synchronization of a class of delayed neural networks. In [28–31] several types of synchronization for neural networks with discrete and bounded distributed delays were studied. However, the delay kernel of the bounded distributed delays in [28–31] has to be 1 because the well-known Jensen’s inequality [32] is not applicable anymore if the delay kernel is not 1. In the case of unbounded distributed delay, it is necessary to consider the delay kernel, which satisfies the condition that its integral from zero to infinite is bounded [22, 33, 34]. But the authors in [22, 33, 34] had to use algebraic approach instead of matrix method to derive their main results which has more complex form and is more conservative than those obtained by matrix method. In [21], Wang and Zhang studied global asymptotic stability of reaction-diffusion Cohen-Grossberg neural networks with unbounded distributed delays by using a matrix decomposition method, and the obtained results were in terms of linear matrix inequality (LMI). But the Lyapunov functional and proof process used in [21] are relatively complex. Recently, authors in [35] studied global asymptotic synchronization in an array of coupled neural networks with probabilistic interval time-varying coupling delays and unbounded distributed delays; a novel integral inequality including the Jensen’s inequality as a special case was developed. By using the developed integral inequality, one can use LMI method to solve the problem of distributed delays with not-equal-to-1 delay kernel instead of the matrix decomposition method used in [21].

It should be noted that control method is of great significance to realize synchronization. Specially, in [29], the output feedback controller which has time-varying discrete and distributed delays was considered. On the other hand, impulsive control, as one of the most effective and economic control methods, has recently attracted great interests of many researchers in different fields, since it needs small control gains and acts only at discrete times, thus control cost and the amount of transmitted information can be reduced drastically (see [3, 9, 26, 36–40] and references cited therein). As for neural networks with reaction-diffusion terms, there are several results on synchronization via control. For instance, state feedback control technique is utilized in [20] to realize exponential synchronization of stochastic fuzzy cellular neural networks with time delay in the leakage term and reaction diffusion. In [22], global exponential stability and synchronization of delayed reaction-diffusion neural networks under hybrid state feedback control and impulsive control. However, to the authors knowledge, impulsive control has not been considered in the literature to realize synchronization of reaction-diffusion neural networks. Moreover, the impulsive controllers in [3, 9, 36–40] were nondelayed. Recently, in [41], global exponential stability of fuzzy reaction-diffusion cellular neural networks with time-varying discrete delays and unbounded distributed delays and impulsive perturbations were studied. Nevertheless, to the best of our knowledge, there are no results on stability or synchronization of reaction-diffusion neural networks with time-varying discrete delays and distributed delays under impulsive controller which has multiple time-varying delays, let alone impulsive controller with distributed delays. If these delays are considered in impulsive controller, the analysis methods used in [3, 9, 26, 36–40] are not applicable anymore. Considering the fact that both discrete delays and distributed delays are unavoidable in practice, it is of great importance to consider delayed impulsive control to synchronize-delayed neural neural networks.

Being motivated by the above discussions, this paper aims to study the global exponential derive-response synchronization of reaction-diffusion neural networks with multiple time-varying discrete delays and unbounded distributed delays via general impulsive control. The general impulsive controller is assumed to be nonlinear and has multiple time-varying discrete and distributed delays. Since time delays are always vary and unavoidable in practical operation, the general impulsive controller is essentially important and more practical than existing nondelayed impulsive controller. Stochastic perturbations in the response system are also considered. By using a novel integral inequality in [35], the problem of distributed delays with not-equal-to-1 delay kernel can be solved by matrix method. By utilizing the novel integral inequality, the properties of random variables and Lyapunov functional method, sufficient conditions guaranteeing the considered drive-response systems to realize synchronization in mean square are derived through strict mathematical proof. The proof process and the results are very simple. Finally, numerical simulations are given to show the effectiveness of the theoretical results.

The rest of this paper is organized as follows. In Section 2, the considered model of coupled reaction-diffusion neural networks with delays is presented. Some necessary assumptions, definitions, and lemmas are also given in this section. In Section 3, synchronization for the proposed model is studied. Then, in Section 4, simulation examples are presented to show the effectiveness of the theoretical results. Finally, Section 5 provides some conclusions.

*Notations*. In the sequel, if not explicitly stated, matrices are assumed to have compatible dimensions. denotes the set of positive integers. denotes the identity matrix. denotes the Euclidean space, and is the set of all real matrix. and mean the largest and smallest eigenvalues of matrix , respectively, , where denotes transposition. means is a diagonal matrix. Moreover, let be a complete probability space with filtration satisfying the usual conditions (i.e., the filtration contains all -null sets and is right continuous). Denote by the family of all -measurable -valued random variables such that , where stands for mathematical expectation operator with respect to the given probability measure . Sometimes, the arguments of a function or a matrix will be omitted in the analysis when no confusion can arise.

#### 2. Preliminaries

Consider a delayed neural network with reaction-diffusion terms which is described as follows: or in a compact form where , , , means the transmission diffusion coefficient along the th neuron; , , and is a constant. represents the state vector of the network at time and in space ; corresponds to the number of neurons; is the neuron activation function at time and in space ; with ; , and are the connection weight matrix; is an external input vector. The bounded function represents unknown time-varying discrete delay of the system with , in which is a constant, is a nonnegative bounded scalar function defined on describing the delay kernel of the unbounded distributed delay.

We suppose that system (2.2) has an unique continuous solution for any initial condition of the following form: , where denotes the Banach space of all continuous functions from to with the norm It is assumed that (2.2) satisfies the following Dirichlet boundary condition:

Based on the concept of drive-response synchronization, we take (2.2) as the driver system and design the following controlled response system: where , is the Dirac delta function, the time sequence satisfies , and . is the control input. is a -dimensional Brown motion defined on . Here, the white noise is independent of for , and is the noise intensity function matrix, in which the bounded functions and represent unknown discrete and distributed delays of the system in the stochastic perturbation with , . This type of stochastic perturbation can be regarded as a result from the occurrence of random uncertainties during the process of transmission. We assume that the output signals of (2.2) can be received by (2.5).

In the present paper, the control input is assumed to be the following form: where are unknown time-varying delays with .

Integrating from to ( is a sufficient small constant) on both sides of system (2.5) and letting , one gets from the property of the Dirac delta function that where , . In the following, we use to denote for short.

*Remark 2.1. *Equation (2.7) is actually the impulsive controller of response system (2.5). To the best of our knowledge, result on synchronization of reaction-diffusion neural networks under impulsive control is seldom. In [22], global exponential synchronization of delayed reaction-diffusion neural networks was studied. However, the control scheme in [22] is hybrid nondelayed state feedback control and nondelayed impulsive control, and the continuous state feedback controller is indispensable. Moreover, the impulsive controller (2.7) is very general, since it includes information of multiple time-varying discrete delays and time-varying distributed delays. Nevertheless, most of published paper concerning impulsive control including [3, 9, 26, 36–40] did not consider time delay in the impulsive function, let alone multiple time-varying discrete delays and time-varying distributed delays. It is known that both discrete delays and distributed delays are unavoidable and often time-varying in neural networks, hence considering impulsive control with time-varying discrete delays and time-varying distributed delays is essentially important. However, when time-varying discrete delays and time-varying distributed delays are considered in impulsive control, the results in [3, 9, 26, 36–40] is not applicable anymore.

From (2.7), the controlled system (2.5) can be rewritten as

To maintain consistency with above definitions, the initial value and the boundary condition of (2.8) are given in the following form:

Throughout this paper, we always assume that is left continuous at , that is, . Then subtracting (2.2) from (2.8) gets the following error dynamical system: where .

It is obvious that system (2.11) satisfies the Dirichlet boundary condition, and its initial condition is

It is easy to see that the error system (2.11) admits a zero solution. Clearly, if the zero solution is globally exponentially stable, then the controlled system (2.8) is globally exponentially synchronized with system (2.2).

Throughout this paper, we assume that () for any , there exist constants such that ; () there is a positive constant such that ; () there exist positive constants , and such that () there exist nonnegative constants , , such that

The following basic definitions and lemmas are needed in this paper to get main results.

*Definition 2.2 (see [9]). *The dynamical network (2.9) is said to be globally exponentially synchronized with system (2.2) in mean square if there exist constants and such that for any initial values (2.12)
hold for .

Lemma 2.3 (see [17]). *Let be a cube , and let be a real-valued function belonging to which vanish on the boundary of , that is, . Then
*

Lemma 2.4 (see [42]). *If are real matrices with appropriate dimensions, then there exist number such that
*

Lemma 2.5 2.5 (see [35]). *Suppose that is a nonnegative bounded scalar function defined on , and there exists a positive constant such that . For any constant matrix , , and vector function for , one has
**
provided the integrals are all well defined.*

*Remark 2.6. *When there is a positive bounded function such that , where , then the inequality (2.18) becomes the following from:
Specially, when for , then in (2.19). In this case, the inequality (2.19) turns out to the well-known Jensen’s inequality [32]. In the literature, there were many results concerning stability or synchronization of neural networks with bounded distributed delays, for instance, see [28–31]. However, the delay kernels in [28–31] were all assumed to be 1. Obviously, the unbounded distributed delays in this paper include those [28–31] as a special case. It is easy to see from inequalities (2.18) and (2.19) that results of this paper are also applicable to neural networks with bounded distributed delays, no matter whether is equal to 1 or not. In this sense, models in this paper are more general than those those in [28–31].

Lemma 2.7. *Consider the following impulsive differential inequalities:
**
where , , , , and are constants, , , , , , , , , is continuous on , and is continuous except , , where it has jump discontinuities. The consequence satisfies , and . Suppose that
**
Then there exist constants and such that
**
where , .*

The proof of Lemma 2.7 is given in the appendix, which is partly similarly to that of Lemma 1 in [43].

*Remark 2.8. *Lemma 2.7 actually provides stability criterion for impulsive differential equations with multiple time-varying delays, and impulsive function is related to the same multiple time-varying delays. Actually, Lemma 2.7 can be written in a more general form. Let , , , , , , , the other parameters are the same as those in Lemma 2.7. Then one can get the following Lemma 2.9.

Lemma 2.9. *Consider the following impulsive differential inequality:
**
Suppose that
**
Then there exist constants and such that
**
where , .*

*Remark 2.10. *Lemmas 2.7 and 2.9 are general. Specially, if , , then the inequalities in (2.25) becomes

Take , . Then and Therefore, implies (2.27); that is, the inequality (2.27) is less conservative than (2.29). In fact, the inequality (2.29) is exactly the inequalities and in Theorem 3.1 of [26]. (In the proof in Theorem 3.1 in [26], one can get from that . By comparing the coefficients in the first two inequalities in the proof of Theorem 3.1 in [26] with those in the inequalities and in [26], the conclusion can be easily achieved). Hence, Lemmas 2.7 and 2.9 improve and extend the Theorem 3.1 in [26]. In the literature, many results including those in [3, 9, 38, 40] were derived by using similar method used in [26]. Since Lemmas 2.7 and 2.9 include corresponding results in [26] as a special case and are less conservative than them, Lemmas 2.7 and 2.9 are very useful for stabilization and synchronization of impulsive control system.

#### 3. Main Results

In this section, the global exponential synchronization criteria for system (2.8) and (2.2) are derived through strict mathematical reasoning.

Theorem 3.1. *Suppose that conditions ()–() hold. If there exists constants , and such that
**
where , , . Then, under the impulsive controller (2.7), the controlled system (2.8) is globally exponentially synchronized with system (2.2) in mean square.*

*Proof. *Consider the following Lyapunov function:

We use to denote the infinitesimal operator of [44], which is defined as

Based on the property of Wiener process [11], differentiating along the solution of the error system (2.11) for , obtains that
where

From the Green’s formula and the Dirichlet boundary condition, we have (see [17–19])
in which is the gradient operator, and

In view of Lemma 2.3, it is derived that

For any positive constants , , and , it follows from () and Lemma 2.4 that

By using condition () and Lemma 2.5, one obtains from (3.12) that

Considering condition () and substituting (3.9)–(3.11) and (3.13) into (3.6) derive that

Taking mathematical expectations on both sides of (3.5), it can be derived from inequations (3.14) and () that
where .

On the other hand, it is obtained from () and the second equation of (2.11) that
which means that

By virtue of Lemma 2.7, if the inequalities (3.1) and (3.2) hold, then it follows from (3.15) and (3.17) that there exist constants and such that

By Definition 2.2, the controlled system (2.8) is globally exponentially synchronized with system (2.2) in mean square. This completes the proof.

Note that there are three uncertain positive constants , , and . Not making a good choice of the three constants may lead to the conservativeness of Theorem 3.1 in practical application. In order to hit off this fault, our next aim is to determine the constants , , and such that the conservativeness of Theorem 3.1 can be reduced as much as possible. We present the following Theorem 3.2.

Theorem 3.2. *Suppose that conditions ()–(). Then, under the impulsive controller (2.7), the controlled system (2.8) is globally exponentially synchronized with system (2.2) in mean square if the following inequalities hold
**
where , the other parameters are defined as those in Theorem 3.1.*

*Proof. *Define the function with positive variables , , and as follows:

In order that the result of Theorem 3.1 is less conservative, we only need to find out three constants , , and such that the inequality (3.2) is less conservative. To achieve this goal, we will find a point such that takes the minimum value and . By simple computation, one derives that , , . Let , one gets . It is obvious that the Hesse matrix of at is positive definite. Hence, takes the minimum value at according to the extreme value theory of multivariate function. Taking arrives at the condition (3.20). This completes the proof.

*Remark 3.3. *Theorems 3.1 and 3.2 are not dependent on discrete delays of both continuous equation and impulsive controller, which is consistent with results of [3, 9, 26, 38], though they did not consider delays in impulses. It should be noted that the inequalities in Theorems 3.1 and 3.2 are related to , , and , which mean that distributed delays in both continuous equation and impulsive controller have important effects on synchronization criteria in our results. This new discovery is completely different from existing results including those in [3, 9, 26, 37–40]. As was pointed out in Remark 2.8, results in [3, 9, 38, 40] were derived by using similar method used in [26], hence results of this paper improve those in [3, 9, 26, 38, 40] even when , and in (2.11). To sum up, results of this paper are new and improve and extend most of known corresponding ones.

*Remark 3.4. *Lemma 2.5 is utilized in (3.13), which makes the proof process more simple than those in [21, 22, 34]. In [21], matrix decomposition method was used to deal with not-equal-to-1 delay kernel, hence the Lyapunov functional and proof process are relatively complex. Authors in [22, 34] had to utilize algebraic approach instead of matrix method to derive their main results. It is well known that results derived from algebraic approach have more complex form and is more conservative than those obtained by matrix method. Therefore, results of this paper improve those in [21, 22, 34] to some extent.

*Remark 3.5. *Stochastic perturbations are unavoidable in real applications of neural networks. In this paper, we synchronize a class of reaction-diffusion neural networks with stochastic perturbations via impulsive control. Although there were several results on stability of reaction-diffusion neural with stochastic perturbations [45, 46], seldom published papers considered synchronization of this kind of neural networks under impulsive control. Moreover, the stochastic perturbations of this paper are more general than those in [45, 46], since they include information of distributed delays.

#### 4. Examples and Simulations

As applications of the the theoretical results derived above, in this section, we give numerical simulations to demonstrate that our synchronization criteria are effective.

Consider the following reaction-diffusion neural network with both discrete and unbounded distributed delays where , ,, , , , ,

Take the boundary condition of (4.1) as , . In the case that initial condition is chosen as , and , , the chaotic-like trajectory of (4.1) is shown in Figures 1, 2, and 3. Taking , then we get the chaotic-like trajectory of (4.1) without reaction-diffusion terms shown in Figure 4.

Let system (4.1) be the driver network, we design a response system as where , with positive constants , , and , the noise intensity function matrix is By Jensen’s inequality (which is a special case of inequality (2.19)), one has From (4.5) one gets Similarly, by using Jensen’s inequality one derives that

Obviously, , , , , , , , , , , and . Therefore, ()–() are satisfied. Choose , and . Then the inequalities (3.19) and (3.20) are satisfied with , , respectively. According to Theorem 3.2, the controlled system (4.3) is globally exponentially synchronized with system (4.1) in mean square. Figure 5 presents the dynamical behavior of synchronization errors and , which close to zero quickly as time increases.

#### 5. Conclusion

Delays are unavoidable in practical systems, and they are always unknown and time-varying. This paper studies stochastic synchronization of reaction-diffusion neural networks with both time-varying discrete and distributed delays via delayed impulsive control. The impulsive controller has multiple time-varying discrete and distributed delays which is very general. Based on a novel integral inequality, the problem of distributed delays with not-equal-to-1 delay kernel is well handled with matrix method. Sufficient synchronization criteria are given to guarantee the global exponential synchronization in mean square of the considered system. The function extreme value theorem is utilized to get a less conservative result. It is discovered that, in our synchronization criteria, the distributed delays in both continuous equation and impulsive controller have important effects. At last, numerical simulations show the validity of the obtained criteria.

#### Appendix

*Proof of Lemma 2.7. *
Without loss of generality, we assume that . Consider the following scalar function:

It follows from inequality (2.22) that . Since for and is continuous on , there exists a positive constant such that and for all .

Let . Then we can select a constant such that for all ,

From (A.3), we can choose such that

It follows from the above inequality that

Next we will prove that

We use mathematical induction to prove that (A.6) holds. Firstly, we prove that (A.6) holds for . To do this, we only need to prove that

If the inequality (A.7) is not true, then there exists some such that
which implies that there exists such that and
and there exists such that
Therefore, one gets from (A.4), (A.9), and (A.10) that, for any ,
Thus, one has from (A.2) and (A.11) that
It follows from (A.5), (A.9), (A.10), and (A.12) that
which is a contradiction. Hence (A.6) holds for .

Now we assume that (A.6) holds for , , , that is,
Next, we will show that (A.6) holds for , that is,

For the sake of contradiction, suppose that (A.15) does not hold. Define . Then one obtains from (A.3) and (A.14) that
which implies that . From the continuity of in the interval , one has

On the other hand, one can deduce from (A.16) that there exists such that

For any