Expected complexity of barcode reduction

DOI10.1007/S41468-025-00218-8MaRDI QIDQ6890480zbMATH OpenFDO

Authors Barbara Giunti, Guillaume Houry, Michael Kerber, Matthias Söls

Publication date 3 December 2025

Published in Journal of Applied and Computational Topology (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S41468-025-00218-8

zbMATH Keywords

average complexitybarcodematrix reductionpersistent homology

Mathematics Subject Classification ID

Persistent homology and applications, topological data analysis (55N31) Computational aspects of data analysis and big data (68T09)

Cites work

• \textsc{Phat} -- persistent homology algorithms toolbox
• A user's guide to discrete Morse theory
• An output-sensitive algorithm for persistent homology
• Average complexity of matrix reduction for clique filtrations
• Computational topology. An introduction
• Decomposing filtered chain complexes: geometry behind barcoding algorithms
• Decomposition of zero-dimensional persistence modules via rooted subsets
• Discrete Morse Theory
• Gromov Hyperbolicity, Geodesic Defect, and Apparent Pairs in Vietoris-Rips Filtrations
• scientific article; zbMATH DE number 3976197 (Why is no real title available?)
• scientific article; zbMATH DE number 1540669 (Why is no real title available?)
• scientific article; zbMATH DE number 1433426 (Why is no real title available?)
• Javaplex: a research software package for persistent (co)homology
• Keeping it sparse: computing persistent homology revisited
• Maximally persistent cycles in random geometric complexes
• Mean, Median and Mode in Binomial Distributions
• On the triangle space of a random graph
• Persistence theory. From quiver representations to data analysis
• Probabilistic analysis of multiparameter persistence decompositions into intervals
• Probability and Computing
• Random geometric complexes
• Ripser: efficient computation of Vietoris-Rips persistence barcodes
• Sharp vanishing thresholds for cohomology of random flag complexes
• Slice, simplify and stitch: topology-preserving simplification scheme for massive voxel data
• The density of expected persistence diagrams and its kernel based estimation
• The Gudhi library: simplicial complexes and persistent homology
• The Morse Theory of Čech and Delaunay Filtrations
• Topological persistence and simplification
• Topology of random geometric complexes: a survey
• Topology of random simplicial complexes: a survey
• Zigzag persistent homology in matrix multiplication time

This page was built for publication: Expected complexity of barcode reduction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6890480)