{"month":"05","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2013","day":"01","publisher":"Elsevier","department":[{"_id":"HeEd"}],"related_material":{"record":[{"id":"3367","relation":"earlier_version","status":"public"}]},"title":"An output sensitive algorithm for persistent homology","quality_controlled":"1","intvolume":"        46","citation":{"chicago":"Chen, Chao, and Michael Kerber. “An Output Sensitive Algorithm for Persistent Homology.” <i>Computational Geometry: Theory and Applications</i>. Elsevier, 2013. <a href=\"https://doi.org/10.1016/j.comgeo.2012.02.010\">https://doi.org/10.1016/j.comgeo.2012.02.010</a>.","apa":"Chen, C., &#38; Kerber, M. (2013). An output sensitive algorithm for persistent homology. <i>Computational Geometry: Theory and Applications</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.comgeo.2012.02.010\">https://doi.org/10.1016/j.comgeo.2012.02.010</a>","ista":"Chen C, Kerber M. 2013. An output sensitive algorithm for persistent homology. Computational Geometry: Theory and Applications. 46(4), 435–447.","short":"C. Chen, M. Kerber, Computational Geometry: Theory and Applications 46 (2013) 435–447.","mla":"Chen, Chao, and Michael Kerber. “An Output Sensitive Algorithm for Persistent Homology.” <i>Computational Geometry: Theory and Applications</i>, vol. 46, no. 4, Elsevier, 2013, pp. 435–47, doi:<a href=\"https://doi.org/10.1016/j.comgeo.2012.02.010\">10.1016/j.comgeo.2012.02.010</a>.","ama":"Chen C, Kerber M. An output sensitive algorithm for persistent homology. <i>Computational Geometry: Theory and Applications</i>. 2013;46(4):435-447. doi:<a href=\"https://doi.org/10.1016/j.comgeo.2012.02.010\">10.1016/j.comgeo.2012.02.010</a>","ieee":"C. Chen and M. Kerber, “An output sensitive algorithm for persistent homology,” <i>Computational Geometry: Theory and Applications</i>, vol. 46, no. 4. Elsevier, pp. 435–447, 2013."},"date_published":"2013-05-01T00:00:00Z","_id":"2939","scopus_import":1,"doi":"10.1016/j.comgeo.2012.02.010","type":"journal_article","page":"435 - 447","issue":"4","publication_status":"published","language":[{"iso":"eng"}],"publication":"Computational Geometry: Theory and Applications","acknowledgement":"The authors thank Herbert Edelsbrunner for many helpful discussions and suggestions. Moreover, they are grateful for the careful reviews that helped to improve the quality of the paper.","date_created":"2018-12-11T12:00:27Z","status":"public","author":[{"full_name":"Chen, Chao","id":"3E92416E-F248-11E8-B48F-1D18A9856A87","first_name":"Chao","last_name":"Chen"},{"last_name":"Kerber","first_name":"Michael","orcid":"0000-0002-8030-9299","id":"36E4574A-F248-11E8-B48F-1D18A9856A87","full_name":"Kerber, Michael"}],"oa_version":"None","date_updated":"2023-02-23T11:24:10Z","publist_id":"3796","volume":46,"abstract":[{"text":"In this paper, we present the first output-sensitive algorithm to compute the persistence diagram of a filtered simplicial complex. For any Γ &gt; 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) log n), 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 (d n) 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 + ε{lunate}) Monte-Carlo algorithm for an arbitrary ε{lunate} &gt; 0. The space complexity of the Monte-Carlo version is bounded by O (d n) = O (n log n).","lang":"eng"}]}