---
OA_place: publisher
OA_type: gold
_id: '20006'
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.
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."
alternative_title:
- LIPIcs
article_number: '71'
article_processing_charge: Yes
arxiv: 1
author:
- first_name: Lara
  full_name: Ost, Lara
  last_name: Ost
- first_name: Sebastiano
  full_name: Cultrera di Montesano, Sebastiano
  id: 34D2A09C-F248-11E8-B48F-1D18A9856A87
  last_name: Cultrera di Montesano
  orcid: 0000-0001-6249-0832
- first_name: Herbert
  full_name: Edelsbrunner, Herbert
  id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
  last_name: Edelsbrunner
  orcid: 0000-0002-9823-6833
citation:
  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>'
  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>'
  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>.
  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.
  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.'
  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.
conference:
  end_date: 2025-06-27
  location: Kanazawa, Japan
  name: 'SoCG: Symposium on Computational Geometry'
  start_date: 2025-06-23
corr_author: '1'
date_created: 2025-07-13T22:01:22Z
date_published: 2025-06-20T00:00:00Z
date_updated: 2025-12-30T11:04:33Z
day: '20'
ddc:
- '000'
department:
- _id: HeEd
doi: 10.4230/LIPIcs.SoCG.2025.71
external_id:
  arxiv:
  - '2405.17920'
file:
- access_level: open_access
  checksum: 3a4a7a707a56e0cfdf51428782dee55a
  content_type: application/pdf
  creator: dernst
  date_created: 2025-07-14T08:23:38Z
  date_updated: 2025-07-14T08:23:38Z
  file_id: '20017'
  file_name: 2025_LIPIcs.SoCG_Ost.pdf
  file_size: 834623
  relation: main_file
  success: 1
file_date_updated: 2025-07-14T08:23:38Z
has_accepted_license: '1'
intvolume: '       332'
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
month: '06'
oa: 1
oa_version: Published Version
project:
- _id: 9B9290DE-BA93-11EA-9121-9846C619BF3A
  grant_number: W1260-N35
  name: Vienna Graduate School on Computational Optimization
- _id: 2561EBF4-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: I02979-N35
  name: Persistence and stability of geometric complexes
- _id: 268116B8-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: Z00342
  name: Mathematics, Computer Science
publication: 41st International Symposium on Computational Geometry
publication_identifier:
  eissn:
  - 1868-8969
  isbn:
  - '9783959773706'
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
related_material:
  link:
  - relation: software
    url: https://github.com/laraost/BananaPersist
scopus_import: '1'
status: public
title: Banana trees for the persistence in time series experimentally
tmp:
  image: /images/cc_by.png
  legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
  name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
  short: CC BY (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 332
year: '2025'
...