arXiv (OAI Expanded)
open access
RedZeD: Computing persistent homology by Reduction to Zero Differentials
We introduce a new algorithm for computing persistent homology of Vietoris-Rips filtrations, which offers a considerable improvement both in terms of time and memory over the existing implementations of the persistence pairing algorithm. The key innovation, called active enumeration, is made possibl
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Persistence Pairing Graphs: Tracking Changes of Selected Homology Bases#798351
- Persistence Pairing Graphs: Tracking Changes of Selected Homology Bases#796938
- A New Non-archimedean Metric on Persistent Homology#1104797
- A Stable Measure of Similarity for Time Series using Persistent Homology#153022
- Model-based detection of whole-genome duplications in a phylogeny#681069
Record · ID 1070470
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive