Degree assortativity in networks of spiking neurons

From MaRDI portal
Publication:2194430



Abstract: Degree assortativity refers to the increased or decreased probability of connecting two neurons based on their in- or out-degrees, relative to what would be expected by chance. We investigate the effects of such assortativity in a network of theta neurons. The Ott/Antonsen ansatz is used to derive equations for the expected state of each neuron, and these equations are then coarse-grained in degree space. We generate families of effective connectivity matrices parametrised by assortativity coefficient and use SVD decompositions of these to efficiently perform numerical bifurcation analysis of the coarse-grained equations. We find that of the four possible types of degree assortativity, two have no effect on the networks' dynamics, while the other two can have a significant effect.












This page was built for publication: Degree assortativity in networks of spiking neurons

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2194430)