Recovery of couplings and parameters of elements in networks of time-delay systems from time series

Quasinormal Forms for Chains of Coupled Logistic Equations with Delay

In this paper, chains of coupled logistic equations with delay are considered, and the local dynamics of these chains is investigated. A basic assumption is that the number of elements in the chain is large enough. This implies that the study of the original systems can be reduced to the study of a distributed integro–differential boundary value problem that is continuous with respect to the spatial variable. Three types of couplings of greatest interest are considered: diffusion, unidirectional, and fully connected. It is shown that the critical cases in the stability of the equilibrium state have an infinite dimension: infinitely many roots of the characteristic equation tend to the imaginary axis as the small parameter tends to zero, which characterizes the inverse of the number of elements of the chain. In the study of local dynamics in cases close to critical, analogues of normal forms are constructed, namely quasinormal forms, which are boundary value problems of Ginzburg–Landau type or, as in the case of fully connected systems, special nonlinear integro–differential equations. It is shown that the nonlocal solutions of the obtained quasinormal forms determine the principal terms of the asymptotics of solutions to the original problem from a small neighborhood of the equilibrium state.

Reconstructing distant interactions of multiple paths between perceptible nodes in dark networks

Quantitative research of interdisciplinary fields, including biological and social systems, has attracted great attention in recent years. Complex networks are popular and important tools for the investigations. Explosively increasing data are created by practical networks, from which useful information about dynamic networks can be extracted. From data to network structure, i.e., network reconstruction, is a crucial task. There are many difficulties in fulfilling network reconstruction, including data shortage (existence of hidden nodes) and time delay for signal propagation between adjacent nodes. In this paper a deep network reconstruction method is proposed, which can work in the conditions that even only two nodes (say A and B) are perceptible and all other network nodes are hidden. With a well-designed stochastic driving on node A, this method can reconstruct multiple interaction paths from A to B based on measured data. The distance, effective intensity, and transmission time delay of each path can be inferred accurately.

Noise robust approach to reconstruction of van der Pol-like oscillators and its application to Granger causality

Van der Pol oscillators and their generalizations are known to be a fundamental model in the theory of oscillations and their applications. Many objects of a different nature can be described using van der Pol-like equations under some circumstances; therefore, methods of reconstruction of such equations from experimental data can be of significant importance for tasks of model verification, indirect parameter estimation, coupling analysis, system classification, etc. The previously reported techniques were not applicable to time series with large measurement noise, which is usual in biological, climatological, and many other experiments. Here, we present a new approach based on the use of numerical integration instead of the differentiation and implicit approximation of a nonlinear dissipation function. We show that this new technique can work for noise levels up to 30% by standard deviation from the signal for different types of autonomous van der Pol-like systems and for ensembles of such systems, providing a new approach to the realization of the Granger-causality idea.

Exploring node interaction relationship in complex networks by using high-frequency signal injection

Many practical systems can be described by complex networks. These networks produce, day and night, rich data which can be used to extract information from the systems. Often, output data of some nodes in the networks can be successfully measured and collected while the structures of networks producing these data are unknown. Thus, revealing network structures by analyzing available data, referred to as network reconstruction, turns to be an important task in many realistic problems. Limitation of measurable data is a very common challenge in network reconstruction. Here we consider an extreme case, i.e., we can only measure and process the data of a pair of nodes in a large network, and the task is to explore the relationship between these two nodes while all other nodes in the network are hidden. A driving-response approach is proposed to do so. By loading a high-frequency signal to a node (defined as node A), we can measure data of the partner node (node B), and work out the connection structure, such as the distance from node A to node B and the effective intensity of interaction from A to B, with the data of node B only. A systematical smoothing technique is suggested for treating noise problem. The approach has practical significance.

Simulating Dynamics of Circulation in the Awake State and Different Stages of Sleep Using Non-autonomous Mathematical Model With Time Delay

We propose a mathematical model of the human cardiovascular system. The model allows one to simulate the main heart rate, its variability under the influence of the autonomic nervous system, breathing process, and oscillations of blood pressure. For the first time, the model takes into account the activity of the cerebral cortex structures that modulate the autonomic control loops of blood circulation in the awake state and in various stages of sleep. The adequacy of the model is demonstrated by comparing its time series with experimental records of healthy subjects in the SIESTA database. The proposed model can become a useful tool for studying the characteristics of the cardiovascular system dynamics during sleep.

Transfer entropies within dynamical effects framework

Transfer entropy (TE) is widely used in time-series analysis to detect causal couplings between temporally evolving objects. As a coupling strength quantifier, the TE alone often seems insufficient, raising the question of its further interpretations. Here the TE is related to dynamical causal effects (DCEs) which quantify long-term responses of a coupling recipient to variations in a coupling source or in a coupling itself: Detailed relationships are established for a paradigmatic stochastic dynamical system of bidirectionally coupled linear overdamped oscillators, their practical applications and possible extensions are discussed. It is shown that two widely used versions of the TE (original and infinite-history) can become qualitatively distinct, diverging to different long-term DCEs.

Reconstruction of parameters and unobserved variables of a semiconductor laser with optical feedback from intensity time series

We propose a method for the reconstruction of time-delayed feedback systems having unobserved variables from scalar time series. The method is based on the modified initial condition approach, which allows one to significantly reduce the number of starting guesses for an unobserved variable with a time delay. The proposed method is applied to the reconstruction of the Lang-Kobayashi equations, which describe the dynamics of a single-mode semiconductor laser with external optical feedback. We consider the case where only the time series of laser intensity is observable and the other two variables of the model are hidden. The dependence of the quality of the system reconstruction on the accuracy of assignment of starting guesses for unobserved variables and unknown laser parameters is studied. The method could be used for testing the security of information transmission in laser-based chaotic communication systems.

Reconstruction of dynamic networks with time-delayed interactions in the presence of fast-varying noises

Most complex social, biological and technological systems can be described by dynamic networks. Reconstructing network structures from measurable data is a fundamental problem in almost all interdisciplinary fields. Network nodes interact with each other and those interactions often have diversely distributed time delays. Accurate reconstruction of any targeted interaction to a node requires measured data of all its neighboring nodes together with information on the time delays of interactions from these neighbors. When networks are large, these data are often not available and time-delay factors are deeply hidden. Here we show that fast-varying noise can be of great help in solving these challenging problems. By computing suitable correlations, we can infer the intensity and time delay of any targeted interaction with the data of two related nodes (driving and driven nodes) only while all other nodes in the network are hidden. This method is analytically derived and fully justified by extensive numerical simulations.