2009
DOI: 10.1016/j.matcom.2008.07.002
|View full text |Cite
|
Sign up to set email alerts
|

New criteria for globally exponential stability of delayed Cohen–Grossberg neural network

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
18
0

Year Published

2011
2011
2020
2020

Publication Types

Select...
4
4

Relationship

0
8

Authors

Journals

citations
Cited by 20 publications
(18 citation statements)
references
References 24 publications
0
18
0
Order By: Relevance
“…The main results of this paper are demonstrated using Cohen-Grossberg Neural (CGN) Networks, which are dynamical networks whose stability is often studied in the presence of constant-type and time-varying time-delays [19,20]. It is worth noting that the results of this paper justify the modeling of dynamical networks and switched systems without formally including delays in the model if it is known that the system is intrinsically stable.…”
mentioning
confidence: 91%
See 1 more Smart Citation
“…The main results of this paper are demonstrated using Cohen-Grossberg Neural (CGN) Networks, which are dynamical networks whose stability is often studied in the presence of constant-type and time-varying time-delays [19,20]. It is worth noting that the results of this paper justify the modeling of dynamical networks and switched systems without formally including delays in the model if it is known that the system is intrinsically stable.…”
mentioning
confidence: 91%
“…We also show that the asymptotic state of intrinsically stable switched systems is independent of the system's initial conditions (see Main Result 1). This allows us to show that the globally attracting state of any intrinsically stable network and any time-delayed version of the network are identical (see Proposition 1).The main results of this paper are demonstrated using Cohen-Grossberg Neural (CGN) Networks, which are dynamical networks whose stability is often studied in the presence of constant-type and time-varying time-delays [19,20]. It is worth noting that the results of this paper justify the modeling of dynamical networks and switched systems without formally including delays in the model if it is known that the system is intrinsically stable.…”
mentioning
confidence: 91%
“…As a network's dynamics can be related to the network's spectrum we can in certain cases determine how specialization of a network will effect the dynamics on the network. The type of dynamics we consider here is global stability, which is an important property in a number of systems including neural networks [10,12,11,14,36], network epidemic models [38], and in the study of congestion on computer networks [2]. The main example(s) we consider here and apply our results to are recurrent neural networks, which model the electrical activity in the brain and which form the basis of certain algorithms in machine learning [33].…”
Section: Introductionmentioning
confidence: 99%
“…This is advantageous from a computational point of view since it is significantly simpler to investigate the stability of an undelayed network than a network with delays.With this theory in place we consider the class of dynamical networks known as Cohen-Grossberg neural networks [4] whose stability has received a considerable amount of attention. See for instance [5,8,11,14,15,16]. By applying our theory to such systems we are able to derive new criteria for the stability of both the delayed and undelayed versions of this class of networks.To further apply this theory we note that one of the major obstacle in determining the dynamic behavior of a network (or high-dimensional system) is that the information needed to do so is spread throughout the network components.…”
mentioning
confidence: 99%
“…(Stability of Time-Delayed Cohen-Grossberg Networks) Let (H, R nT ) be the time-delayed Cohen-Grossberg network given by(15) where φ i has Lipschitz constant L. If |1 − | + Lρ(|W |) < 1 then (H, R nT ) has a globally attracting fixed point.The point of theorem 4.5 is that although time-delayed Cohen-Grossberg networks are more complicated systems than Cohen-Grossberg networks without delays, the criteria for their stability is not.4.3.Proving Theorem 4.2 and Theorem 4.4. In order to prove theorems 4.2 and theorem 4.4 we will use the well known theorem of Perron and Frobenius and the following standard terminology.…”
mentioning
confidence: 99%