Tatyana O. Sharpee (2019), Current Opinion in Neurobiology 58:101–104, themed issue on computational neuroscience — DOI-10.1016/j.conb.2019.07.008; the publisher’s PDF is deposited in the NSF Public Access Repository (par.nsf.gov/biblio/10120231)

Key takeaways

  • The thesis. Hyperbolic geometry should apply broadly to neural and other biological circuits. The reasons given: hyperbolic space is the continuous approximation of tree-like hierarchies (exponential growth of states with radius, after Krioukov et al. 2010); networks on a hidden hyperbolic metric are navigable by greedy routing and robust to adding and removing nodes; and Zipf’s law, ubiquitous in biology, is said to be a signature of the same geometry.
  • The Zipf step, and how far it goes. With P(s) ∝ 1/r(s) and energy E = −log P(s), E = log r(s), so the number of states below energy E grows as e^E. Exponential growth of states is the hallmark of trees and of hyperbolic space, hence the claimed link. The argument shows a shared exponential, not a shared geometry: any system with extensive entropy has exponentially many states, and the unit slope that makes a distribution Zipfian is not used. The paper offers no model in which a hyperbolic metric produces Zipf’s law or the reverse. (The sign of E is written loosely in the text.)
  • Zipf as maximal informativeness. Following Schwab, Nemenman & Mehta (2014), Aitchison, Corradi & Latham (2016) and Cubero et al. (2019), Zipf’s law arises when internal states are narrowly distributed for a fixed latent variable but their mean moves strongly with it, and the most informative representations of a latent variable are the ones that show it. This is cited, not derived; the paper sets it beside the navigability results as an “echo”.
  • The only data shown is a figure from Zhou, Smith & Sharpee (2018): monomolecular odorants from tomato and strawberry samples, with distances from their co-variation across samples, fall near the surface of a 3D Poincaré ball under hyperbolic non-metric MDS (after a topological test that ruled out Euclidean and spherical geometry), and the map has a region of odorants correlated with human pleasantness ratings. The paper reads this as orderly topography where early olfactory coding looks random.
  • Why three dimensions. Three dimensions recur (odour statistics, odour perception, phylogenetic-tree visualisation), and the paper proposes that 3D is the lowest dimension in which a hyperbolic representation is robust to noise, citing Mostow rigidity. Mostow’s theorem fixes the geometry of finite-volume hyperbolic manifolds of dimension ≥ 3 by their fundamental group; it is not a statement about noisy embeddings, and it does not single out 3 except as its lowest case.
  • Low-dimensional manifolds versus exponentially many states. The closing argument: neural and behavioural data lie on low-dimensional manifolds, yet behaviour has exponentially many hierarchically organised states, and a low-dimensional hyperbolic space holds both.

Standing in the record

Filed at the owner’s request on 2026-10-09, in the second part of the batch on hierarchy and hyperbolic geometry that the owner asked for after the record opened QUESTION-025. The first part was Cagnetta et al.’s random hierarchy model (LIT-877), Krioukov et al. 2010 (LIT-865), Sala et al. 2018 (LIT-874), Lin et al. 2023 (LIT-870), Zhang, Rich, Lee & Sharpee (LIT-876), Yang et al. 2023 (LIT-871) and Ganea, Bécigneul & Hofmann 2018 (LIT-866).

Read on 2026-10-09 (NOTE-670). It sits between two of its siblings by the same lab: it reproduces the olfactory embedding of Zhou, Smith & Sharpee 2018 (LIT-872) as its evidence, and it states the programme that Zhang et al. (LIT-876) later tested in hippocampal recordings. Its geometric background is Krioukov et al. (LIT-865), its ref. 8. Its machine-learning citation (ref. 9) is Ganea, Bécigneul & Hofmann’s Hyperbolic Neural Networks (NeurIPS 2018), not the same authors’ entailment-cones paper held as LIT-866. No THEORY is filed: its claims are a perspective’s conjectures, and its one empirical finding belongs to the 2018 paper.

It is not a reading for the anthology: no machine-learning practice is involved.