Reconstruction of a neural network from a time series of firing rates

Network structure from a characterization of interactions in complex systems

Many natural and man-made complex dynamical systems can be represented by networks with vertices representing system units and edges the coupling between vertices. If edges of such a structural network are inaccessible, a widely used approach is to identify them with interactions between vertices, thereby setting up a functional network. However, it is an unsolved issue if and to what extent important properties of a functional network on the global and the local scale match those of the corresponding structural network. We address this issue by deriving functional networks from characterizing interactions in paradigmatic oscillator networks with widely-used time-series-analysis techniques for various factors that alter the collective network dynamics. Surprisingly, we find that particularly key constituents of functional networks—as identified with betweenness and eigenvector centrality—coincide with ground truth to a high degree, while global topological and spectral properties—clustering coefficient, average shortest path length, assortativity, and synchronizability—clearly deviate. We obtain similar concurrences for an empirical network. Our findings are of relevance for various scientific fields and call for conceptual and methodological refinements to further our understanding of the relationship between structure and function of complex dynamical systems.

Inferring the connectivity of coupled chaotic oscillators using Kalman filtering

Inferring the interactions between coupled oscillators is a significant open problem in complexity science, with multiple interdisciplinary applications. While the Kalman filter (KF) technique is a well-known tool, widely used for data assimilation and parameter estimation, to the best of our knowledge, it has not yet been used for inferring the connectivity of coupled chaotic oscillators. Here we demonstrate that KF allows reconstructing the interaction topology and the coupling strength of a network of mutually coupled Rössler-like chaotic oscillators. We show that the connectivity can be inferred by considering only the observed dynamics of a single variable of the three that define the phase space of each oscillator. We also show that both the coupling strength and the network architecture can be inferred even when the oscillators are close to synchronization. Simulation results are provided to show the effectiveness and applicability of the proposed method.

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.

Impact of local network characteristics on network reconstruction

When a network is inferred from data, two types of errors can occur: false positive and false negative conclusions about the presence of links. We focus on the influence of local network characteristics on the probability α of false positive conclusions, and on the probability β of false negative conclusions, in the case of networks of coupled oscillators. We demonstrate that false conclusion probabilities are influenced by local connectivity measures such as the shortest path length and the detour degree, which can also be estimated from the inferred network when the true underlying network is not known a priori. These measures can then be used for quantification of the confidence level of link conclusions, and for improving the network reconstruction via advanced concepts of link weights thresholding.

Reconstructing dynamical networks via feature ranking

Empirical data on real complex systems are becoming increasingly available. Parallel to this is the need for new methods of reconstructing (inferring) the structure of networks from time-resolved observations of their node-dynamics. The methods based on physical insights often rely on strong assumptions about the properties and dynamics of the scrutinized network. Here, we use the insights from machine learning to design a new method of network reconstruction that essentially makes no such assumptions. Specifically, we interpret the available trajectories (data) as "features" and use two independent feature ranking approaches-Random Forest and RReliefF-to rank the importance of each node for predicting the value of each other node, which yields the reconstructed adjacency matrix. We show that our method is fairly robust to coupling strength, system size, trajectory length, and noise. We also find that the reconstruction quality strongly depends on the dynamical regime.

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.

Inferring directed networks using a rank-based connectivity measure

Inferring the topology of a network using the knowledge of the signals of each of the interacting units is key to understanding real-world systems. One way to address this problem is using data-driven methods like cross-correlation or mutual information. However, these measures lack the ability to distinguish the direction of coupling. Here, we use a rank-based nonlinear interdependence measure originally developed for pairs of signals. This measure not only allows one to measure the strength but also the direction of the coupling. Our results for a system of coupled Lorenz dynamics show that we are able to consistently infer the underlying network for a subrange of the coupling strength and link density. Furthermore, we report that the addition of dynamical noise can benefit the reconstruction. Finally, we show an application to multichannel electroencephalographic recordings from an epilepsy patient.

Analytical approach to network inference: Investigating degree distribution

When the network is reconstructed, two types of errors can occur: false positive and false negative errors about the presence or absence of links. In this paper, the influence of these two errors on the vertex degree distribution is analytically analyzed. Moreover, an analytic formula of the density of the biased vertex degree distribution is found. In the inverse problem, we find a reliable procedure to reconstruct analytically the density of the vertex degree distribution of any network based on the inferred network and estimates for the false positive and false negative errors based on, e.g., simulation studies.

Robustness and versatility of a nonlinear interdependence method for directional coupling detection from spike trains

The detection of directional couplings between dynamics based on measured spike trains is a crucial problem in the understanding of many different systems. In particular, in neuroscience it is important to assess the connectivity between neurons. One of the approaches that can estimate directional coupling from the analysis of point processes is the nonlinear interdependence measure L. Although its efficacy has already been demonstrated, it still needs to be tested under more challenging and realistic conditions prior to an application to real data. Thus, in this paper we use the Hindmarsh-Rose model system to test the method in the presence of noise and for different spiking regimes. We also examine the influence of different parameters and spike train distances. Our results show that the measure L is versatile and robust to various types of noise, and thus suitable for application to experimental data.

Reconstructing networks of pulse-coupled oscillators from spike trains

We present an approach for reconstructing networks of pulse-coupled neuronlike oscillators from passive observation of pulse trains of all nodes. It is assumed that units are described by their phase response curves and that their phases are instantaneously reset by incoming pulses. Using an iterative procedure, we recover the properties of all nodes, namely their phase response curves and natural frequencies, as well as strengths of all directed connections.

Reconstructing links in directed networks from noisy dynamics

We address the long-standing challenge of how to reconstruct links in directed networks from measurements, and present a general method that makes use of a noise-induced relation between network structure and both the time-lagged covariance of measurements taken at two different times and the covariance of measurements taken at the same time. When the coupling functions have certain additional properties, we can further reconstruct the weights of the links.

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

We propose a method for the recovery of coupling architecture and the parameters of elements in networks consisting of coupled oscillators described by delay-differential equations. For each oscillator in the network, we introduce an objective function characterizing the distance between the points of the reconstructed nonlinear function. The proposed method is based on the minimization of this objective function and the separation of the recovered coupling coefficients into significant and insignificant coefficients. The efficiency of the method is shown for chaotic time series generated by model equations of diffusively coupled time-delay systems and for experimental chaotic time series gained from coupled electronic oscillators with time-delayed feedback.