Persistent homology for low-complexity models

DOI10.1098/rspa.2019.0081zbMath1472.62180arXiv1709.01037OpenAlexW2978990864WikidataQ127179751 ScholiaQ127179751MaRDI QIDQ5160778

Martin Lotz

Publication date: 29 October 2021

Published in: Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1709.01037

zbMATH Keywords

topologycomputational mathematicstopological data analysiscompressed sensingpersistent homologyrandom projectionsapplied mathematics

Mathematics Subject Classification ID

Inequalities; stochastic orderings (60E15) Geometric probability and stochastic geometry (60D05) Persistent homology and applications, topological data analysis (55N31) Missing data (62D10) Topological data analysis (62R40)

Related Items (1)

Dimensionality reduction for \(k\)-distance applied to persistent homology

Uses Software

• Gudhi
• Ripser
• Ripser.py

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Simplex Tree: An Efficient Data Structure for General Simplicial Complexes
• A unified framework for linear dimensionality reduction in L1
• Efficient and robust persistent homology for measures
• A mathematical introduction to compressive sensing
• Toward a unified theory of sparse dimensionality reduction in Euclidean space
• Dimensionality reduction with subgaussian matrices: a unified theory
• Probability in Banach spaces. Isoperimetry and processes
• Stability of persistence diagrams
• Zigzag zoology: Rips zigzags for homology inference
• The compressed annotation matrix: an efficient data structure for computing persistent cohomology
• Random projections of smooth manifolds
• Lectures on analysis on metric spaces
• The cosparse analysis model and algorithms
• The convex geometry of linear inverse problems
• Linear-size approximations to the Vietoris-Rips filtration
• The sizes of compact subsets of Hilbert space and continuity of Gaussian processes
• Approximating extent measures of points
• New and Improved Johnson–Lindenstrauss Embeddings via the Restricted Isometry Property
• The Structure and Stability of Persistence Modules
• Clear and Compress: Computing Persistent Homology in Chunks
• On sparse reconstruction from Fourier and Gaussian measurements
• Nearest-neighbor-preserving embeddings
• Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
• Tighter bounds for random projections of manifolds
• Towards persistence-based reconstruction in euclidean spaces
• Topology and data
• Plongements lipschitziens dans ${\bbfR}\sp n$
• Lectures on Polytopes
• The Johnson-Lindenstrauss lemma is optimal for linear dimensionality reduction
• The Persistent Homology of Distance Functions under Random Projection
• 10.1162/153244303321897690
• Effective Condition Number Bounds for Convex Regularization
• Living on the edge: phase transitions in convex programs with random data
• Isometric sketching of any set via the Restricted Isometry Property
• Asymptotic Geometric Analysis, Part I
• Tight Oracle Inequalities for Low-Rank Matrix Recovery From a Minimal Number of Noisy Random Measurements
• Upper and Lower Bounds for Stochastic Processes
• Topological inference via meshing

This page was built for publication: Persistent homology for low-complexity models