Inferring the connectivity of coupled oscillators from event timing analysis
View/Open
Chaos-Masoller.pdf (2,490Mb) (Restricted access)
Request copy
Què és aquest botó?
Aquest botó permet demanar una còpia d'un document restringit a l'autor. Es mostra quan:
- Disposem del correu electrònic de l'autor
- El document té una mida inferior a 20 Mb
- Es tracta d'un document d'accés restringit per decisió de l'autor o d'un document d'accés restringit per política de l'editorial
Cita com:
hdl:2117/407844
Document typeArticle
Defense date2024-05
PublisherElsevier
Rights accessRestricted access - publisher's policy
(embargoed until 2026-05-31)
This work is protected by the corresponding intellectual and industrial property rights.
Except where otherwise noted, its contents are licensed under a Creative Commons license
:
Attribution-NonCommercial-NoDerivs 4.0 International
Abstract
Understanding the coupling structure of interacting systems is an important open problem, and many methods have been proposed to reconstruct a network from observed data. Most require continuous observation of the nodes’ dynamics; however, in many situations, we can only monitor the times when some events occur (e.g., in neural systems, spike times). Here, we propose a method for network reconstruction based on the analysis of event times at the network’s nodes. First, from the event times, we generate phase time series. Then, we assimilate the phase time series to the Kuramoto model by using the unscented Kalman filter (UKF) that returns the inferred coupling coefficients. Finally, we use a clustering algorithm to discriminate the coupling coefficients into two groups that we associate with existing and non-existing links. We demonstrate the method with synthetic data from small networks of Izhikevich neurons, where we analyze the spike times, and with experimental data from a larger network of chaotic electronic circuits, where the events are voltage threshold-crossings. We also compare the UKF with the performance of the cross-correlation (CC), and the mutual information (MI). We show that, for neural network reconstruction, UKF often outperforms CC and MI, while for electronic network reconstruction, UKF shows similar performance to MI, and both methods outperform CC. Altogether, our results suggest that when event times are the only information available, the UKF can give a good reconstruction of small networks. However, as the network size increases, the method becomes computationally demanding.
CitationAristides, R. [et al.]. Inferring the connectivity of coupled oscillators from event timing analysis. "Chaos, solitons & fractals", Maig 2024, vol. 182, núm. article 114837.
ISSN1873-2887
Files | Description | Size | Format | View |
---|---|---|---|---|
Chaos-Masoller.pdf![]() | 2,490Mb | Restricted access |