zbMATH — the first resource for mathematics

Examples
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.

Operators
a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
Fields
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)
Emergence of synchronization in complex networks of interacting dynamical systems. (English) Zbl 1130.37347
Summary: We study the emergence of coherence in large complex networks of interacting heterogeneous dynamical systems. We show that for a large class of dynamical systems and network topologies there is a critical coupling strength at which the systems undergo a transition from incoherent to coherent behavior. We find that the critical coupling strength at which this transition takes place is k c =(Zλ) -1 , where Z depends only on the uncoupled dynamics of the individual systems on each node, while λ is the largest eigenvalue of the network adjacency matrix. Thus we achieve a separation of the problem into two parts, one depending solely on the node dynamics, and one depending solely on network topology.
MSC:
37C99Smooth dynamical systems
94C99Circuits, networks