Involve: A Journal of Mathematics

  • Involve
  • Volume 12, Number 5 (2019), 737-754.

Sparse neural codes and convexity

R. Amzi Jeffs, Mohamed Omar, Natchanon Suaysom, Aleina Wachtel, and Nora Youngs

Full-text: Access denied (no subscription detected)

However, an active subscription may be available with MSP at msp.org/involve.

We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber. If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text

Abstract

Determining how the brain stores information is one of the most pressing problems in neuroscience. In many instances, the collection of stimuli for a given neuron can be modeled by a convex set in d. Combinatorial objects known as neural codes can then be used to extract features of the space covered by these convex regions. We apply results from convex geometry to determine which neural codes can be realized by arrangements of open convex sets. We restrict our attention primarily to sparse codes in low dimensions. We find that intersection-completeness characterizes realizable 2-sparse codes, and show that any realizable 2-sparse code has embedding dimension at most 3. Furthermore, we prove that in 2 and 3, realizations of 2-sparse codes using closed sets are equivalent to those with open sets, and this allows us to provide some preliminary results on distinguishing which 2-sparse codes have embedding dimension at most 2.

Article information

Source
Involve, Volume 12, Number 5 (2019), 737-754.

Dates
Received: 26 October 2017
Revised: 24 October 2018
Accepted: 5 December 2018
First available in Project Euclid: 29 May 2019

Permanent link to this document
https://projecteuclid.org/euclid.involve/1559095402

Digital Object Identifier
doi:10.2140/involve.2019.12.737

Mathematical Reviews number (MathSciNet)
MR3954293

Zentralblatt MATH identifier
07072551

Subjects
Primary: 05C62: Graph representations (geometric and intersection representations, etc.) For graph drawing, see also 68R10 52A10: Convex sets in 2 dimensions (including convex curves) [See also 53A04] 92B20: Neural networks, artificial life and related topics [See also 68T05, 82C32, 94Cxx]

Keywords
neural code sparse convexity

Citation

Jeffs, R. Amzi; Omar, Mohamed; Suaysom, Natchanon; Wachtel, Aleina; Youngs, Nora. Sparse neural codes and convexity. Involve 12 (2019), no. 5, 737--754. doi:10.2140/involve.2019.12.737. https://projecteuclid.org/euclid.involve/1559095402


Export citation

References

  • N. Amenta, J. A. De Loera, and P. Soberón, “Helly's theorem: new variations and applications”, pp. 55–95 in Algebraic and geometric methods in discrete mathematics (San Antonio, 2015), edited by H. A. Harrington et al., Contemp. Math. 685, Amer. Math. Soc., Providence, RI, 2017.
  • R. Amzi Jeffs, “Morphisms of neural codes”, preprint, 2018.
  • R. Amzi Jeffs and I. Novik, “Convex union representability and convex codes”, preprint, 2018.
  • A. Chen, F. Frick, and A. Shiu, “Neural codes, decidability, and a new local obstruction to convexity”, SIAM J. Appl. Algebra Geom. 3:1 (2019), 44–66.
  • J. Cruz, C. Giusti, V. Itskov, and B. Kronholm, “On open and closed convex codes”, Discrete Comput. Geom. 61:2 (2019), 247–270.
  • C. Curto, V. Itskov, K. Morrison, Z. Roth, and J. L. Walker, “Combinatorial neural codes from a mathematical coding theory perspective”, Neural Comput. 25:7 (2013), 1891–1925.
  • C. Curto, V. Itskov, A. Veliz-Cuba, and N. Youngs, “The neural ring: an algebraic tool for analyzing the intrinsic structure of neural codes”, Bull. Math. Biol. 75:9 (2013), 1571–1611.
  • C. Curto, E. Gross, J. Jeffries, K. Morrison, M. Omar, Z. Rosen, A. Shiu, and N. Youngs, “What makes a neural code convex?”, SIAM J. Appl. Algebra Geom. 1:1 (2017), 222–238.
  • L. Danzer, B. Grünbaum, and V. Klee, “Helly's theorem and its relatives”, pp. 101–180 in Convexity (Seattle, 1961), edited by V. Klee, Proc. Symp. Pure Math. 7, Amer. Math. Soc., Providence, RI, 1963.
  • J. Eckhoff, “Helly, Radon, and Carathéodory type theorems”, pp. 389–448 in Handbook of convex geometry, A, edited by P. M. Gruber and J. M. Wills, North-Holland, Amsterdam, 1993.
  • D. H. Hubel and T. N. Wiesel, “Receptive fields of single neurons in the cat's striate cortex”, J. Physiology 148:3 (1959), 574–591.
  • C. Lienkaemper, A. Shiu, and Z. Woodstock, “Obstructions to convexity in neural codes”, Adv. Appl. Math. 85 (2017), 31–59.
  • A. C. Lin, A. M. Bygrave, A. de Calignon, T. Lee, and G. Miesenböck, “Sparse, decorrelated odor coding in the mushroom body enhances learned odor discrimination”, Nature Neurosci. 17:4 (2014), 559–568.
  • J. Matoušek, Lectures on discrete geometry, Graduate Texts in Math. 212, Springer, 2002.
  • J. O'Keefe and J. Dostrovsky, “The hippocampus as a spatial map: preliminary evidence from unit activity in the freely-moving rat”, Brain Res. 34:1 (1971), 171–175.
  • Z. Rosen and Y. X. Zhang, “Convex neural codes in dimension 1”, preprint, 2017.
  • M. Tancer, “Intersection patterns of convex sets via simplicial complexes: a survey”, pp. 521–540 in Thirty essays on geometric graph theory, edited by J. Pach, Springer, 2013.