# Dimensionality Reduction for k-Distance Applied to Persistent Homology

@article{Arya2020DimensionalityRF, title={Dimensionality Reduction for k-Distance Applied to Persistent Homology}, author={Shreya Arya and Jean-Daniel Boissonnat and Kunal Dutta and Martin Lotz}, journal={ArXiv}, year={2020}, volume={abs/2110.05897} }

Given a set P of n points and a constant k, we are interested in computing the persistent homology of the Cech filtration of P for the k-distance, and investigate the effectiveness of dimensionality reduction for this problem, answering an open question of Sheehy [Proc. SoCG, 2014]. We first show using the Johnson-Lindenstrauss lemma, that the persistent homology can be preserved up to a (1 ± e) factor while reducing dimensionality to O(k log n/e2). Our main result shows that the target…

## Topics from this paper

## One Citation

Shape-Preserving Dimensionality Reduction : An Algorithm and Measures of Topological Equivalence

- Computer Science, MathematicsArXiv
- 2021

A linear dimensionality reduction technique preserving topological features via persistent homology, designed to find linear projection L which preserves the persistent diagram of a point cloud X via simulated annealing, is introduced.

## References

SHOWING 1-10 OF 57 REFERENCES

New and Improved Johnson-Lindenstrauss Embeddings via the Restricted Isometry Property

- Mathematics, Computer ScienceSIAM J. Math. Anal.
- 2011

The results improve the best known bounds on the necessary embedding dimension m for a wide class of structured random matrices and improve the recent bound m = O(delta^(-4) log(p) log^4(N)) appearing in Ailon and Liberty, which is optimal up to the logarithmic factors in N.

On variants of the Johnson-Lindenstrauss lemma

- Computer ScienceRandom Struct. Algorithms
- 2008

A simple and self-contained proof of a version of the Johnson–Lindenstrauss lemma that subsumes a basic versions by Indyk and Motwani and a version more suitable for efficient computations due to Achlioptas is given.

Persistent homology for low-complexity models

- Mathematics, Computer ScienceProceedings of the Royal Society A
- 2019

The Gaussian width is connected to the doubling dimension of a finite metric space, which appears in the study of the complexity of other methods for approximating persistent homology, and can literally replace the ambient dimension by an intrinsic notion of dimension related to the structure of the data.

The Persistent Homology of Distance Functions under Random Projection

- Computer Science, MathematicsSoCG
- 2014

This paper shows that the persistent homology of the distance function to P is also preserved up to a comparable constant factor, and proves these results in the more general setting of weighted kth nearest neighbor distances.

Improved Approximation Algorithms for Large Matrices via Random Projections

- Mathematics, Computer Science2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06)
- 2006

The key idea is that low dimensional embeddings can be used to eliminate data dependence and provide more versatile, linear time pass efficient matrix computation.

Towards persistence-based reconstruction in euclidean spaces

- Computer Science, MathematicsSCG '08
- 2008

A novel approach that stands in-between classical reconstruction and topological estimation, and whose complexity scales up with the intrinsic dimension of the data is introduced.

Robust Topological Inference: Distance To a Measure and Kernel Distance

- Mathematics, Computer ScienceJ. Mach. Learn. Res.
- 2017

The distance-to-a-measure (DTM), and the kernel distance, introduced by Phillips et al. (2014), are smooth functions that provide useful topological information but are robust to noise and outliers.

A note on random projections for preserving paths on a manifold

- 2011

Random projections are typically used to study low distorti on linear embeddings that approximately preserve Euclidean distances between pairs of point s in a setS ⊂ R. Of particular interest is when…

Optimal Compression of Approximate Inner Products and Dimension Reduction

- Mathematics, Computer Science2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)
- 2017

The proof is algorithmic, and provides an efficient algorithm for computing a sketch of size O(f(n,k,≥)/n) for each point, so that the square of the distance between any two points can be computed from their sketches up to an additive error in time linear in the length of the sketches.

Random Projections of Smooth Manifolds

- Mathematics, Computer ScienceFound. Comput. Math.
- 2009

Abstract
We propose a new approach for nonadaptive dimensionality reduction of manifold-modeled data, demonstrating that a small number of random linear projections can preserve key information about…