vix.ing · top · new · best · stats · spec

Greedy Matroid Algorithm And Computational Persistent Homology

2023/08/03 by Tianyi Sun, Bradley J. Nelson, Sun, Tianyi +1
Computer Science · #Computation (stat.CO) #Computational Geometry (cs.CG) #FOS: Computer and information sciences #Rough Sets and Fuzzy Logic #Topological and Geometric Data Analysis

paper · pdf · doi:10.48550/arxiv.2308.01796

openalex publication_date 2023/08/03 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

An important problem in computational topology is to calculate the homology of a space from samples. In this work, we develop a statistical approach to this problem by calculating the expected rank of an induced map on homology from a sub-sample to the full space. We develop a greedy matroid algorithm for finding an optimal basis for the image of the induced map, and investigate the relationship between this algorithm and the probability of sampling vectors in the image of the induced map.

Related