The computation of Vietoris-Rips persistence barcodes is both execution-intensive and memory-intensive. In this paper, we study its computational structure and identify several unique mathematical properties and algorithmic opportunities with connections to the GPU. Mathematically and empirically, we look into the properties of apparent pairs, which are independently identifiable persistence pairs comprising up to 99\% of persistence pairs. We prove tight upper and lower bounds of the apparent pair rate and some probabilistic lower bounds. We also design massively parallel algorithms to take advantage of the very large number of simplices that can be processed independently of each other. Having identified these opportunities, we develop a GPU-accelerated software for computing Vietoris-Rips persistence barcodes, called Ripser++. Under nice sampling conditions, we show that the expected work complexity of our algorithm is near linear in the number of simplices. The expected depth complexity is dependent only on the computation of the expected number of $p$-dimensional homological cycles. The software achieves up to 30x speedup over the total execution time of the original Ripser and also reduces CPU-memory usage by up to 2.0x. We believe our GPU-acceleration based efforts open a new chapter for the advancement of topological data analysis in the post-Moore's Law era.
Efficient Decomposition of Forman-Ricci Curvature on Vietoris-Rips Complexes and Data Applications
Basque Center for Applied Mathematics(巴斯克应用数学中心);Universidade Federal de Pernambuco(伯南布哥联邦大学);Dutch Institute for Emergent Phenomenal(荷兰涌现现象研究所);School of Electronic Information and Electrical Engineering, Shanghai Jiao Tong University(上海交通大学电子信息与电气工程学院);Inria, Montpellier(法国国家信息与自动化研究所(蒙彼利埃));Max Planck Institute for Mathematics in the Sciences(马克斯·普朗克科学数学研究所);Center for Scalable Data Analytics and Artificial Intelligence, Leipzig University(莱比锡大学可扩展数据分析与人工智能中心);Santa Fe Institute(圣塔菲研究所)
A stability theorem for bigraded persistence barcodes
Department of Mathematics, Rider University, Lawrenceville, NJ 08648, USA;Mathematical Institute of the Serbian Academy of Sciences;Department of Mathematics;Mechanics, Moscow State University, Russia;Institute for Information Transmission Problems, Russian Academy of Sciences, Moscow, Russia;National Research University Higher School of Economics, Moscow, Russia;Department of Mathematics Education, Pusan National University, Busan, Republic of Korea;Statistics, University of Regina, Regina, Saskatchewan, Canada