Skip to content


  • Poster presentation
  • Open Access

Neuronal connectivity inference from spike trains using an empirical probabilistic causality measure

BMC Neuroscience200910 (Suppl 1) :P169

  • Published:


  • Spike Train
  • Variable Time Delay
  • Spike Time
  • Neuronal Connectivity
  • Probabilistic Connectivity

To fully understand the computational properties of a neural network, it is crucial to know the network's connectivity. Unfortunately, connectivity inference using easily accessible data such as extracellular spike recordings is a difficult task. The difficulty arises mainly from problems related with causality, polysynaptic (indirect) connectivity, inhibition and variable time delays, just to name a few. Different methods have been proposed for connectivity inference using, for example, mutual information [1, 2], partial directed coherence [3], direct neuronal dynamics parameters fitting [4] or parameter estimation using Bayesian approaches [5]. However, we argue that most of these methods are too complex to implement, hard to apply to spike times series or simply do not provide appropriate estimations using benchmark synthetic data.

Here we present an alternative method that takes directly the series of spike times from multiple sources and produces a probabilistic connectivity matrix, wherein each entry provides a confidence level for the existence of a connection (excitatory or inhibitory) for a particular source/target pair. Instead of using measures which are directly or indirectly related to correlations, our method introduces an empirical measure of causality that works on top of spike time probability distributions obtained from the spike times series. This approach allows us to cope with variable time delays, causality, inhibitory connections and provides an estimate for the degree of connection (monosynaptic, disynaptic, etc.). Our method includes heuristics but only one parameter needs to be set: the causality time window. This value defines the maximum time delay between two events that are said to be related and is used to constrain the causality search space.

Our method has been tested using synthetic data from simulations where the neuronal connectivity is known a priori. Two types of neuron models were tested in different network simulations: single-compartment Hodgkin-Huxley model with static synapses and Poisson spiking units modulated by stochastic synapses.



The first author was supported by the Centro de Matemática da Universidade do Porto, financed by FCT through the programs POCTI and POSI, with Portuguese and European Community structural funds.

Authors’ Affiliations

Centro de Matemática da Universidade do Porto, 4169-007 Porto, Portugal
Instituto de Biologia Molecular e Celular, 4150-180 Porto, Portugal
Computer Science Dept., University of Porto, 4169-007 Porto, Portugal


  1. Shiono S, Yamada S, Nakashima M, Matsumoto K: Information theoretic analysis of connection structure from spike trains. Advances in Neural information Processing Systems 5 1992. Edited by: Hanson SJ, Cowan JD, Giles CL. 1993, Morgan Kaufmann Publishers, San Francisco, CA, 515-522.Google Scholar
  2. Bettencourt LM, Stephens GJ, Ham MI, Gross GW: The functional structure of cortical neuronal networks grown in vitro. Phys Rev E. 2007, 75: 021915-10.1103/PhysRevE.75.021915.View ArticleGoogle Scholar
  3. Takahashi DY, Baccalá LA, Sameshima K: Connectivity inference between neural structures via partial directed coherence. Journal of Applied Statistics. 2007, 34: 1259-1273. 10.1080/02664760701593065.View ArticleGoogle Scholar
  4. Makarov VA, Panetsos F, De Feo O: A method for determining neural connectivity and inferring the underlying network dynamics using extracellular spike recordings. J Neurosci Methods. 2005, 144: 265-279.PubMedView ArticleGoogle Scholar
  5. Rajaram S: Poisson networks: a model for structured point processes. AI and Statistics. 2005, 10:Google Scholar


© Aguiar and Rodrigues; licensee BioMed Central Ltd. 2009

This article is published under license to BioMed Central Ltd.