We study phase synchronization in a network motif with a starlike structure in which the central node's (the hub's) frequency is strongly detuned against the other peripheral nodes. We find numerically and experimentally a regime of remote synchronization (RS), where the peripheral nodes form a phase synchronized cluster, while the hub remains free with its own dynamics and serves just as a transmitter for the other nodes. We explain the mechanism for this RS by the existence of a free amplitude and also show that systems with a fixed or constant amplitude, such as the classic Kuramoto phase oscillator, are not able to generate this phenomenon. Further, we derive an analytic expression which supports our explanation of the mechanism.

We investigate the suitability of selected measures of complexity based on recurrence quantification analysis and recurrence networks for an identification of pre-seizure states in multi-day, multi-channel, invasive electroencephalographic recordings from five epilepsy patients. We employ several statistical techniques to avoid spurious findings due to various influencing factors and due to multiple comparisons and observe precursory structures in three patients. Our findings indicate a high congruence among measures in identifying seizure precursors and emphasize the current notion of seizure generation in large-scale epileptic networks. A final judgment of the suitability for field studies, however, requires evaluation on a larger database.

We present methods to detect the transitions from quasiperiodic to chaotic motion via strange nonchaotic attractors (SNAs). These procedures are based on the time needed by the system to recur to a previously visited state and a quantification of the synchronization of trajectories on SNAs. The applicability of these techniques is demonstrated by detecting the transition to SNAs or the transition from SNAs to chaos in representative quasiperiodically forced discrete maps. The fractalization transition to SNAs--for which most existing diagnostics are inadequate--is clearly detected by recurrence analysis. These methods are robust to additive noise, and thus can be used in analyzing experimental time series.

Observing how long a dynamical system takes to return to some state is one of the most simple ways to model and quantify its dynamics from data series. This work proposes two formulas to estimate the KS entropy and a lower bound of it, a sort of Shannon's entropy per unit of time, from the recurrence times of chaotic systems. One formula provides the KS entropy and is more theoretically oriented since one has to measure also the low probable very long returns. The other provides a lower bound for the KS entropy and is more experimentally oriented since one has to measure only the high probable short returns. These formulas are a consequence of the fact that the series of returns do contain the same information of the trajectory that generated it. That suggests that recurrence times might be valuable when making models of complex systems.

No abstract