The combinatorial code and the graph rules of dale networks
From MaRDI portal
Publication:6660873
DOI10.1137/23M1599069MaRDI QIDQ6660873
Vladimir Itskov, Nikola Milićević
Publication date: 10 January 2025
Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- The neural ring: an algebraic tool for analyzing the intrinsic structure of neural codes
- Obstructions to convexity in neural codes
- Weakly connected neural networks
- On open and closed convex codes
- Flexible memory networks
- Diskrete Räume.
- Selectively Grouping Neurons in Recurrent Networks of Lateral Inhibition
- Permitted and Forbidden Sets in Symmetric Threshold-Linear Networks
- Hierarchical Selective Recruitment in Linear-Threshold Brain Networks—Part I: Single-Layer Dynamics and Selective Inhibition
- Hyperplane Neural Codes and the Polar Complex
- Encoding Binary Neural Codes in Networks of Threshold-Linear Neurons
- Pattern Completion in Symmetric Threshold-Linear Networks
- A No-Go Theorem for One-Layer Feedforward Networks
- What Makes a Neural Code Convex?
- Diversity of emergent dynamics in competitive threshold-linear networks
This page was built for publication: The combinatorial code and the graph rules of dale networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6660873)