Paper List
-
Macroscopic Dominance from Microscopic Extremes: Symmetry Breaking in Spatial Competition
This paper addresses the fundamental question of how microscopic stochastic advantages in spatial exploration translate into macroscopic resource domi...
-
Linear Readout of Neural Manifolds with Continuous Variables
This paper addresses the core challenge of quantifying how the geometric structure of high-dimensional neural population activity (neural manifolds) d...
-
Theory of Cell Body Lensing and Phototaxis Sign Reversal in “Eyeless” Mutants of Chlamydomonas
This paper solves the core puzzle of how eyeless mutants of Chlamydomonas exhibit reversed phototaxis by quantitatively modeling the competition betwe...
-
Cross-Species Transfer Learning for Electrophysiology-to-Transcriptomics Mapping in Cortical GABAergic Interneurons
This paper addresses the challenge of predicting transcriptomic identity from electrophysiological recordings in human cortical interneurons, where li...
-
Uncovering statistical structure in large-scale neural activity with Restricted Boltzmann Machines
This paper addresses the core challenge of modeling large-scale neural population activity (1500-2000 neurons) with interpretable higher-order interac...
-
Realizing Common Random Numbers: Event-Keyed Hashing for Causally Valid Stochastic Models
This paper addresses the critical problem that standard stateful PRNG implementations in agent-based models violate causal validity by making random d...
-
A Standardized Framework for Evaluating Gene Expression Generative Models
This paper addresses the critical lack of standardized evaluation protocols for single-cell gene expression generative models, where inconsistent metr...
-
Single Molecule Localization Microscopy Challenge: A Biologically Inspired Benchmark for Long-Sequence Modeling
This paper addresses the core challenge of evaluating state-space models on biologically realistic, sparse, and stochastic temporal processes, which a...
Covering Relations in the Poset of Combinatorial Neural Codes
Pacific Northwest National Laboratory | Florida Atlantic University
30秒速读
IN SHORT: This work addresses the core challenge of navigating the complex poset structure of neural codes to systematically test the conjecture linking convex neural codes to representable oriented matroids.
核心创新
- Methodology Provides the first complete characterization of upward covering relations in the poset P_Code of combinatorial neural codes.
- Theory Introduces a constructive method to generate all codes that cover a given neural code, based on the concept of isolated subsets within its intersection completion.
- Methodology Establishes a key lemma (Lemma 3.1) showing that a morphism between codes uniquely extends to a morphism between their intersection completions, preserving surjectivity.
主要结论
- A code C covers a code D in P_Code if and only if its intersection completion C_hat covers D_hat (Lemma 3.3).
- If C covers D, then C_hat is isomorphic to D_hat_[I] for some isolated subset I ⊆ D_hat (Theorem 3.5).
- All codes covering a given code D can be constructed via four explicit types of operations on isolated subsets of D_hat, as defined in Definition 3.9 and Table 1.
摘要: A combinatorial neural code is a subset of the power set 2[n] on [n]={1,…,n}, in which each 1≤i≤n represents a neuron and each element (codeword) represents the co-firing event of some neurons. Consider a space X⊆ℝd, simulating an animal’s environment, and a collection 𝒰={U1,…,Un} of open subsets of X. Each Ui⊆X simulates a place field which is a specific region where a place cell i is active. Then, the code of 𝒰 in X is defined as code(𝒰,X)={σ⊆[n]|⋂i∈σUi∖⋃j∉σUj≠∅}. If a neural code 𝒞=code(𝒰,X) for some X and 𝒰, we say 𝒞 has a realization of open subsets of some space X. Although every combinatorial neural code obviously has a realization by some open subsets, determining whether it has a realization by some open convex subsets remains unsolved. Many studies attempted to tackle this decision problem, but only partial results were achieved. In fact, a previous study showed that the decision problem of convex neural codes is NP-hard. Furthermore, the authors of this study conjectured that every convex neural code can be realized as a minor of a neural code arising from a representable oriented matroid, which can lead to an equivalence between convex and polytope convex neural codes. Even though this conjecture has been confirmed in dimension two, its validity in higher dimensions is still unknown. To advance the investigation of this conjecture, we provide a complete characterization of the covering relations within the poset 𝐏𝐂𝐨𝐝𝐞 of neural codes.