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)
Maximum performance at minimum cost in network synchronization. (English) Zbl 1117.34048

The subject of the paper is the network of coupled identical oscillators

x ˙ i =F(x i )+σ j=1 n A ij [H(x j )-H(x i )],i=1,,n,

where σ is the parameter which controls the overall coupling, x i m is the phase variable of i-th oscillator, A ij 0, is the relative strength of the coupling, and H: m m is the output function.

The following optimization problems are considered: 1. Maximization of synchronizability, i.e. the maximization of the region of parameter σ, for which stable synchronization occurs. 2. Minimization of the synchronization cost, which is defined as the sum of the total input strength of all nodes at the lower synchronization threshold σ min : C=σ min i,j=1 n A ij .

The main result shows that the solution sets for these two optimization problems coincide and are characterized by the following condition on the Laplacian (i.e. the matrix (A ij )) eigenvalues:

0=λ 1 <λ 2 ==λ n ·

The authors study such optimal networks and drive some useful conclusions about their structure.


MSC:
34D05Asymptotic stability of ODE
34C15Nonlinear oscillations, coupled oscillators (ODE)
34C30Manifolds of solutions of ODE (MSC2000)
34C28Complex behavior, chaotic systems (ODE)
34D08Characteristic and Lyapunov exponents
49N99Miscellaneous topics in calculus of variations