Comparison of derivative-based and correlation-based methods to estimate effective connectivity in neural networks

被引:0
|
作者
Niklas Laasch [1 ]
Wilhelm Braun [1 ]
Lisa Knoff [1 ]
Jan Bielecki [3 ]
Claus C. Hilgetag [1 ]
机构
[1] University Medical Center Hamburg-Eppendorf,Institute of Computational Neuroscience, Center for Experimental Medicine
[2] Boston University,Department of Health Sciences
[3] Kiel University,Faculty of Engineering
关键词
Computational connectomics; Dynamical systems; Hopf model; Ornstein–Uhlenbeck process; Effective connectivity; Structural connectivity; C. elegans;
D O I
10.1038/s41598-025-88596-y
中图分类号
学科分类号
摘要
Inferring and understanding the underlying connectivity structure of a system solely from the observed activity of its constituent components is a challenge in many areas of science. In neuroscience, techniques for estimating connectivity are paramount when attempting to understand the network structure of neural systems from their recorded activity patterns. To date, no universally accepted method exists for the inference of effective connectivity, which describes how the activity of a neural node mechanistically affects the activity of other nodes. Here, focussing on purely excitatory networks of small to intermediate size and continuous node dynamics, we provide a systematic comparison of different approaches for estimating effective connectivity. Starting with the Hopf neuron model in conjunction with known ground truth structural connectivity, we reconstruct the system’s connectivity matrix using a variety of algorithms. We show that, in sparse non-linear networks with delays, combining a lagged-cross-correlation (LCC) approach with a recently published derivative-based covariance analysis method provides the most reliable estimation of the known ground truth connectivity matrix. We outline how the parameters of the Hopf model, including those controlling the bifurcation, noise, and delay distribution, affect this result. We also show that in linear networks, LCC has comparable performance to a method based on transfer entropy, at a drastically lower computational cost. We highlight that LCC works best for small sparse networks, and show how performance decreases in larger and less sparse networks. Applying the method to linear dynamics without time delays, we find that it does not outperform derivative-based methods. We comment on this finding in light of recent theoretical results for such systems. Employing the Hopf model, we then use the estimated structural connectivity matrix as the basis for a forward simulation of the system dynamics, in order to recreate the observed node activity patterns. We show that, under certain conditions, the best method, LCC, results in higher trace-to-trace correlations than derivative-based methods for sparse noise-driven systems. Finally, we apply the LCC method to empirical biological data. Choosing a suitable threshold for binarization, we reconstruct the structural connectivity of a subset of the nervous system of the nematode C. elegans. We show that the computationally simple LCC method performs better than another recently published, computationally more expensive reservoir computing-based method. We apply different methods to this dataset and find that they all lead to similar performances. Our results show that a comparatively simple method can be used to reliably estimate directed effective connectivity in sparse neural systems in the presence of spatio-temporal delays and noise. We provide concrete suggestions for the estimation of effective connectivity in a scenario common in biological research, where only neuronal activity of a small set of neurons, but not connectivity or single-neuron and synapse dynamics, are known.
引用
收藏
相关论文
共 50 条
  • [41] Systemic Risk and Trading Strategy Based on Correlation-Based Networks in Stock Markets
    Yu, Jia-Wei
    Huang, Qin-Qin
    Guo, Yong-Han
    Jiang, Zhi-Qiang
    Xie, Wen-Jie
    FLUCTUATION AND NOISE LETTERS, 2020, 19 (03):
  • [42] Correlation-based initialization algorithm for tensor-based HSI compression methods
    Rui Li
    Zhibin Pan
    Yang Wang
    Multimedia Tools and Applications, 2020, 79 : 21925 - 21940
  • [43] Correlation-based initialization algorithm for tensor-based HSI compression methods
    Li, Rui
    Pan, Zhibin
    Wang, Yang
    MULTIMEDIA TOOLS AND APPLICATIONS, 2020, 79 (29-30) : 21925 - 21940
  • [44] An Audio Correlation-Based Graph Neural Network for Depression Recognition
    Sun, Chenjian
    Dong, Yihong
    PATTERN RECOGNITION AND COMPUTER VISION, PRCV 2023, PT VIII, 2024, 14432 : 391 - 403
  • [45] Comparison of function approximation, heuristic, and derivative-based methods for automatic calibration of computationally expensive groundwater bioremediation models
    Mugunthan, P
    Shoemaker, CA
    Regis, RG
    WATER RESOURCES RESEARCH, 2005, 41 (11) : 1 - 17
  • [46] Defocus particle tracking: a comparison of methods based on model functions, cross-correlation, and neural networks
    Barnkob, Rune
    Cierpka, Christian
    Chen, Minqian
    Sachs, Sebastian
    Maeder, Patrick
    Rossi, Massimiliano
    MEASUREMENT SCIENCE AND TECHNOLOGY, 2021, 32 (09)
  • [47] A Survey of Three Derivative-Based Methods to Harvest the Volatility Premium in Equity Markets
    Ge, Wei
    JOURNAL OF INVESTING, 2016, 25 (03): : 48 - 58
  • [48] Data correlation-based analysis methods for automatic memory forensic
    Fu, X.
    Du, X.
    Luo, B.
    SECURITY AND COMMUNICATION NETWORKS, 2015, 8 (18) : 4213 - 4226
  • [49] Cobra: Correlation-based Content Authentication in Wireless Sensor Networks
    Zhuang, Peng
    Shang, Yi
    GLOBECOM 2008 - 2008 IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, 2008,
  • [50] Correlation-based advanced feature analysis for wireless sensor networks
    JongHyuk Kim
    Yong Moon
    Hoon Ko
    The Journal of Supercomputing, 2024, 80 : 9812 - 9828