Abstract

Ising models with simple Markov chain kinetics have been recently introduced as a tool for inferring asymmetric interactions in neuronal networks [1]. In such an approach, one discretizes time and uses the spike pattern at time step t to predict the pattern at time step t+1 and infer the effective interaction between neurons J(i,j) which influences these dynamics. It is however a priori hard to justify that the effect of spikes in only one time bin from the temporal discretization determines the future state of the system. What happens if we use shorter/longer time bins than the characteristic time steps of the network? How do the inferred couplings change if we allow for interactions with memory of multiple past time steps? To answer these questions, we extend the kinetic Ising approach to higher-order Markov chains by introducing time-delayed interactions using (1) a set of couplings derived from scaling the original J(i,j) and (2) an auxiliary set of couplings K(i,j). A model of this sort is closely related to the Generalized Linear Model and its simplicity allows for detailed analysis of the model parameters. We apply this extended kinetic Ising model to two types of data sets: (1) a realizable case of randomly-connected Ising network with memory of past states and (2) a realistic cortical network simulation with cross-correlated Hodgkin-Huxley dynamics [2]. In the first case, we test the accuracy from assuming simple Markov chain kinetics to reconstruct higher-order networks using an exact iterative algorithm and mean-field approximations, such as in [1]. In the second case, we aim to identify true synaptic connections in a sparse network. The results show that, not surprisingly, the quality of inferring connections sharply decays at short and long time bins. The effect of adding memory is different depending on the time bin size and there is an optimal combination of time bin and memory, indicating strong interactions at specific time delays. The left panel in Figure ​Figure11 illustrates connections between 30 neurons out of the original network composed of 500 excitatory neurons and 500 inhibitory neurons. The inferred network using memory is shown in the middle panel. To have stable balanced states, the excitatory connections are somewhat weaker than the inhibitory ones and are harder to detect using a one-step Markov chain. The time-delayed interactions K(i,j) particularly improve the identification of these weak excitatory connections; see the right panel of Figure ​Figure1.1. Furthermore, K(i,j) is in general linearly dependent on J(i,j) when this connection in the original network is excitatory, but they are less correlated when the connection is inhibitory. This demonstrates that the network has multiple characteristic dynamics which cannot be explained by simple kinetic Ising models. Figure 1 Left: Original network with excitatory (red) and inhibitory connections (blue). Middle: Inferred connectivity using kinetic Ising models with memory. Colors mark their connection strengths. Right: Radio operating characteristics (ROC) curves of inferred ... The authors would like to thank John Hertz for providing the key simulations for the cortical column [2].

Highlights

  • Ising models with simple Markov chain kinetics have been recently introduced as a tool for inferring asymmetric interactions in neuronal networks [1]

  • We test the accuracy from assuming simple Markov chain kinetics to reconstruct higher-order networks using an exact iterative algorithm and mean-field approximations, such as in [1]

  • The results show that, not surprisingly, the quality of inferring connections sharply decays at short and long time bins

Read more

Summary

Introduction

Ising models with simple Markov chain kinetics have been recently introduced as a tool for inferring asymmetric interactions in neuronal networks [1]. We apply this extended kinetic Ising model to two types of data sets: (1) a realizable case of randomly-connected Ising network with memory of past states and (2) a realistic cortical network simulation with cross-correlated Hodgkin-Huxley dynamics [2]. We test the accuracy from assuming simple Markov chain kinetics to reconstruct higher-order networks using an exact iterative algorithm and mean-field approximations, such as in [1].

Objectives
Results
Conclusion
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call