RESUMEN
Recurrence microstates are obtained from the cross recurrence of two sequences of values embedded in a time series, being the generalization of the concept of recurrence of a given state in phase space. The probability of occurrence of each microstate constitutes a recurrence quantifier. The set of probabilities of all microstates are capable of detecting even small changes in the data pattern. This creates an ideal tool for generating features in machine learning algorithms. Thanks to the sensitivity of the set of probabilities of occurrence of microstates, it can be used to feed a deep neural network, namely, a microstate multi-layer perceptron (MMLP) to classify parameters of chaotic systems. Additionally, we show that with more microstates, the accuracy of the MMLP increases, showing that the increasing size and number of microstates insert new and independent information into the analysis. We also explore potential applications of the proposed method when adapted to different contexts.
RESUMEN
The recurrence analysis of dynamic systems has been studied since Poincaré's seminal work. Since then, several approaches have been developed to study recurrence properties in nonlinear dynamical systems. In this work, we study the recently developed entropy of recurrence microstates. We propose a new quantifier, the maximum entropy (Smax). The new concept uses the diversity of microstates of the recurrence plot and is able to set automatically the optimum recurrence neighborhood (ϵ-vicinity), turning the analysis free of the vicinity parameter. In addition, ϵ turns out to be a novel quantifier of dynamical properties itself. We apply Smax and the optimum ϵ to deterministic and stochastic systems. The Smax quantifier has a higher correlation with the Lyapunov exponent and, since it is a parameter-free measure, a more useful recurrence quantifier of time series.
RESUMEN
We extend a recently introduced prototypical stochastic model describing uniformly the search and return of objects looking for new food sources around a given home. The model describes the kinematic motion of the object with constant speed in two dimensions. The angular dynamics is driven by noise and describes a "pursuit" and "escape" behavior of the heading and the position vectors. Pursuit behavior ensures the return to the home and the escaping between the two vectors realizes exploration of space in the vicinity of the given home. Noise is originated by environmental influences and during decision making of the object. We take symmetric α -stable noise since such noise is observed in experiments. We now investigate for the simplest possible case, the consequences of limited knowledge of the position angle of the home. We find that both noise type and noise strength can significantly increase the probability of returning to the home. First, we review shortly main findings of the model presented in the former manuscript. These are the stationary distance distribution of the noise driven conservative dynamics and the observation of an optimal noise for finding new food sources. Afterwards, we generalize the model by adding a constant shift γ within the interaction rule between the two vectors. The latter might be created by a permanent uncertainty of the correct home position. Nonvanishing shifts transform the kinematics of the searcher to a dissipative dynamics. For the latter, we discuss the novel deterministic properties and calculate the stationary spatial distribution around the home.
RESUMEN
In this work, we apply the spatial recurrence quantification analysis (RQA) to identify chaotic burst phase synchronisation in networks. We consider one neural network with small-world topology and another one composed of small-world subnetworks. The neuron dynamics is described by the Rulkov map, which is a two-dimensional map that has been used to model chaotic bursting neurons. We show that with the use of spatial RQA, it is possible to identify groups of synchronised neurons and determine their size. For the single network, we obtain an analytical expression for the spatial recurrence rate using a Gaussian approximation. In clustered networks, the spatial RQA allows the identification of phase synchronisation among neurons within and between the subnetworks. Our results imply that RQA can serve as a useful tool for studying phase synchronisation even in networks of networks.
RESUMEN
This work concerns analytical results on the role of coupling strength in the phenomenon of onset of complete frequency locking in power-grids modelled as a network of second-order Kuramoto oscillators. Those results allow estimation of the coupling strength for the onset of complete frequency locking and to assess the features of network and oscillators that favor synchronization. The analytical results are evaluated using an order parameter defined as the normalized sum of absolute values of phase deviations of the oscillators over time. The investigation of the frequency synchronization within the subsets of the parameter space involved in the synchronization problem is also carried out. It is shown that the analytical results are in good agreement with those observed in the numerical simulations. In order to illustrate the methodology, a case study is presented, involving the Brazilian high-voltage transmission system under a load peak condition to study the effect of load on the syncronizability of the grid. The results show that both the load and the centralized generation might have concurred to the 2014 blackout.
RESUMEN
We present a new framework to the formulation of the problem of isochronal synchronization for networks of delay-coupled oscillators. Using a linear transformation to change coordinates of the network state vector, this method allows straightforward definition of the error system, which is a critical step in the formulation of the synchronization problem. The synchronization problem is then solved on the basis of Lyapunov-Krasovskii theorem. Following this approach, we show how the error system can be defined such that its dimension can be the same as (or smaller than) that of the network state vector.
RESUMEN
Solar systems complexity, multiscale, and nonlinearity are governed by numerous and continuous changes where the sun magnetic fields can successfully represent many of these phenomena. Thus, nonlinear tools to study these challenging systems are required. The dynamic system recurrence approach has been successfully used to deal with this kind challenge in many scientific areas, objectively improving the recognition of state changes, randomness, and degrees of complexity that are not easily identified by traditional techniques. In this work we introduce the use of these techniques in photospheric magnetogram series. We employ a combination of recurrence quantification analysis with a preprocessing denoising wavelet analysis to characterize the complexity of the magnetic flux emergence in the solar photosphere. In particular, with the developed approach, we identify regions of evolving magnetic flux and where they present a large degree of complexity, i.e., where predictability is low, intermittence is high, and low organization is present.
RESUMEN
We develop a prototypical stochastic model for a local search around a given home. The stochastic dynamic model is motivated by experimental findings of the motion of a fruit fly around a given spot of food but will generally describe the local search behavior. The local search consists of a sequence of two epochs. In the first the searcher explores new space around the home, whereas it returns to the home during the second epoch. In the proposed two-dimensional model both tasks are described by the same stochastic dynamics. The searcher moves with constant speed and its angular dynamics is driven by a symmetric α-stable noise source. The latter stands for the uncertainty to decide the new direction of motion. The main ingredient of the model is the nonlinear interaction dynamics of the searcher with its home. In order to determine the new heading direction, the searcher has to know the actual angles of its position to the home and of the heading vector. A bound state to the home is realized by a permanent switch of a repulsive and attractive forcing of the heading direction from the position direction corresponding to search and return epochs. Our investigation elucidates the analytic tractability of the deterministic and stochastic dynamics. Noise transforms the conservative deterministic dynamics into a dissipative one of the moments. The noise enables a faster finding of a target distinct from the home with optimal intensity. This optimal situation is related to the noise-dependent relaxation time. It is uniquely defined for all α and distinguishes between the stochastic dynamics before and after its value. For times large compared to this, we derive the corresponding Smoluchowski equation and find diffusive spreading of the searcher in the space. We report on the qualitative agreement with the experimentally observed spatial distribution, noisy oscillatory return times, and spatial autocorrelation function of the fruit fly. However, as a result of its simplicity, the model aims to reproduce the local search behavior of other units during their exploration of surrounding space and their quasiperiodic return to a home.
RESUMEN
The characterization of neuronal connectivity is one of the most important matters in neuroscience. In this work, we show that a recently proposed informational quantity, the causal mutual information, employed with an appropriate methodology, can be used not only to correctly infer the direction of the underlying physical synapses, but also to identify their excitatory or inhibitory nature, considering easy to handle and measure bivariate time series. The success of our approach relies on a surprising property found in neuronal networks by which nonadjacent neurons do "understand" each other (positive mutual information), however, this exchange of information is not capable of causing effect (zero transfer entropy). Remarkably, inhibitory connections, responsible for enhancing synchronization, transfer more information than excitatory connections, known to enhance entropy in the network. We also demonstrate that our methodology can be used to correctly infer directionality of synapses even in the presence of dynamic and observational Gaussian noise, and is also successful in providing the effective directionality of intermodular connectivity, when only mean fields can be measured.
RESUMEN
OBJECTIVE: We consider a network topology according to the cortico-cortical connection network of the human brain, where each cortical area is composed of a random network of adaptive exponential integrate-and-fire neurons. APPROACH: Depending on the parameters, this neuron model can exhibit spike or burst patterns. As a diagnostic tool to identify spike and burst patterns we utilise the coefficient of variation of the neuronal inter-spike interval. MAIN RESULTS: In our neuronal network, we verify the existence of spike and burst synchronisation in different cortical areas. SIGNIFICANCE: Our simulations show that the network arrangement, i.e. its rich-club organisation, plays an important role in the transition of the areas from desynchronous to synchronous behaviours.
Asunto(s)
Modelos Neurológicos , Red Nerviosa/fisiología , Humanos , Potenciales de la Membrana , Red Nerviosa/citología , Neuronas/citologíaRESUMEN
In this work, the possible chaotic nature of the atmospheric turbulence above a densely forested area in the Amazon region is investigated. To this end, we use high-resolution temperature data obtained during a micrometeorological measurement campaign in the Brazilian Amazonia. Estimates of the correlation dimension (D(2)=3.50+/-0.05) and of the largest Lyapunov exponent (lambda(1)=0.050+/-0.002) suggest the existence of chaos in the atmospheric boundary layer. Our findings indicate that this low-dimensional chaotic dynamics is associated with the presence of the coherent structures within the boundary layer right above the canopy top and not with the atmospheric turbulence per se, as previously claimed.