zbMATH — the first resource for mathematics

Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Synchronization of complex dynamical networks under recoverable attacks. (English) Zbl 1214.93101
Summary: The synchronization of Complex Dynamical Networks (CDNs) under ‘successful’ but recoverable attacks is studied by utilizing the framework of switching systems. ‘Successful’ attacks refer to a class of attacks that break a network into a group of isolated clusters. Recoverable attacks refer to a class of attacks that the network can recover from after a period of time. To facilitate the investigation of the synchronization of a CDN under ‘successful’ but recoverable attacks, the attack frequency and the average recovering time are introduced. By using a piecewise Lyapunov function, the upper bounds of the attack frequency and the average recovering time are obtained to ensure that the whole network can achieve global synchronization under attacks.
93D30Scalar and vector Lyapunov functions
93C30Control systems governed by other functional relations
93C15Control systems governed by ODE