mlsanityData to 14 Oct 2026

Vector Summaries of Persistence Diagrams for Permutation-based Hypothesis Testing

arXiv 2306.06257 ↗First posted 9 Jun 2023stat.MLcited by 1

Not on the map. Why?

Abstract (arXiv)

Over the past decade, the techniques of topological data analysis (TDA) have grown into prominence to describe the shape of data. In recent years, there has been increasing interest in developing statistical methods and in particular hypothesis testing procedures for TDA. Under the statistical perspective, persistence diagrams -- the central multi-scale topological descriptors of data provided by TDA -- are viewed as random observations sampled from some population or process. In this context, one of the earliest works on hypothesis testing focuses on the two-group permutation-based approach where the associated loss function is defined in terms of within-group pairwise bottleneck or Wasserstein distances between persistence diagrams (Robinson and Turner, 2017). However, in situations where persistence diagrams are large in size and number, the permutation test in question gets computationally more costly to apply. To address this limitation, we instead consider pairwise distances between vectorized functional summaries of persistence diagrams for the loss function. In the present work, we explore the utility of the Betti function in this regard, which is one of the simplest function summaries of persistence diagrams. We introduce an alternative vectorization method for the Betti function based on integration and prove stability results with respect to the Wasserstein distance. Moreover, we propose a new shuffling technique of group labels to increase the power of the test. Through several experimental studies, on both synthetic and real data, we show that the vectorized Betti function leads to competitive results compared to the baseline method involving the Wasserstein distances for the permutation test.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 17 of its 45 references that are in the map. First posted on arXiv 9 Jun 2023.

Builds on

17 of 45 references.

References · 17

  1. 2015Persistence Images: A Stable Vector Representation of Persistent Homologycited by 236
  2. 2017An introduction to Topological Data Analysis: fundamental and practical aspects for data scientistscited by 172
  3. 2017Sliced Wasserstein Kernel for Persistence Diagramscited by 77
  4. 2014A Stable Multi-Scale Kernel for Topological Machine Learningcited by 75
  5. 2016Geometry Helps to Compare Persistence Diagramscited by 39
  6. 2019Persistence Curves: A canonical framework for summarizing persistence diagramscited by 33
  7. 2018Functional Summaries of Persistence Diagramscited by 19
  8. 2019Embeddings of Persistence Diagrams into Hilbert Spacescited by 11
  9. 2013Hypothesis Testing for Topological Data Analysiscited by 9
  10. 2018On the Metric Distortion of Embedding Persistence Diagrams into separable Hilbert spacescited by 9
  11. 2015Statistical Analysis of Persistence Intensity Functionscited by 8
  12. 2021Approximation algorithms for 1-Wasserstein distance between persistence diagramscited by 5
5 more
  1. 2021A computationally efficient framework for vector representation of persistence diagramscited by 3
  2. 2014Introduction to the R package TDAcited by 2
  3. 2020Hypothesis Testing for Shapes using Vectorized Persistence Diagramscited by 2
  4. 2020Functional central limit theorems for persistent Betti numbers on cylindrical networkscited by 1
  5. 2023A fast topological approach for predicting anomalies in time-varying graphscited by 1

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.