Minimal attractors in digraph system models of neuronal networks

We study a class of discrete dynamical systems models of neuronal networks. In these models, each neuron is represented by a finite number of states and there are rules for how a neuron transitions from one state to another. In particular, the rules determine when a neuron fires and how this affects the state of other neurons. In an earlier paper [D. Terman, S. Ahn, X. Wang, W. Just, Reducing neuronal networks to discrete dynamics, Physica D 237 (2008) 324–338], we demonstrate that a general class of excitatory–inhibitory networks can, in fact, be rigorously reduced to the discrete model. In the present paper, we analyze how the connectivity of the network influences the dynamics of the discrete model. For randomly connected networks, we find two major phase transitions. If the connection probability is above the second but below the first phase transition, then starting in a generic initial state, most but not all cells will fire at all times along the trajectory as soon as they reach the end of their refractory period. Above the first phase transition, this will be true for all cells in a typical initial state; thus most states will belong to a minimal attractor of oscillatory behavior (in a sense that is defined precisely in the paper). The exact positions of the phase transitions depend on intrinsic properties of the cells including the lengths of the cells’ refractory periods and the thresholds for firing. Existence of these phase transitions is both rigorously proved for sufficiently large networks and corroborated by numerical experiments on networks of moderate size.