Access the full text.
Sign up today, get DeepDyve free for 14 days.
O. Bobrowski, Matthew Kahle, P. Skraba (2015)
Maximally Persistent Cycles in Random Geometric ComplexesarXiv: Probability
MD Penrose (2003)
Random Geometric Graphs. Oxford Studies of Probability
A. Cuevas (2009)
Set estimation: Another bridge between statistics and geometry., 25
Jan Reininghaus, S. Huber, Ulrich Bauer, R. Kwitt (2014)
A stable multi-scale kernel for topological machine learning2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)
C. Biscio, Jesper Møller (2016)
The Accumulated Persistence Function, a New Useful Functional Summary Statistic for Topological Data Analysis, With a View to Brain Artery Trees and Spatial Point Process ApplicationsJournal of Computational and Graphical Statistics, 28
Peter Bubenik (2012)
Statistical topological data analysis using persistence landscapesJ. Mach. Learn. Res., 16
H Edelsbrunner, J Harer (2010)
Computational Topology: An Introduction
Matthew Kahle (2009)
Random Geometric ComplexesDiscrete & Computational Geometry, 45
J. Diestel (1984)
Sequences and series in Banach spaces
G. Kusano, Y. Hiraoka, K. Fukumizu (2016)
Persistence weighted Gaussian kernel for topological data analysis
J. Yukich (2000)
Asymptotics for weighted minimal spanning trees on random pointsStochastic Processes and their Applications, 85
M Hino, S Kanazawa (2019)
Asymptotic behavior of lifetime sums for random simplicial complex processesJ. Math. Soc. Jpn., 71
Vincent Divol, Théo Lacombe (2019)
Understanding the topology and the geometry of the space of persistence diagrams via optimal partial transportJournal of Applied and Computational Topology, 5
O Bobrowski, M Kahle, P Skraba (2017)
Maximally persistent cycles in random geometric complexesAnn. Appl. Probab., 27
N. Kalton (1985)
SEQUENCES AND SERIES IN BANACH SPACES (Graduate Texts in Mathematics, 92)Bulletin of The London Mathematical Society, 17
Günter Rote, Gert Vegter (2007)
Effective Computational Geometry for Curves and Surfaces Chapter 7 Computational Topology : An Introduction
D. Yogeshwaran, R. Adler (2012)
On the topology of random complexes built over stationary point processes.Annals of Applied Probability, 25
J. Steele (1988)
Growth Rates of Euclidean Minimal Spanning Trees With Power Weighted EdgesAnnals of Probability, 16
C. Villani (2008)
Optimal Transport: Old and New
F. Chazal, Vincent Divol (2018)
The density of expected persistence diagrams and its kernel based estimationJ. Comput. Geom., 10
P. Skraba, Gugan Thoppe, D. Yogeshwaran (2017)
Randomly Weighted d-Complexes: Minimal Spanning Acycles and Persistence DiagramsElectron. J. Comb., 27
N. Aronszajn (1950)
Theory of Reproducing Kernels.Transactions of the American Mathematical Society, 68
Trinh Duy, Y. Hiraoka, T. Shirai (2016)
Limit theorems for persistence diagramsThe Annals of Applied Probability
Akshay Goel, Khanh Trinh, K. Tsunoda (2018)
Strong Law of Large Numbers for Betti Numbers in the Thermodynamic RegimeJournal of Statistical Physics, 174
Chris Cannings (2005)
Random Geometric GraphsJournal of The Royal Statistical Society Series A-statistics in Society, 168
D. Yogeshwaran, Eliran Subag, R. Adler (2014)
Random geometric complexes in the thermodynamic regimeProbability Theory and Related Fields, 167
M. Hino, Shu Kanazawa (2018)
Asymptotic behavior of lifetime sums for random simplicial complex processesJournal of the Mathematical Society of Japan
O. Bobrowski, Gonçalo Oliveira (2017)
Random Čech complexes on Riemannian manifoldsRandom Structures & Algorithms, 54
D. Cohen-Steiner, H. Edelsbrunner, J. Harer, Yuriy Mileyko (2010)
Lipschitz Functions Have Lp-Stable PersistenceFoundations of Computational Mathematics, 10
J. Yukich (1998)
Probability theory of classical Euclidean optimization problems
F. Chazal, Brittany Fasy, F. Lecci, A. Rinaldo, L. Wasserman (2013)
Stochastic Convergence of Persistence Landscapes and SilhouettesProceedings of the thirtieth annual symposium on Computational geometry
F. Chazal, B. Michel (2017)
An Introduction to Topological Data Analysis: Fundamental and Practical Aspects for Data ScientistsFrontiers in Artificial Intelligence, 4
C Villani (2008)
Optimal transport: old and new. Grundlehren der mathematischen Wissenschaften
D Cohen-Steiner, H Edelsbrunner, J Harer, Y Mileyko (2010)
Lipschitz functions haveFound. Comput. Math., 10
S. Boucheron, O. Bousquet, G. Lugosi, P. Massart (2005)
Moment inequalities for functions of independent random variablesAnnals of Probability, 33
M. Penrose, J. Yukich (2003)
Weak laws of large numbers in geometric probabilityAnnals of Applied Probability, 13
Vincent Divol, Théo Lacombe (2019)
Understanding the Topology and the Geometry of the Persistence Diagram Space via Optimal Partial TransportArXiv, abs/1901.03048
Yen-Chi Chen, Daren Wang, A. Rinaldo, L. Wasserman (2015)
Statistical Analysis of Persistence Intensity FunctionsarXiv: Methodology
Yuan Yao, Jian Sun, Xuhui Huang, G. Bowman, Gurjeet Singh, M. Lesnick, L. Guibas, V. Pande, G. Carlsson (2008)
Topological methods for exploring low-density states in biomolecular folding pathways.The Journal of chemical physics, 130 14
G. Kusano, K. Fukumizu, Y. Hiraoka (2017)
Kernel Method for Persistence Diagrams via Kernel Embedding and Weight FactorJ. Mach. Learn. Res., 18
Yongjin Lee, Yongjin Lee, Senja Barthel, P. Dłotko, S. Moosavi, K. Hess, B. Smit, B. Smit (2017)
Quantifying similarity of pore-geometry in nanoporous materialsNature Communications, 8
Khanh Trinh (2017)
A remark on the convergence of Betti numbers in the thermodynamic regimePacific Journal of Mathematics for Industry, 9
Y. Hiraoka, T. Shirai (2015)
Minimum spanning acycle and lifetime of persistent homology in the Linial–Meshulam processRandom Structures & Algorithms, 51
K. McGivney, J. Yukich (1999)
Asymptotics for Voronoi tessellations on random samplesStochastic Processes and their Applications, 83
Henry Adams, T. Emerson, M. Kirby, R. Neville, C. Peterson, P. Shipman, Sofya Chepushtanova, Eric Hanson, Francis Motta, Lori Ziegelmeier (2015)
Persistence Images: A Stable Vector Representation of Persistent HomologyJ. Mach. Learn. Res., 18
D. Cohen-Steiner, H. Edelsbrunner, J. Harer (2005)
Stability of Persistence DiagramsDiscrete & Computational Geometry, 37
F. Chazal, V. Silva, M. Glisse, S. Oudot (2012)
The Structure and Stability of Persistence ModulesArXiv, abs/1207.3674
O. Bobrowski, S. Weinberger (2015)
On the vanishing of homology in random Čech complexesRandom Structures & Algorithms, 51
Mathieu Carrière, Marco Cuturi, S. Oudot (2017)
Sliced Wasserstein Kernel for Persistence Diagrams
Lee Seversky, S. Davis, M. Berger (2016)
On Time-Series Topological Data Analysis: New Data and Opportunities2016 IEEE Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)
Takenobu Nakamura, Y. Hiraoka, A. Hirata, Emerson Escolar, Y. Nishiura (2015)
Persistent homology and many-body atomic structure for medium-range order in the glassNanotechnology, 26
Matthew Kahle, E. Meckes (2010)
Limit theorems for Betti numbers of random simplicial complexesHomology, Homotopy and Applications, 15
F. Chazal, D. Cohen-Steiner, L. Guibas, F. Mémoli, S. Oudot (2009)
Gromov‐Hausdorff Stable Signatures for Shapes using PersistenceComputer Graphics Forum, 28
Publisher's Note Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations
Persistence diagrams are efficient descriptors of the topology of a point cloud. As they do not naturally belong to a Hilbert space, standard statistical methods cannot be directly applied to them. Instead, feature maps (or representations) are commonly used for the analysis. A large class of feature maps, which we call linear, depends on some weight functions, the choice of which is a critical issue. An important criterion to choose a weight function is to ensure stability of the feature maps with respect to Wasserstein distances on diagrams. We improve known results on the stability of such maps, and extend it to general weight functions. We also address the choice of the weight function by considering an asymptotic setting; assume that $${\mathbb {X}}_n$$ X n is an i.i.d. sample from a density on $$[0,1]^d$$ [ 0 , 1 ] d . For the Čech and Rips filtrations, we characterize the weight functions for which the corresponding feature maps converge as n approaches infinity, and by doing so, we prove laws of large numbers for the total persistences of such diagrams. Those two approaches (stability and convergence) lead to the same simple heuristic for tuning weight functions: if the data lies near a d-dimensional manifold, then a sensible choice of weight function is the persistence to the power $$\alpha $$ α with $$\alpha \ge d$$ α ≥ d .
Journal of Applied and Computational Topology – Springer Journals
Published: Aug 7, 2019
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.