Theory of population coupling and applications to describe high order correlations in large populations of interacting neurons
arXiv:1602.08299 · doi:10.1088/1742-5468/aa5dc8
Abstract
To understand the collective spiking activity in neuronal populations, it is essential to reveal basic circuit variables responsible for these emergent functional states. Here, I develop a mean field theory for the population coupling recently proposed in the studies of visual cortex of mouse and monkey, relating the individual neuron activity to the population activity, and extend the original form to the second order, relating neuron-pair's activity to the population activity, to explain the high order correlations observed in the neural data. I test the computational framework on the salamander retinal data and the cortical spiking data of behaving rats. For the retinal data, the original form of population coupling and its advanced form can explain a significant fraction of two-cell correlations and three-cell correlations, respectively. For the cortical data, the performance becomes much better, and the second order population coupling reveals non-local effects in local cortical circuits.
arXiv comment14 pages, 8 figures, Journal of Statistical Mechanics: Theory and Experiment (in press)
References in corpus (13)
- Weak pairwise correlations imply strongly correlated network states in a neural population
- The Bethe lattice spin glass revisited
- Searching for collective behavior in a network of real neurons
- Statistical physics of pairwise probability models
- The simplest maximum entropy model for collective behavior in a neural network
- Adaptive cluster expansion for the inverse Ising problem: convergence, algorithm and tests
- Statistical modelling of higher-order correlations in pools of neural activity
- A tractable method for describing complex couplings between neurons and population rate
- Effects of hidden nodes on network structure inference
- Clustering of neural codewords revealed by a first-order phase transition
- Cavity approach to the Sourlas code system
- Counting solutions from finite samplings
- Sparse Hopfield network reconstruction with regularization