SearcharxivSearch

arXiv · 1902.03896

Reconstructing dynamical networks via feature ranking

Abstract

Empirical data on real complex systems are becoming increasingly available. Parallel to this is the need for new methods of reconstructing (inferring) the topology 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.

Explore related subjects

Keep this discovery

BibTeXRIS

Marc G. Leguia, Zoran Levnajic, Ljupco Todorovski, Bernard Zenko. 2019-02-11. Reconstructing dynamical networks via feature ranking. https://doi.org/10.1063/1.5092170

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Admissible Fourier Lengths, KAM Reducibility, and Spectral Applications

We develop a perturbative KAM reducibility theory for one-frequency $\mathrm{SL}(2,\mathbb{R})$ cocycles based on an admissible Fourier length $\ell$. The regularity relevant to the iteration is measured by positive adapted Fourier width rather than ordinary smoothness in the Euclidean length $|n|$. The same length governs Fourier decay, truncation and resonance scales, and the arithmetic condition controlling the small divisors. This framework contains the classical analytic and Gevrey settings, while non-monotone choices of $\ell$ allow classical nowhere differentiable Weierstrass-type perturbations and continuous perturbations outside every positive H\"older class. As spectral applications, we obtain purely absolutely continuous spectrum for every phase and $1/2$-H\"older continuity of the integrated density of states for the associated quasiperiodic Schr\"odinger operators. The Aubry dual has pure point spectrum for Lebesgue almost every dual phase, with eigenfunctions exponentially localized in the metric induced by $\ell$. We also construct nowhere differentiable quasiperiodic potentials with purely absolutely continuous Cantor spectrum.

math.DS

Dynamics inside the attracting basins of some skew products

Polynomial skew products in $\mathbb{C}^2$ are maps of the form $F(z,w)=(P(z),Q(z,w))$, where $P$ and $Q$ are polynomials. Their local dynamics have been widely investigated. In this paper, we study the global dynamics inside Fatou components of some skew products. We consider all the inverse images in a Fatou component of a given point and use the Kobayashi metric to measure the distance between points. In the cases we consider, there are always arbitrarily large Kobayashi balls in the complement of these inverse sets.

math.DS

Ergodicity of dynamical systems without uniqueness of orbits

Recently, there has been considerable interest in the study of non-deterministic dynamical systems. To analyze the chaotic behavior of such systems from a measure-theoretic viewpoint, it is desirable to consider ergodicity. However, the classical definition of ergodicity involves invariant sets, whose definition is not unique for non-deterministic dynamical systems. Thus, we are led to the question of which invariance yields an interesting definition of ergodicity. Here, we propose a definition based on the strong backward invariance and show that analogs of classical results hold. We also consider implications of the Birkhoff ergodic theorem for systems without uniqueness of orbits.

math.DS