Logo do repositório

Inferring the connectivity of coupled oscillators from event timing analysis

dc.contributor.authorAristides, Raul P. [UNESP]
dc.contributor.authorCerdeira, Hilda A. [UNESP]
dc.contributor.authorMasoller, Cristina
dc.contributor.authorTirabassi, Giulio
dc.contributor.institutionUniversidade Estadual Paulista (UNESP)
dc.contributor.institutionGomez & Gomez Ltda. ME
dc.contributor.institutionUniversitat Politecnica de Catalunya
dc.date.accessioned2025-04-29T18:48:00Z
dc.date.issued2024-05-01
dc.description.abstractUnderstanding 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.en
dc.description.affiliationInstituto de Física Teórica Universidade Estadual Paulista, R. Dr. Bento Teobaldo Ferraz, 271 - Várzea da Barra Funda
dc.description.affiliationEpistemic Gomez & Gomez Ltda. ME, Rua Paulo Franco 520, Vila Leopoldina
dc.description.affiliationDepartament de Fisica Universitat Politecnica de Catalunya, Rambla St. Nebridi, 22, Barcelona
dc.description.affiliationUnespInstituto de Física Teórica Universidade Estadual Paulista, R. Dr. Bento Teobaldo Ferraz, 271 - Várzea da Barra Funda
dc.description.sponsorshipMinisterio de Ciencia e Innovación
dc.description.sponsorshipCoordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
dc.description.sponsorshipFundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
dc.description.sponsorshipICTP South American Institute for Fundamental Research
dc.description.sponsorshipIdCAPES: 001
dc.description.sponsorshipIdFAPESP: 2021/11754-2
dc.description.sponsorshipIdICTP South American Institute for Fundamental Research: 2021/14335-0
dc.identifierhttp://dx.doi.org/10.1016/j.chaos.2024.114837
dc.identifier.citationChaos, Solitons and Fractals, v. 182.
dc.identifier.doi10.1016/j.chaos.2024.114837
dc.identifier.issn0960-0779
dc.identifier.scopus2-s2.0-85190134531
dc.identifier.urihttps://hdl.handle.net/11449/299869
dc.language.isoeng
dc.relation.ispartofChaos, Solitons and Fractals
dc.sourceScopus
dc.subjectKalman filters
dc.subjectNetwork inference
dc.subjectTime series analysis
dc.titleInferring the connectivity of coupled oscillators from event timing analysisen
dc.typeArtigopt
dspace.entity.typePublication
unesp.author.orcid0000-0002-0255-2293 0000-0002-0255-2293[1]
unesp.author.orcid0000-0003-4805-4668 0000-0003-4805-4668[2]
unesp.author.orcid0000-0003-0768-2019[3]
unesp.author.orcid0000-0002-8028-9005[4]
unesp.campusUniversidade Estadual Paulista (UNESP), Instituto de Física Teórica, São Paulopt

Arquivos