# 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)
Blinking model and synchronization in small-world networks with a time-varying coupling. (English) Zbl 1098.82621
Summary: The paper proposes a new type of small-world networks of cells with chaotic behavior. This network consists of a regular lattice of cells with constant 2K-nearest neighbor couplings and time-dependent on–off couplings between any other pair of cells. In each time interval of duration such a coupling is switched on with probability p and the corresponding switching random variables are independent for different links and for different times. At each moment, the coupling structure corresponds to a small-world graph, but the shortcuts change from time interval to time interval, which is a good model for many real-world dynamical networks. It is to be distinguished from networks that have randomly chosen shortcuts, fixed in time. Here, we apply the Connection Graph Stability method, developed in the companion paper (”Connection graph stability method for synchronized coupled chaotic systems”, see this issue), to the study of global synchronization in this network with the time-varying coupling structure, in the case where the on–off switching is fast with respect to the characteristic synchronization time of the network. The synchronization thresholds are explicitly linked with the average path length of the coupling graph and with the probability $p$ of shortcut switchings in this blinking model. We prove that for the blinking model, a few random shortcut additions significantly lower the synchronization threshold together with the effective characteristic path length. Short interactions between cells, as in the blinking model, are important in practice. To cite prominent examples, computers networked over the Internet interact by sending packets of information, and neurons in our brain interact by sending short pulses, called spikes. The rare interaction between arbitrary nodes in the network greatly facilitates synchronization without loading the network much. In this respect, we believe that it is more efficient than a structure of fixed random connections.
##### MSC:
 82C99 Time-dependent statistical mechanics 37D45 Strange attractors, chaotic dynamics 37N20 Dynamical systems in other branches of physics 92C37 Cell biology 94C99 Circuits, networks