Cover refinements enable a near-linear-size approximation to the Vietoris-Rips filtration with unconditional log-3 interleaving that preserves persistent homology.
Ripser: efficient Computation of Vietoris–Rips Persistence Barcodes
9 Pith papers cite this work. Polarity classification is still indexing.
9
Pith papers citing it
citation-role summary
method 1
citation-polarity summary
years
2026 9verdicts
UNVERDICTED 9roles
method 1polarities
use method 1representative citing papers
STRAND treats persistence diagrams as survival data to derive a calibrated two-sample test, interpretable effect sizes, and a 1-Wasserstein-stable feature vector from one representation.
RedZeD introduces a new algorithm for persistent homology of Vietoris-Rips filtrations using Reduction to Zero Differentials and active enumeration that speeds up the persistence pairing algorithm in many cases.
SMIXAE is a new mixture-of-autoencoders architecture that learns multidimensional manifolds directly from transformer activations, recovering known structures and identifying novel ones in Gemma 2 2B and 9B models.
A parameterized family of tensor products on persistence modules produces Künneth short exact sequences and universal coefficient theorems usable for persistent homology of filtered CW complexes and product spaces.
Proves Cheeger inequalities for persistent up p-Laplacians on complex inclusions, with reductions for pseudomanifolds and comparisons to graph cases.
The authors combine topological data analysis and multi-objective Bayesian inference to achieve practical parameter identifiability and identify simpler rules in an agent-based model of zebrafish patterns.
Random slicing for subsampling combined with Nadaraya-Watson smoothing enables faster and improved persistence-based topological optimization of point clouds in 2D and 3D.
A standardized pipeline converts time series to graphs, computes persistence diagrams, and extracts features that classify UCR benchmarks, with diffusion distance outperforming shortest-path metrics and performance varying by graph type.
citing papers explorer
-
It's All About Covers: Persistent Homology of Cover Refinements
Cover refinements enable a near-linear-size approximation to the Vietoris-Rips filtration with unconditional log-3 interleaving that preserves persistent homology.
-
From Persistence to Survival: Hypothesis Testing, Effect Sizes and Vectorisation for Topological Features
STRAND treats persistence diagrams as survival data to derive a calibrated two-sample test, interpretable effect sizes, and a 1-Wasserstein-stable feature vector from one representation.
-
RedZeD: Computing persistent homology by Reduction to Zero Differentials
RedZeD introduces a new algorithm for persistent homology of Vietoris-Rips filtrations using Reduction to Zero Differentials and active enumeration that speeds up the persistence pairing algorithm in many cases.
-
SMIXAE: Towards Unsupervised Manifold Discovery in Language Models
SMIXAE is a new mixture-of-autoencoders architecture that learns multidimensional manifolds directly from transformer activations, recovering known structures and identifying novel ones in Gemma 2 2B and 9B models.
-
A continuum of K\"unneth theorems for persistence modules
A parameterized family of tensor products on persistence modules produces Künneth short exact sequences and universal coefficient theorems usable for persistent homology of filtered CW complexes and product spaces.
-
Cheeger Inequalities for the Persistent Laplacian
Proves Cheeger inequalities for persistent up p-Laplacians on complex inclusions, with reductions for pseudomanifolds and comparisons to graph cases.
-
Multi-objective Bayesian inference in an agent-based model of zebrafish patterns via topological data analysis
The authors combine topological data analysis and multi-objective Bayesian inference to achieve practical parameter identifiability and identify simpler rules in an agent-based model of zebrafish patterns.
-
Towards Scalable Persistence-Based Topological Optimization
Random slicing for subsampling combined with Nadaraya-Watson smoothing enables faster and improved persistence-based topological optimization of point clouds in 2D and 3D.
-
Persistent Homology of Time Series through Complex Networks
A standardized pipeline converts time series to graphs, computes persistence diagrams, and extracts features that classify UCR benchmarks, with diffusion distance outperforming shortest-path metrics and performance varying by graph type.