{"abstract":[{"lang":"eng","text":"In numerous fields, dynamic time series data require continuous updates, necessitating efficient data processing techniques for accurate analysis. This paper examines the banana tree data structure, specifically designed to efficiently maintain the multi-scale topological descriptor commonly known as persistent homology for dynamically changing time series data. We implement this data structure and conduct an experimental study to assess its properties and runtime for update operations. Our findings indicate that banana trees are highly effective with unbiased random data, outperforming state-of-the-art static algorithms in these scenarios. Additionally, our results show that real-world time series share structural properties with unbiased random walks, suggesting potential practical utility for our implementation."}],"year":"2025","project":[{"_id":"9B9290DE-BA93-11EA-9121-9846C619BF3A","name":"Vienna Graduate School on Computational Optimization","grant_number":"W1260-N35"},{"grant_number":"I02979-N35","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Persistence and stability of geometric complexes"},{"grant_number":"Z00342","name":"Mathematics, Computer Science","call_identifier":"FWF","_id":"268116B8-B435-11E9-9278-68D0E5697425"}],"volume":332,"related_material":{"link":[{"relation":"software","url":"https://github.com/laraost/BananaPersist"}]},"date_created":"2025-07-13T22:01:22Z","external_id":{"arxiv":["2405.17920"]},"oa_version":"Published Version","publication":"41st International Symposium on Computational Geometry","language":[{"iso":"eng"}],"_id":"20006","file":[{"file_name":"2025_LIPIcs.SoCG_Ost.pdf","access_level":"open_access","content_type":"application/pdf","relation":"main_file","creator":"dernst","file_id":"20017","date_updated":"2025-07-14T08:23:38Z","success":1,"date_created":"2025-07-14T08:23:38Z","file_size":834623,"checksum":"3a4a7a707a56e0cfdf51428782dee55a"}],"status":"public","scopus_import":"1","title":"Banana trees for the persistence in time series experimentally","publication_status":"published","date_updated":"2025-12-30T11:04:33Z","OA_type":"gold","ddc":["000"],"author":[{"last_name":"Ost","full_name":"Ost, Lara","first_name":"Lara"},{"first_name":"Sebastiano","orcid":"0000-0001-6249-0832","full_name":"Cultrera di Montesano, Sebastiano","id":"34D2A09C-F248-11E8-B48F-1D18A9856A87","last_name":"Cultrera di Montesano"},{"orcid":"0000-0002-9823-6833","first_name":"Herbert","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"}],"month":"06","type":"conference","file_date_updated":"2025-07-14T08:23:38Z","conference":{"location":"Kanazawa, Japan","end_date":"2025-06-27","name":"SoCG: Symposium on Computational Geometry","start_date":"2025-06-23"},"doi":"10.4230/LIPIcs.SoCG.2025.71","oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"article_number":"71","acknowledgement":"Lara Ost: Supported by the Vienna Graduate School on Computational Optimization\r\n(VGSCO), FWF project no. W1260-N35.\r\nSebastiano Cultrera di Montesano: Supported by the Eric and Wendy Schmidt Center at the Broad Institute of MIT and Harvard.\r\nHerbert Edelsbrunner: Partially supported by the Wittgenstein Prize, FWF grant no. Z 342-N31,\r\nand by the DFG Collaborative Research Center TRR 109, FWF grant no. I 02979-N35.","has_accepted_license":"1","corr_author":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Ost L, Cultrera di Montesano S, Edelsbrunner H. 2025. Banana trees for the persistence in time series experimentally. 41st International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 332, 71.","chicago":"Ost, Lara, Sebastiano Cultrera di Montesano, and Herbert Edelsbrunner. “Banana Trees for the Persistence in Time Series Experimentally.” In <i>41st International Symposium on Computational Geometry</i>, Vol. 332. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2025.71\">https://doi.org/10.4230/LIPIcs.SoCG.2025.71</a>.","apa":"Ost, L., Cultrera di Montesano, S., &#38; Edelsbrunner, H. (2025). Banana trees for the persistence in time series experimentally. In <i>41st International Symposium on Computational Geometry</i> (Vol. 332). Kanazawa, Japan: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2025.71\">https://doi.org/10.4230/LIPIcs.SoCG.2025.71</a>","ieee":"L. Ost, S. Cultrera di Montesano, and H. Edelsbrunner, “Banana trees for the persistence in time series experimentally,” in <i>41st International Symposium on Computational Geometry</i>, Kanazawa, Japan, 2025, vol. 332.","mla":"Ost, Lara, et al. “Banana Trees for the Persistence in Time Series Experimentally.” <i>41st International Symposium on Computational Geometry</i>, vol. 332, 71, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2025.71\">10.4230/LIPIcs.SoCG.2025.71</a>.","short":"L. Ost, S. Cultrera di Montesano, H. Edelsbrunner, in:, 41st International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025.","ama":"Ost L, Cultrera di Montesano S, Edelsbrunner H. Banana trees for the persistence in time series experimentally. In: <i>41st International Symposium on Computational Geometry</i>. Vol 332. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2025. doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2025.71\">10.4230/LIPIcs.SoCG.2025.71</a>"},"alternative_title":["LIPIcs"],"department":[{"_id":"HeEd"}],"article_processing_charge":"Yes","publication_identifier":{"isbn":["9783959773706"],"eissn":["1868-8969"]},"quality_controlled":"1","arxiv":1,"day":"20","OA_place":"publisher","intvolume":"       332","date_published":"2025-06-20T00:00:00Z"}