Ten theorems about threshold-linear networks

Threshold-linear networks (TLNs) are popular firing rate models of recurrent networks. They have been used to model associative memory, decision-making, and position coding in cortical and hippocampal networks. Unlike rate models with other choices of nonlinearity, TLNs are piecewise linear, making them more amenable to mathematical analysis. In this talk I will present ten theorems about TLNs from the past five years. Many of these theorems connect the fixed points of a network to the structure of an underlying connectivity graph. These results have enabled us to develop graph rules to predict both static and dynamic attractors from network motifs. The theorems will be complemented with examples that illustrate how the mathematical results can be used to analyze and design recurrent networks that support a rich variety of computations and dynamics. Examples include internally-generated sequences, neural integrators, and central pattern generator circuits.