Dynamic Bayesian networks for neural information flow: evaluation of continuous and discrete scoring metrics
- 1School of Biology, University of St Andrews, St Andrews, Scotland
- 2School of Psychology and Neuroscience, University of St Andrews, St Andrews, Scotland
- 3Institute of Behavioural and Neural Sciences, University of St Andrews, St Andrews, Scotland
Abstract
Neural information flow describes the movement of activity between neurons or brain areas. Advances in experimental methods have allowed production of large amounts of observational data related to neuronal activity from the single-neuron to population level. Most current methods for analysing these data are based on pairwise comparison of activity, and fall short of reliably extracting neural information flow network structure. Dynamic Bayesian networks may overcome some of these limitations. Here we evaluate the performance of a range of Bayesian network scoring metrics against the performance of multivariate Granger causality and LASSO regression for their ability to learn the connectivity underlying simulated single-neuron and neuronal population data. We find that discrete dynamic Bayesian networks are the best performing method for single-neuron data, and perform consistently for neural-population data. Continuous dynamic Bayesian networks have a tendency to learn overly dense structures for both data types, but may have utility in scoping studies on single-neuron data. Multivariate Granger causality is the most robust method for learning structure of neural information flow between neural-populations, but performs poorly on single-neuron data. Significance testing within multivariate Granger causality produces variable results between data types. Overall, this work highlights how the analysis of neural information flow can vary depending on the type and structure of underlying data, and promotes discrete dynamic Bayesian networks as a useful and consistent tool for neural information flow analysis.
Supplementary Information: The online version contains supplementary material available at https://doi.org/10.1007/s10827-026-00945-6.
Related
- Evaluation of the high-quality development of graduate education in mining engineering based on ISM and Bayesian networks
- Clustering without clusters: the meta-criterion and centroid reliability mistake continuous dynamics for discrete states
- Clustering without clusters: the meta-criterion and centroid reliability mistake continuous dynamics for discrete states
- Continuous monitoring of deficit irrigation in avocado across two contrasting rainfall years using sensor networks, telemetry, and machine learning
- An information-borrowing Bayesian method for inferring high-dimensional population-level brain connectivity from small samples
BibTeX
@article{thomashegarty2026dynamic,
title = {{Dynamic Bayesian networks for neural information flow: evaluation of continuous and discrete scoring metrics}},
author = {Jacob Thomas-Hegarty and Stefan R. Pulver and V Anne Smith},
journal = {Journal of Computational Neuroscience},
year = {2026},
month = jul,
doi = {10.1007/s10827-026-00945-6},
url = {https://doi.org/10.1007/s10827-026-00945-6},
note = {CC BY 4.0},
}
RIS
TY - JOUR
TI - Dynamic Bayesian networks for neural information flow: evaluation of continuous and discrete scoring metrics
AU - Jacob Thomas-Hegarty
AU - Stefan R. Pulver
AU - V Anne Smith
PY - 2026
DA - 2026/07/28
JO - Journal of Computational Neuroscience
DO - 10.1007/s10827-026-00945-6
UR - https://doi.org/10.1007/s10827-026-00945-6
AB - Neural information flow describes the movement of activity between neurons or brain areas. Advances in experimental methods have allowed production of large amounts of observational data related to neuronal activity from the single-neuron to population level. Most current methods for analysing these data are based on pairwise comparison of activity, and fall short of reliably extracting neural information flow network structure. Dynamic Bayesian networks may overcome some of these limitations. Here we evaluate the performance of a range of Bayesian network scoring metrics against the performance of multivariate Granger causality and LASSO regression for their ability to learn the connectivity underlying simulated single-neuron and neuronal population data. We find that discrete dynamic Bayesian networks are the best performing method for single-neuron data, and perform consistently for neural-population data. Continuous dynamic Bayesian networks have a tendency to learn overly dense structures for both data types, but may have utility in scoping studies on single-neuron data. Multivariate Granger causality is the most robust method for learning structure of neural information flow between neural-populations, but performs poorly on single-neuron data. Significance testing within multivariate Granger causality produces variable results between data types. Overall, this work highlights how the analysis of neural information flow can vary depending on the type and structure of underlying data, and promotes discrete dynamic Bayesian networks as a useful and consistent tool for neural information flow analysis. Supplementary Information: The online version contains supplementary material available at https://doi.org/10.1007/s10827-026-00945-6.
SN - 0929-5313
SN - 1573-6873
ER -