The persistent homology of distance functions under random projection

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2014, Pages 328-334

  Sheehy, Donald R ^a  

^a UNIVERSITY OF CONNECTICUT   (United States)

Author keywords

ech Filtration; Johnson lindenstrauss; Minimum enclosing ball; Persistent homology; Random projection

Indexed keywords

DISTANCE FUNCTIONS; EUCLIDEAN SPACES; JOHNSON-LINDENSTRAUSS; JOHNSON-LINDENSTRAUSS LEMMATA; MINIMUM ENCLOSING BALL; NEAREST NEIGHBOR DISTANCE; PERSISTENT HOMOLOGY; RANDOM PROJECTIONS;

COMPUTATIONAL GEOMETRY;

EID: 84904435681     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2582112.2582126     Document Type: Conference Paper

References (40)

1. Dimitris Achlioptas. Database-friendly random projections: Johnson-lindenstrauss with binary coins. J. Comput. Syst. Sci., 66(4):671-687, 2003.
2. Pankaj K. Agarwal, Sariel Har-Peled, and Hai Yu. Embeddings of surfaces, curves, and moving points in euclidean space. In Proceedings of the 24th ACM Symposium on Computational Geometry, pages 381-389, 2008.
3. Nir Ailon and Bernard Chazelle. Faster dimension reduction. Commun. ACM, 53(2):97-104, 2010.
4. Sivaraman Balakrishnan, Alessandro Rinaldo, Don Sheehy, Aarti Singh, and Larry A. Wasserman. Minimax rates for homology inference. Journal of Machine Learning Research - Proceedings Track, 22:64-72, 2012.
5. Richard G. Baraniuk and Michael B. Wakin. Random projections of smooth manifolds. Foundations of Computational Mathematics, 9(1):51-77, 2009.
6. Ulrich Bauer, Michael Kerber, and Jan Reininghaus. Clear and compress: Computing persistent homology in chunks. In TopoInVis, 2013.
7. Gérard Biau, Frédéric Chazal, David Cohen-Steiner, Luc Devroye, and Carlos Rodríguez. A weighted k-nearest neighbor density estimate for geometric inference. Electron. J. Statist., 5:204-237, 2011.
8. Jean-Daniel Boissonnat and Arijit Ghosh. Manifold reconstruction using Tangential Delaunay Complexes. In In Proc. 26th Annual Symposium on Computational Geometry, 2010.
9. Mickaël Buchet, Frédéric Chazal, Steve Y. Oudot, and Donald R. Sheehy. Efficient and robust topological data analysis on metric spaces. arXiv preprint arXiv:1306.0039, 2013.
10. Gunnar Carlsson. Topology and data. Bull. Amer. Math. Soc., 46:255-308, 2009.
11. Frédéric Chazal and Date Cohen-Steiner. Geometric inference. In Tesselations in the Sciences. Springer-Verlag, 2013. To appear.
12. Frédéric Chazal, David Cohen-Steiner, and André Lieutier. A sampling theory for compact sets in euclidean space. Discrete & Computational Geometry, 41:461-479, 2009.
13. Frédéric Chazal, David Cohen-Steiner, and Quentin Mérigot. Geometric inference for probability measures. Foundations of Computational Mathematics, 11:733-751, 2011.
14. Frédéric Chazal, Vin de Silva, Marc Glisse, and Steve Oudot. The structure and stability of persistence modules. preprint arXiv:1207.3674, 2012.
15. Frédéric Chazal and André Lieutier. Weak feature size and persistent homology: Computing homology of solids in Rn from noisy data samples. In Proc. of the 21st ACM Symposium on Computational Geometry, pages 255-262, 2005.
16. Frédéric Chazal and Steve Y. Oudot. Towards persistence-based reconstruction in euclidean spaces. In Proceedings of the 24th ACM Symposium on Computational Geometry, pages 232-241, 2008.
17. Kenneth L. Clarkson. Tighter bounds on random projection of manifolds. In Proceedings of the 24th ACM Symposium on Computational Geometry, 2008.
18. David Cohen-Steiner, Herbert Edelsbrunner, and John Harer. Stability of persistence diagrams. Discrete & Computational Geometry, 37(1):103-120, 2007.
19. Vin de Silva and Robert Ghrist. Coverage in sensor networks via persistent homology. Algorithmic & Geometric Topology, 7:339-358, 2007.
20. Tamal K. Dey, Fengtao Fan, and Yusu Wang. Computing topological persistence for simplicial maps. In Proceedings of the 30th Annual Symposium on Computational Geometry, 2014. to appear.
21. Herbert Edelsbrunner, David Letscher, and Afra Zomorodian. Topological persistence and simpligfication. Discrete & Computational Geometry, 4(28):511-533, 2002.
22. Kaspar Fischer and Bernd Gärtner. The smallest enclosing ball of balls: Combinatorial structure and algorithms. Int. J. Comput. Geometry Appl., 14(4-5):341-378, October 2004.
23. Leonidas Guibas, Dmitriy Morozov, and Quentin Mérigot. Witnessed k-distance. Discrete & Computational Geometry, 49(1):22-45, 2013.
24. Sariel Har-Peled, Piotr Indyk, and Rajeev Motwani. Approximate nearest neighbor: Towards removing the curse of dimensionality. Theory of Computing, 8(1):321-350, 2012.
25. Allen Hatcher. Algebraic Topology. Cambridge University Press, 2001.
26. William B. Johnson and Joram Lindenstrauss. Extensions of Lipschitz mappings into a Hilbert space. Contemp. Math., 26:189-206, 1984.
27. Daniel M. Kane and Jelani Nelson. Sparser Johnson-Lindenstrauss transforms. In SODA, pages 1195-1206, 2012.
28. Michael Kerber and R. Sharathkumar. Approximate cech complexes in low and high dimensions. In ISAAC, 2013.
29. Michael Lamar and David Letscher. Random projections for calculating topological persistence. unpublished manuscript, 2013.
30. Avner Magen. Dimensionality reductions in '2 that preserve volumes and distance to afine spaces. Discrete & Computational Geometry, 38(1):139-153, 2007.
31. Avner Magen and Anastasios Zouzias. Near optimal dimensionality reductions that preserve volumes. In RANDOM, pages 523-534, 2008.
32. Quentin Mérigot. Lower bounds for k-distance approximation. In Proceedings of the Twenty-ninth Annual Symposium on Computational Geometry, pages 435-440, 2013.
33. Konstantin Mischaikow and Vidit Nanda. Morse theory for filtrations and efficient computation of persistent homology. Discrete & Computational Geometry, 50(2):330-353, 2013.
34. Partha Niyogi, Stephen Smale, and Shmuel Weinberger. Finding the homology of submanifolds with high confidence from random samples. Discrete & Computational Geometry, 39(1-3):419-441, 2008.
35. Partha Niyogi, Stephen Smale, and Shmuel Weinberger. A topological view of unsupervised learning from noisy data. SIAM J. Comput., 40(3):646-663, 2011.
36. Steve Y. Oudot and Donald R. Sheehy. Zigzag zoology: Rips zigzags for homology inference. In Proceedings of the 29th annual Symposium on Computational Geometry, pages 387-396, 2013.
37. Tamás Sarlós. Improved approximation algorithms for large matrices via random projections. In FOCS, pages 143-152, 2006.
38. Donald R. Sheehy. A multicover nerve for geometric inference. In CCCG: Canadian Conference in Computational Geometry, 2012.
39. Donald R. Sheehy. Linear-size approximations to the Vietoris-Rips filtration. Discrete & Computational Geometry, 49(4):778-796, 2013.
40. Nakul Verma. A note on random projections for preserving paths on a manifold. Technical Report CS2011-0971, UC San Diego, 2011.