Lengths of Attractors and Transients in Neuronal Networks with Random Connectivities
DOI10.1137/140996045zbMath1336.05116arXiv1404.5536OpenAlexW1789591954MaRDI QIDQ2806179
Publication date: 17 May 2016
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1404.5536
neuronal networkrefractory periodBoolean networkErdős-Rényi random graphcomplex regimelength of attractorlength of transientphase tradition
Random graphs (graph-theoretic aspects) (05C80) Neural biology (92C20) Directed graphs (digraphs), tournaments (05C20) Combinatorics and topology in relation with holomorphic dynamical systems (37F20) Systems biology, networks (92C42)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Phase-locked trajectories for dynamical systems on graphs
- Digraphs vs. dynamics in discrete models of neuronal networks
- Analyzing neuronal networks using discrete-time dynamics
- Minimal attractors in digraph system models of neuronal networks
- Reducing neuronal networks to discrete dynamics
- Lengths of Attractors and Transients in Neuronal Networks with Random Connectivities
- Disease Transmission Dynamics on Networks
- Birth of a Strongly Connected Giant in an Inhomogeneous Random Digraph
- The transitive closure of a random digraph
- Neural networks and physical systems with emergent collective computational abilities.
- Excitable Nodes on Random Graphs: Relating Dynamics to Network Structure
This page was built for publication: Lengths of Attractors and Transients in Neuronal Networks with Random Connectivities