D. Achlioptas, Database-friendly random projections, Proceedings of the Twentieth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2001.

N. Ailon and B. Chazelle, The fast johnson-lindenstrauss transform and approximate nearest neighbors, SIAM J. Comput, vol.39, issue.1, pp.302-322, 2009.

N. Alon and B. Klartag, Optimal compression of approximate inner products and dimension reduction, 58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017, pp.639-650, 2017.

F. Aurenhammer, A new duality result concerning voronoi diagrams, Discret. Comput. Geom, vol.5, pp.243-254, 1990.

G. Richard, M. B. Baraniuk, and . Wakin, Random projections of smooth manifolds, Found. Comput. Math, vol.9, issue.1, pp.51-77, 2009.

S. Boucheron, G. Lugosi, and P. Massart, Concentration Inequalities -A Nonasymptotic Theory of Independence, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00794821

M. Buchet, F. Chazal, S. Y. Oudot, and D. R. Sheehy, Efficient and robust persistent homology for measures, Comput. Geom, vol.58, pp.70-96, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01074566

M. Buchet, K. Dey, J. Wang, and Y. Wang, Declutter and resample: Towards parameter free denoising, JoCG, vol.9, issue.2, pp.21-46, 2018.

F. Chazal, D. Cohen-steiner, and Q. Mérigot, Geometric inference for probability measures, Found. Comput. Math, vol.11, issue.6, pp.733-751, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00772444

F. Chazal, M. Vin-de-silva, S. Y. Glisse, and . Oudot, The Structure and Stability of Persistence Modules, Springer Briefs in Mathematics, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01107617

F. Chazal and S. Oudot, Towards persistence-based reconstruction in euclidean spaces, Proceedings of the 24th ACM Symposium on Computational Geometry, pp.232-241, 2008.
URL : https://hal.archives-ouvertes.fr/inria-00197543

K. L. Clarkson, Tighter bounds for random projections of manifolds, Proceedings of the 24th ACM Symposium on Computational Geometry, pp.39-48, 2008.

L. Kenneth, P. W. Clarkson, and . Shor, Application of random sampling in computational geometry, II. Discret. Comput. Geom, vol.4, pp.387-421, 1989.

S. Dasgupta and A. Gupta, An elementary proof of a theorem of johnson and lindenstrauss, Random Struct. Algorithms, vol.22, issue.1, pp.60-65, 2003.

S. Dirksen, Dimensionality reduction with subgaussian matrices: A unified theory, Found. Comput. Math, vol.16, issue.5, pp.1367-1396, 2016.

H. Edelsbrunner and J. Harer, Computational Topology -an Introduction, 2010.

H. Edelsbrunner, D. Letscher, and A. Zomorodian, Topological persistence and simplification, Discret. Comput. Geom, vol.28, issue.4, pp.511-533, 2002.

C. Fefferman, S. Mitter, and H. Narayanan, Testing the manifold hypothesis, Journal of the American Mathematical Society, vol.29, issue.4, pp.983-1049, 2016.

S. Foucart and H. Rauhut, A Mathematical Introduction to Compressive Sensing. Applied and Numerical Harmonic Analysis. Birkhäuser, 2013.

C. Giraud, Introduction to High-Dimensional Statistics, Chapman & Hall/CRC Monographs on Statistics & Applied Probability. Taylor & Francis, 2014.

Y. Gordon, On milman's inequality and random subspaces which escape through a mesh in rn, Geometric Aspects of Functional Analysis, pp.84-106, 1988.

L. J. Guibas, D. Morozov, and Q. Mérigot, Witnessed k-distance, Discret. Comput. Geom, vol.49, issue.1, pp.22-45, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00569029

P. Indyk, R. Motwani, P. Raghavan, and S. S. Vempala, Localitypreserving hashing in multidimensional spaces

. Shor, Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, pp.618-625, 1997.

B. William, J. Johnson, and . Lindenstrauss, Extensions of Lipschitz mappings into a Hilbert space, Contemporary Mathematics, vol.26, issue.1, pp.189-206, 1984.

M. Lotz, Persistent homology for low-complexity models, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, vol.475, 2019.

J. Matou?ek, On variants of the Johnson Lindenstrauss lemma, Random Structures & Algorithms, vol.33, issue.2, pp.142-156, 2008.

S. Y. Oudot, Persistence Theory -From Quiver Representations to Data Analysis, volume 209 of Mathematical surveys and monographs, 2015.

J. M. Phillips, B. Wang, and Y. Zheng, Geometric inference on kernel density estimates, 31st International Symposium on Computational Geometry, vol.34, pp.857-871, 2015.

T. Sarlós, Improved approximation algorithms for large matrices via random projections, 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), pp.21-24

, , pp.143-152, 2006.

D. R. Sheehy, The persistent homology of distance functions under random projection, 30th Annual Symposium on Computational Geometry, SOCG'14, p.328, 2014.

N. Verma, A note on random projections for preserving paths on a manifold, 2011.

R. Vershynin, High-Dimensional Probability: An Introduction with Applications in Data Science. Cambridge Series in Statistical and Probabilistic Mathematics, 2018.

J. Zhang, Advancements of outlier detection: A survey, EAI Endorsed Trans. Scalable Information Systems, vol.1, issue.1, p.2, 2013.