Doughnut or Mickey Mouse? Detecting Toroidal Structure in Data through Persistent Cup-Length
Fuente:
arXiv
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866911057919868928 |
|---|---|
| author | Ivshina, Ekaterina S. Anikeeva, Galit Zhou, Ling |
| author_facet | Ivshina, Ekaterina S. Anikeeva, Galit Zhou, Ling |
| contents | Understanding the structure of high-dimensional data is fundamental to neuroscience and other data-intensive scientific fields. While persistent homology effectively identifies basic topological features such as "holes," it lacks the ability to reliably detect more complex topologies, particularly toroidal structures, despite previous heuristic attempts. To address this limitation, recent work introduced persistent cup-length, a novel topological invariant derived from persistent cohomology. In this paper, we present the first implementation of this method and demonstrate its practical effectiveness in detecting toroidal structures, uncovering topological features beyond the reach of persistent homology alone. Our implementation overcomes computational bottlenecks through strategic optimization, efficient integration with the Ripser library, and the application of landmark subsampling techniques. By applying our method to grid cell population activity data, we demonstrate that persistent cup-length effectively identifies toroidal structures in neural manifolds. Our approach offers a powerful new tool for analyzing high-dimensional data, advancing existing topological methods. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2507_11151 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Doughnut or Mickey Mouse? Detecting Toroidal Structure in Data through Persistent Cup-Length Ivshina, Ekaterina S. Anikeeva, Galit Zhou, Ling Algebraic Topology Understanding the structure of high-dimensional data is fundamental to neuroscience and other data-intensive scientific fields. While persistent homology effectively identifies basic topological features such as "holes," it lacks the ability to reliably detect more complex topologies, particularly toroidal structures, despite previous heuristic attempts. To address this limitation, recent work introduced persistent cup-length, a novel topological invariant derived from persistent cohomology. In this paper, we present the first implementation of this method and demonstrate its practical effectiveness in detecting toroidal structures, uncovering topological features beyond the reach of persistent homology alone. Our implementation overcomes computational bottlenecks through strategic optimization, efficient integration with the Ripser library, and the application of landmark subsampling techniques. By applying our method to grid cell population activity data, we demonstrate that persistent cup-length effectively identifies toroidal structures in neural manifolds. Our approach offers a powerful new tool for analyzing high-dimensional data, advancing existing topological methods. |
| title | Doughnut or Mickey Mouse? Detecting Toroidal Structure in Data through Persistent Cup-Length |
| topic | Algebraic Topology |
| url | https://arxiv.org/abs/2507.11151 |