{"month":"12","author":[{"first_name":"U.","last_name":"Bauer","full_name":"Bauer, U."},{"full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","first_name":"Herbert","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Jablonski","first_name":"Grzegorz","id":"4483EF78-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-3536-9866","full_name":"Jablonski, Grzegorz"},{"full_name":"Mrozek, M.","last_name":"Mrozek","first_name":"M."}],"citation":{"ama":"Bauer U, Edelsbrunner H, Jablonski G, Mrozek M. Čech-Delaunay gradient flow and homology inference for self-maps. <i>Journal of Applied and Computational Topology</i>. 2020;4(4):455-480. doi:<a href=\"https://doi.org/10.1007/s41468-020-00058-8\">10.1007/s41468-020-00058-8</a>","chicago":"Bauer, U., Herbert Edelsbrunner, Grzegorz Jablonski, and M. Mrozek. “Čech-Delaunay Gradient Flow and Homology Inference for Self-Maps.” <i>Journal of Applied and Computational Topology</i>. Springer Nature, 2020. <a href=\"https://doi.org/10.1007/s41468-020-00058-8\">https://doi.org/10.1007/s41468-020-00058-8</a>.","mla":"Bauer, U., et al. “Čech-Delaunay Gradient Flow and Homology Inference for Self-Maps.” <i>Journal of Applied and Computational Topology</i>, vol. 4, no. 4, Springer Nature, 2020, pp. 455–80, doi:<a href=\"https://doi.org/10.1007/s41468-020-00058-8\">10.1007/s41468-020-00058-8</a>.","apa":"Bauer, U., Edelsbrunner, H., Jablonski, G., &#38; Mrozek, M. (2020). Čech-Delaunay gradient flow and homology inference for self-maps. <i>Journal of Applied and Computational Topology</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s41468-020-00058-8\">https://doi.org/10.1007/s41468-020-00058-8</a>","ista":"Bauer U, Edelsbrunner H, Jablonski G, Mrozek M. 2020. Čech-Delaunay gradient flow and homology inference for self-maps. Journal of Applied and Computational Topology. 4(4), 455–480.","ieee":"U. Bauer, H. Edelsbrunner, G. Jablonski, and M. Mrozek, “Čech-Delaunay gradient flow and homology inference for self-maps,” <i>Journal of Applied and Computational Topology</i>, vol. 4, no. 4. Springer Nature, pp. 455–480, 2020.","short":"U. Bauer, H. Edelsbrunner, G. Jablonski, M. Mrozek, Journal of Applied and Computational Topology 4 (2020) 455–480."},"title":"Čech-Delaunay gradient flow and homology inference for self-maps","date_published":"2020-12-01T00:00:00Z","file_date_updated":"2024-03-04T10:52:42Z","date_created":"2024-03-04T10:47:49Z","acknowledgement":"This research has been supported by the DFG Collaborative Research Center SFB/TRR 109 “Discretization in Geometry and Dynamics”, by Polish MNiSzW Grant No. 2621/7.PR/12/2013/2, by the Polish National Science Center under Maestro Grant No. 2014/14/A/ST1/00453 and Grant No. DEC-2013/09/N/ST6/02995. Open Access funding provided by Projekt DEAL.","scopus_import":"1","department":[{"_id":"HeEd"}],"issue":"4","type":"journal_article","ddc":["500"],"article_processing_charge":"Yes (via OA deal)","status":"public","_id":"15064","file":[{"file_name":"2020_JourApplCompTopology_Bauer.pdf","access_level":"open_access","checksum":"eed1168b6e66cd55272c19bb7fca8a1c","content_type":"application/pdf","success":1,"creator":"dernst","date_updated":"2024-03-04T10:52:42Z","file_size":851190,"relation":"main_file","date_created":"2024-03-04T10:52:42Z","file_id":"15065"}],"quality_controlled":"1","publication_status":"published","volume":4,"publisher":"Springer Nature","abstract":[{"lang":"eng","text":"We call a continuous self-map that reveals itself through a discrete set of point-value pairs a sampled dynamical system. Capturing the available information with chain maps on Delaunay complexes, we use persistent homology to quantify the evidence of recurrent behavior. We establish a sampling theorem to recover the eigenspaces of the endomorphism on homology induced by the self-map. Using a combinatorial gradient flow arising from the discrete Morse theory for Čech and Delaunay complexes, we construct a chain map to transform the problem from the natural but expensive Čech complexes to the computationally efficient Delaunay triangulations. The fast chain map algorithm has applications beyond dynamical systems."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","has_accepted_license":"1","oa":1,"tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"page":"455-480","oa_version":"Published Version","doi":"10.1007/s41468-020-00058-8","publication":"Journal of Applied and Computational Topology","date_updated":"2024-03-04T10:54:04Z","day":"01","language":[{"iso":"eng"}],"year":"2020","publication_identifier":{"issn":["2367-1726"],"eissn":["2367-1734"]},"article_type":"original","intvolume":"         4"}