An output-sensitive algorithm for persistent homology

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_d(n)logn), where C_(1−δ)Γ is the number of homology classes with persistence at least (1−δ)Γ, n is the total number of simplices in the complex, d its dimension, and R_d(n) is the complexity of computing the rank of an n×n matrix with O(dn) nonzero entries. Depending on the choice of the rank algorithm, this yields a deterministic O(C_(1−δ)Γn^2.376) algorithm, an O(C_(1−δ)Γn^2.28) Las-Vegas algorithm, or an O(C_(1−δ)Γn^2+ϵ) Monte-Carlo algorithm for an arbitrary ϵ<0. The space complexity of the Monte-Carlo version is bounded by O(dn)=O(nlogn).