An output sensitive algorithm for persistent homology
Chen, Chao
Kerber, Michael
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 x 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.
ACM
2011
info:eu-repo/semantics/conferenceObject
doc-type:conferenceObject
text
https://research-explorer.app.ist.ac.at/record/3367
Chen C, Kerber M. An output sensitive algorithm for persistent homology. In: ACM; 2011:207-216. doi:<a href="https://doi.org/10.1145/1998196.1998228">10.1145/1998196.1998228</a>
eng
info:eu-repo/semantics/altIdentifier/doi/10.1145/1998196.1998228
info:eu-repo/semantics/closedAccess