A mathematical framework for inferring connectivity in probabilistic neuronal networks

Research output: Contribution to journalArticlepeer-review

38 Scopus citations

Abstract

We describe an approach for determining causal connections among nodes of a probabilistic network even when many nodes remain unobservable. The unobservable nodes introduce ambiguity into the estimate of the causal structure. However, in some experimental contexts, such as those commonly used in neuroscience, this ambiguity is present even without unobservable nodes. The analysis is presented in terms of a point process model of a neuronal network, though the approach can be generalized to other contexts. The analysis depends on the existence of a model that captures the relationship between nodal activity and a set of measurable external variables. The mathematical framework is sufficiently general to allow a large class of such models. The results are modestly robust to deviations from model assumptions, though additional validation methods are needed to assess the success of the results.

Original languageEnglish (US)
Pages (from-to)204-251
Number of pages48
JournalMathematical Biosciences
Volume205
Issue number2
DOIs
StatePublished - Feb 1 2007

Keywords

  • Causality
  • Correlations
  • Maximum likelihood
  • Neural networks
  • Point process

Fingerprint Dive into the research topics of 'A mathematical framework for inferring connectivity in probabilistic neuronal networks'. Together they form a unique fingerprint.

Cite this