Skip to main navigation Skip to search Skip to main content

An output-sensitive algorithm for persistent homology

  • Institute of Science and Technology Austria

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

11 Scopus citations

Abstract

In this paper, we present the first output-sensitive algorithm to compute the persistence diagram of a filtered simplicial complex. For any Γ > 0, it returns only those homology classes with persistence at least Γ. Instead of the classical reduction via column operations, our algorithm performs rank computations on submatrices of the boundary matrix. For an arbitrary constant δ ∈ (0, 1), the running time is O(C (1-δ)ΓR(n) log n), where C(1-δ)Γ is the number of homology classes with persistence at least (1-δ)Γ, n is the total number of simplices, and R(n) is the complexity of computing the rank of an n×n matrix with O(n) nonzero entries. Depending on the choice of the rank algorithm, this yields a deterministic O(C (1-δ)Γn2.376) algorithm, a O(C (1-δ)Γn2.28) Las-Vegas algorithm, or a O(C(1-δ)Γn2+∈) Monte-Carlo algorithm for an arbitrary ∈ > 0.

Original languageEnglish
Title of host publicationProceedings of the 27th Annual Symposium on Computational Geometry, SCG'11
Pages207-215
Number of pages9
DOIs
StatePublished - 2011
Event27th Annual ACM Symposium on Computational Geometry, SCG'11 - Paris, France
Duration: Jun 13 2011Jun 15 2011

Publication series

NameProceedings of the Annual Symposium on Computational Geometry

Conference

Conference27th Annual ACM Symposium on Computational Geometry, SCG'11
Country/TerritoryFrance
CityParis
Period06/13/1106/15/11

Keywords

  • Computational topology
  • Persistent homology
  • Randomized algorithms
  • Rank computation

Fingerprint

Dive into the research topics of 'An output-sensitive algorithm for persistent homology'. Together they form a unique fingerprint.

Cite this