Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userEnhancing network synchronization by phase modulation
148
0
0.0
(
0
)
Added by
Xingang Wang Professor
Publication date
2018
fields
Physics
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
Due to time delays in signal transmission and processing, phase lags are inevitable in realistic complex oscillator networks. Conventional wisdom is that phase lags are detrimental to network synchronization. Here we show that judiciously chosen phase lag modulations can result in significantly enhanced network synchronization. We justify our strategy of phase modulation, demonstrate its power in facilitating and enhancing network synchronization with synthetic and empirical network models, and provide an analytic understanding of the underlying mechanism. Our work provides a new approach to synchronization optimization in complex networks, with insights into control of complex nonlinear networks.
rate research
Read More
The behavior of two unidirectionally coupled chaotic oscillators near the generalized synchronization onset has been considered. The character of the boundaries of the generalized synchronization regime has been explained by means of the modified system
We propose a method for detecting the presence of synchronization of self-sustained oscillator by external driving with linearly varying frequency. The method is based on a continuous wavelet transform of the signals of self-sustained oscillator and external force and allows one to distinguish the case of true synchronization from the case of spurious synchronization caused by linear mixing of the signals. We apply the method to driven van der Pol oscillator and to experimental data of human heart rate variability and respiration.
We show that two coupled map lattices that are mutually coupled to one another with a delay can display zero delay synchronization if they are driven by a third coupled map lattice. We analytically estimate the parametric regimes that lead to synchronization and show that the presence of mutual delays enhances synchronization to some extent. The zero delay or isochronal synchronization is reasonably robust against mismatches in the internal parameters of the coupled map lattices and we analytically estimate the synchronization error bounds.
We study the relationship between synchronization and the rate with which information is exchanged between nodes in a spatio-temporal network that describes the dynamics of classical particles under a substrate Remoissenet-Peyrard potential. We also show how phase and complete synchronization can be detected in this network. The difficulty in detecting phase synchronization in such a network appears due to the highly non-coherent character of the particle dynamics which unables a proper definition of the phase dynamics. The difficulty in detecting complete synchronization appears due to the spatio character of the potential which results in an asymptotic state highly dependent on the initial state.
Complexity of dynamical networks can arise not only from the complexity of the topological structure but also from the time evolution of the topology. In this paper, we study the synchronous motion of coupled maps in time-varying complex networks both analytically and numerically. The temporal variation is rather general and formalized as being driven by a metric dynamical system. Four network models are discussed in detail in which the interconnections between vertices vary through time randomly. These models are 1) i.i.d. sequences of random graphs with fixed wiring probability, 2) groups of graphs with random switches between the individual graphs, 3) graphs with temporary random failures of nodes, and 4) the meet-for-dinner model where the vertices are randomly grouped. We show that the temporal variation and randomness of the connection topology can enhance synchronizability in many cases; however, there are also instances where they reduce synchronizability. In analytical terms, the Hajnal diameter of the coupling matrix sequence is presented as a measure for the synchronizability of the graph topology. In topological terms, the decisive criterion for synchronization of coupled chaotic maps is that the union of the time-varying graphs contains a spanning tree.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
