Year: 2022
Type: article
Abstract: Combinatorial threshold-linear networks (CTLNs) are a special class of inhibition-dominated TLNs defined from directed graphs. Like more general TLNs, they display a wide variety of nonlinear dynamics including multistability, limit cycles, quasiperiodic attractors, and chaos. In prior work, we have developed a detailed mathematical theory relating stable and unstable fixed points of CTLNs to graph-theoretic properties of the underlying network. Here we find that a special type of fixed points, corresponding to core motifs, are predictive of both static and dynamic attractors. Moreover, the attractors can be found by choosing initial conditions that are small perturbations of these fixed points. This motivates us to hypothesize that dynamic attractors of a network correspond to unstable fixed points supported on core motifs. We tested this hypothesis on a large family of directed graphs of size n = 5, and found remarkable agreement. Furthermore, we discovered that core motifs with similar embeddings give rise to nearly identical attractors. This allowed us to classify attractors based on structurally-defined graph families. Our results suggest that graphical properties of the connectivity can be used to predict a network's complex repertoire of nonlinear dynamics.
Source: PLoS ONE
Language: English
Subfield: Computer Networks and Communications
Field: Computer Science
Domain: Physical Sciences
Open Access status: gold
Estimated APC paid: $1,805
Awards: G1235099019, Emergent dynamics from network connectivity: a minimal model, G1963745658, Collaborative Research: Emergent Sequences in Inhibition-Dominated Recurrent Networks, Collaborative Research: Emergent Sequences in Inhibition-Dominated Recurrent Networks, G5520316217, CRCNS: Circuit dynamics in zebrafish larvae: mechanisms, modulation, and mathematical modeling of network topology and attractor dynamics
OpenAlex ID: W3198788718