---
OA_place: publisher
OA_type: hybrid
PlanS_conform: '1'
_id: '22291'
abstract:
- lang: eng
  text: Persistent homology is a fundamental tool in Topological Data Analysis. The
    associated algebraic structure is the persistence module, a sequence of vector
    spaces connected by linear maps. Persistence modules admit a complete and fast-to-compute
    invariant known as the persistence diagram. However, this is no longer the case
    for maps between persistence modules (i.e. persistence maps). We propose a new
    invariant for persistence maps, consisting of a partial matching between the persistence
    diagrams of the domain and codomain modules. We show that this invariant is additive
    with respect to the direct sum decomposition of persistence maps, is more discriminative
    than the image module, and is computable in cubic time. Furthermore, we provide
    an implementation and demonstrate its efficiency by integrating it with edge collapse
    techniques for flag complexes (e.g., Vietoris–Rips complexes). As a key technical
    contribution, we describe how to induce a persistence map between two flag complexes
    that have been independently simplified via edge collapses, even when a direct
    simplicial map between them is no longer available.
acknowledgement: This project was partially funded by MCIN/AEI and the NextGenerationEU/PRTR,
  under project TED2021-129438B-I00. The authors thank IMUS-Maria de Maeztu grant
  CEX2024-001517-M - Apoyo a Unidades de Excelencia María de Maeztu for supporting
  this research, funded by MICIU/AEI/ 10.13039/501100011033. The authors would also
  like to thank Lars M Salbu for fruitful discussions regarding the operators from
  Definition 4.1 and their relation with the order relations introduced in Definition
  3.2.
article_number: '102598'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Rocio
  full_name: Gonzalez-Diaz, Rocio
  last_name: Gonzalez-Diaz
- first_name: Manuel
  full_name: Soriano Trigueros, Manuel
  id: 15ebd7cf-15bf-11ee-aebd-bb4bb5121ea8
  last_name: Soriano Trigueros
  orcid: 0000-0003-2449-1433
- first_name: Alvaro
  full_name: Torras-Casas, Alvaro
  last_name: Torras-Casas
citation:
  ama: Gonzalez-Diaz R, Soriano Trigueros M, Torras-Casas A. Additive partial matchings
    induced by persistence maps. <i>Journal of Symbolic Computation</i>. 2026;138.
    doi:<a href="https://doi.org/10.1016/j.jsc.2026.102598">10.1016/j.jsc.2026.102598</a>
  apa: Gonzalez-Diaz, R., Soriano Trigueros, M., &#38; Torras-Casas, A. (2026). Additive
    partial matchings induced by persistence maps. <i>Journal of Symbolic Computation</i>.
    Elsevier. <a href="https://doi.org/10.1016/j.jsc.2026.102598">https://doi.org/10.1016/j.jsc.2026.102598</a>
  chicago: Gonzalez-Diaz, Rocio, Manuel Soriano Trigueros, and Alvaro Torras-Casas.
    “Additive Partial Matchings Induced by Persistence Maps.” <i>Journal of Symbolic
    Computation</i>. Elsevier, 2026. <a href="https://doi.org/10.1016/j.jsc.2026.102598">https://doi.org/10.1016/j.jsc.2026.102598</a>.
  ieee: R. Gonzalez-Diaz, M. Soriano Trigueros, and A. Torras-Casas, “Additive partial
    matchings induced by persistence maps,” <i>Journal of Symbolic Computation</i>,
    vol. 138. Elsevier, 2026.
  ista: Gonzalez-Diaz R, Soriano Trigueros M, Torras-Casas A. 2026. Additive partial
    matchings induced by persistence maps. Journal of Symbolic Computation. 138, 102598.
  mla: Gonzalez-Diaz, Rocio, et al. “Additive Partial Matchings Induced by Persistence
    Maps.” <i>Journal of Symbolic Computation</i>, vol. 138, 102598, Elsevier, 2026,
    doi:<a href="https://doi.org/10.1016/j.jsc.2026.102598">10.1016/j.jsc.2026.102598</a>.
  short: R. Gonzalez-Diaz, M. Soriano Trigueros, A. Torras-Casas, Journal of Symbolic
    Computation 138 (2026).
corr_author: '1'
das_tickbox: '1'
dataavailabilitystatement: The code used for the computational experiments is available
  in https://github.com/Cimagroup/IBloFunMatch
date_created: 2026-07-13T09:43:38Z
date_published: 2026-06-23T00:00:00Z
date_updated: 2026-07-13T12:00:07Z
day: '23'
ddc:
- '500'
department:
- _id: HeEd
doi: 10.1016/j.jsc.2026.102598
external_id:
  arxiv:
  - '2006.11100'
has_accepted_license: '1'
intvolume: '       138'
keyword:
- Persistence module
- Persistence map
- Persistent homology
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
main_file_link:
- open_access: '1'
  url: https://doi.org/10.1016/j.jsc.2026.102598
mathsc:
- 55N31
- 16G20
month: '06'
oa: 1
oa_version: Published Version
publication: Journal of Symbolic Computation
publication_identifier:
  eissn:
  - 1095-855X
  issn:
  - 0747-7171
publication_status: epub_ahead
publisher: Elsevier
quality_controlled: '1'
researchdata_availability: yes
scopus_import: '1'
status: public
supplementarymaterial: no
title: Additive partial matchings induced by persistence maps
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: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 138
year: '2026'
...
---
OA_place: publisher
OA_type: hybrid
PlanS_conform: '1'
_id: '22648'
abstract:
- lang: eng
  text: Bifurcation characterizes the qualitative changes in parameterized dynamical
    systems and is one of the major topics in the field. In this work, we study combinatorial
    bifurcations within the framework of combinatorial dynamical systems—a young but
    already well-established theory. We introduce the Conley–Morse persistence barcode,
    a compact algebraic descriptor of combinatorial bifurcations. This barcode captures
    structural changes in a dynamical system at the level of Morse decompositions
    and provides a characterization of the nature of observed transitions in terms
    of the Conley index. The construction of the Conley–Morse persistence barcode
    builds upon ideas from topological persistence. Specifically, we consider a persistence
    module obtained from the Conley index of invariant sets indexed over a poset.
    Using gentle algebras, we prove that this module decomposes into simple intervals
    (bars) and compute them by adapting the zigzag persistence algorithm to our purpose.
acknowledgement: M.L. acknowledges support from the European Union’s Horizon 2020
  research and innovation programme under the Marie Skłodowska-Curie Grant Agreement
  No. 101034413. T.D. acknowledges the support of NSF funds CCF-2437030 and DMS-2301360.
  The authors would like to thank the anonymous reviewers for their careful reading
  of the paper. Their feedback significantly improved the quality of the article.
  T.D. and M.L. would like to acknowledge many thought-provoking discussions with
  Marian Mrozek on combinatorial dynamical systems and their continuations. M.S.T.
  would like to thank Álvaro Sánchez for insightful discussions about representation
  theory. Open access funding provided by Institute of Science and Technology (IST
  Austria).
article_processing_charge: Yes (via OA deal)
article_type: original
arxiv: 1
author:
- first_name: Tamal K.
  full_name: Dey, Tamal K.
  last_name: Dey
- first_name: Michał
  full_name: Lipiński, Michał
  id: dfffb474-4317-11ee-8f5c-fe3fc95a425e
  last_name: Lipiński
  orcid: 0000-0001-9789-9750
- first_name: Manuel
  full_name: Soriano Trigueros, Manuel
  id: 15ebd7cf-15bf-11ee-aebd-bb4bb5121ea8
  last_name: Soriano Trigueros
  orcid: 0000-0003-2449-1433
citation:
  ama: 'Dey TK, Lipiński M, Soriano Trigueros M. Conley-Morse persistence barcode:
    A homological signature of combinatorial bifurcations. <i>Foundations of Computational
    Mathematics</i>. 2026. doi:<a href="https://doi.org/10.1007/s10208-026-09766-6">10.1007/s10208-026-09766-6</a>'
  apa: 'Dey, T. K., Lipiński, M., &#38; Soriano Trigueros, M. (2026). Conley-Morse
    persistence barcode: A homological signature of combinatorial bifurcations. <i>Foundations
    of Computational Mathematics</i>. Springer. <a href="https://doi.org/10.1007/s10208-026-09766-6">https://doi.org/10.1007/s10208-026-09766-6</a>'
  chicago: 'Dey, Tamal K., Michał Lipiński, and Manuel Soriano Trigueros. “Conley-Morse
    Persistence Barcode: A Homological Signature of Combinatorial Bifurcations.” <i>Foundations
    of Computational Mathematics</i>. Springer, 2026. <a href="https://doi.org/10.1007/s10208-026-09766-6">https://doi.org/10.1007/s10208-026-09766-6</a>.'
  ieee: 'T. K. Dey, M. Lipiński, and M. Soriano Trigueros, “Conley-Morse persistence
    barcode: A homological signature of combinatorial bifurcations,” <i>Foundations
    of Computational Mathematics</i>. Springer, 2026.'
  ista: 'Dey TK, Lipiński M, Soriano Trigueros M. 2026. Conley-Morse persistence barcode:
    A homological signature of combinatorial bifurcations. Foundations of Computational
    Mathematics.'
  mla: 'Dey, Tamal K., et al. “Conley-Morse Persistence Barcode: A Homological Signature
    of Combinatorial Bifurcations.” <i>Foundations of Computational Mathematics</i>,
    Springer, 2026, doi:<a href="https://doi.org/10.1007/s10208-026-09766-6">10.1007/s10208-026-09766-6</a>.'
  short: T.K. Dey, M. Lipiński, M. Soriano Trigueros, Foundations of Computational
    Mathematics (2026).
corr_author: '1'
das_tickbox: '0'
date_created: 2026-08-05T06:11:30Z
date_published: 2026-08-04T00:00:00Z
date_updated: 2026-08-11T06:13:33Z
day: '04'
ddc:
- '500'
department:
- _id: HeEd
doi: 10.1007/s10208-026-09766-6
ec_funded: 1
external_id:
  arxiv:
  - '2504.17105'
has_accepted_license: '1'
keyword:
- Multivector field
- Conley index
- Morse decomposition
- Bifurcation
- Continuation
- Zigzag persistence
- Persistence barcode
- Gentle algebra
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.1007/s10208-026-09766-6
month: '08'
oa: 1
oa_version: Published Version
project:
- _id: fc2ed2f7-9c52-11eb-aca3-c01059dda49c
  call_identifier: H2020
  grant_number: '101034413'
  name: 'IST-BRIDGE: International postdoctoral program'
publication: Foundations of Computational Mathematics
publication_identifier:
  eissn:
  - 1615-3383
  issn:
  - 1615-3375
publication_status: epub_ahead
publisher: Springer
quality_controlled: '1'
researchdata_availability: no
scopus_import: '1'
status: public
supplementarymaterial: yes
title: 'Conley-Morse persistence barcode: A homological signature of combinatorial
  bifurcations'
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: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2026'
...
---
OA_place: publisher
OA_type: gold
_id: '22299'
abstract:
- lang: eng
  text: The depth poset of a filtered Lefschetz complex reflects the dependencies
    between the cancellations of different shallow birth-death pairs. Using the fast
    algorithms for computing the depth poset in [Edelsbrunner et al., 2026] and for
    updating the persistence diagram under transpositions in [Cohen-Steiner et al.,
    2006], we give a complete case analysis of how transpositions of cells in the
    filter affect the depth poset. In addition, we present statistics on the depth
    poset for random point data and its sensitivity to the transpositions that occur
    in random straight-line homotopies.
acknowledgement: "The authors thank Jakub Leśkiewicz and Bartosz Furmanek for discussions\r\nthat
  helped improve the paper. Herbert Edelsbrunner: DFG Collaborative Research Center
  TRR 109, Austrian Science\r\nFund (FWF), grant no. I 02979-N35\r\nMichał Lipiński:
  European Union’s Horizon 2020 research and innovation programme under the\r\nMarie
  Skłodowska-Curie Grant Agreement No. 101034413\r\nMarian Mrozek: Polish National
  Science Center under Opus Grant 2019/35/B/ST1/00874 and Opus\r\nGrant 2025/57/B/ST1/00550"
alternative_title:
- LIPIcs
article_number: 41:1-41:18
article_processing_charge: Yes
arxiv: 1
author:
- first_name: Herbert
  full_name: Edelsbrunner, Herbert
  id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
  last_name: Edelsbrunner
  orcid: 0000-0002-9823-6833
- first_name: Michał
  full_name: Lipiński, Michał
  id: dfffb474-4317-11ee-8f5c-fe3fc95a425e
  last_name: Lipiński
  orcid: 0000-0001-9789-9750
- first_name: Marian
  full_name: Mrozek, Marian
  last_name: Mrozek
  orcid: 0000-0002-0619-6417
- first_name: Manuel
  full_name: Soriano Trigueros, Manuel
  id: 15ebd7cf-15bf-11ee-aebd-bb4bb5121ea8
  last_name: Soriano Trigueros
  orcid: 0000-0003-2449-1433
- first_name: Fedor
  full_name: Zimin, Fedor
  id: afd27eda-91c1-11f0-aad8-c6edbec24c04
  last_name: Zimin
citation:
  ama: 'Edelsbrunner H, Lipiński M, Mrozek M, Soriano Trigueros M, Zimin F. The depth
    poset under transpositions in the filter. In: <i>42nd International Symposium
    on Computational Geometry</i>. Vol 367. Schloss Dagstuhl - Leibniz-Zentrum für
    Informatik; 2026. doi:<a href="https://doi.org/10.4230/LIPICS.SOCG.2026.41">10.4230/LIPICS.SOCG.2026.41</a>'
  apa: 'Edelsbrunner, H., Lipiński, M., Mrozek, M., Soriano Trigueros, M., &#38; Zimin,
    F. (2026). The depth poset under transpositions in the filter. In <i>42nd International
    Symposium on Computational Geometry</i> (Vol. 367). New Brunswick, NJ, United
    States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href="https://doi.org/10.4230/LIPICS.SOCG.2026.41">https://doi.org/10.4230/LIPICS.SOCG.2026.41</a>'
  chicago: Edelsbrunner, Herbert, Michał Lipiński, Marian Mrozek, Manuel Soriano Trigueros,
    and Fedor Zimin. “The Depth Poset under Transpositions in the Filter.” In <i>42nd
    International Symposium on Computational Geometry</i>, Vol. 367. Schloss Dagstuhl
    - Leibniz-Zentrum für Informatik, 2026. <a href="https://doi.org/10.4230/LIPICS.SOCG.2026.41">https://doi.org/10.4230/LIPICS.SOCG.2026.41</a>.
  ieee: H. Edelsbrunner, M. Lipiński, M. Mrozek, M. Soriano Trigueros, and F. Zimin,
    “The depth poset under transpositions in the filter,” in <i>42nd International
    Symposium on Computational Geometry</i>, New Brunswick, NJ, United States, 2026,
    vol. 367.
  ista: 'Edelsbrunner H, Lipiński M, Mrozek M, Soriano Trigueros M, Zimin F. 2026.
    The depth poset under transpositions in the filter. 42nd International Symposium
    on Computational Geometry. SoCG: Symposium on Computational Geometry, LIPIcs,
    vol. 367, 41:1-41:18.'
  mla: Edelsbrunner, Herbert, et al. “The Depth Poset under Transpositions in the
    Filter.” <i>42nd International Symposium on Computational Geometry</i>, vol. 367,
    41:1-41:18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026, doi:<a href="https://doi.org/10.4230/LIPICS.SOCG.2026.41">10.4230/LIPICS.SOCG.2026.41</a>.
  short: H. Edelsbrunner, M. Lipiński, M. Mrozek, M. Soriano Trigueros, F. Zimin,
    in:, 42nd International Symposium on Computational Geometry, Schloss Dagstuhl
    - Leibniz-Zentrum für Informatik, 2026.
conference:
  end_date: 2026-06-05
  location: New Brunswick, NJ, United States
  name: 'SoCG: Symposium on Computational Geometry'
  start_date: 2026-06-02
corr_author: '1'
das_tickbox: '0'
date_created: 2026-07-13T09:56:38Z
date_published: 2026-05-27T00:00:00Z
date_updated: 2026-08-12T09:02:56Z
day: '27'
ddc:
- '500'
department:
- _id: HeEd
- _id: GradSch
doi: 10.4230/LIPICS.SOCG.2026.41
ec_funded: 1
external_id:
  arxiv:
  - '2511.21961'
file:
- access_level: open_access
  checksum: 9dfb96ee66985c724b499b0e5888dc8e
  content_type: application/pdf
  creator: dernst
  date_created: 2026-07-14T06:08:05Z
  date_updated: 2026-07-14T06:08:05Z
  file_id: '22329'
  file_name: 2026_LIPIcSSoCG_Edelsbrunner.pdf
  file_size: 2902144
  relation: main_file
  success: 1
file_date_updated: 2026-07-14T06:08:05Z
has_accepted_license: '1'
intvolume: '       367'
keyword:
- Algebraic topology
- Lefschetz complexes
- persistent homology
- vines and vineyards
- birth-death pairs
- shallow pairs
- relations
- partial orders
- transpositions
- Theory of computation → Computational geometry
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
project:
- _id: 2561EBF4-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: I02979-N35
  name: Persistence and stability of geometric complexes
- _id: fc2ed2f7-9c52-11eb-aca3-c01059dda49c
  call_identifier: H2020
  grant_number: '101034413'
  name: 'IST-BRIDGE: International postdoctoral program'
publication: 42nd International Symposium on Computational Geometry
publication_identifier:
  eissn:
  - 1868-8969
  isbn:
  - '9783959774185'
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
researchdata_availability: no
scopus_import: '1'
status: public
supplementarymaterial: no
title: The depth poset under transpositions in the filter
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: 367
year: '2026'
...
---
OA_place: publisher
OA_type: hybrid
_id: '20729'
abstract:
- lang: eng
  text: 'Persistence modules (defined as a sequence of vector spaces and linear maps
    between them) are a key tool in topological data analysis. They are easy to interpret
    and fast to compute. However, when considering persistence maps (i.e. maps between
    persistence modules), these properties are lost. We propose a new invariant for
    persistence maps consisting of a partial matching such that: it is easy to interpret,
    it is more discriminative than the image of the persistence map, and can be calculated
    with cubical complexity.'
acknowledgement: Álvaro Torras-Casas contract is funded by the French Agence Nationale
  de la Recherche through the project reference ANR-22-CPJ1-0047-01. Rocio Gonzalez-Diaz
  is partially funded by the European Union under grant agreement no. 101070028-2
  (REXASI-PRO).
article_processing_charge: Yes (in subscription journal)
author:
- first_name: Rocio
  full_name: Gonzalez-Diaz, Rocio
  last_name: Gonzalez-Diaz
- first_name: Manuel
  full_name: Soriano Trigueros, Manuel
  id: 15ebd7cf-15bf-11ee-aebd-bb4bb5121ea8
  last_name: Soriano Trigueros
  orcid: 0000-0003-2449-1433
- first_name: Alvaro
  full_name: Torras-Casas, Alvaro
  last_name: Torras-Casas
citation:
  ama: 'Gonzalez-Diaz R, Soriano Trigueros M, Torras-Casas A. Additive partial matchings
    for persistent homology. In: <i>Proceedings of the 2025 International Symposium
    on Symbolic and Algebraic Computation</i>. Association for Computing Machinery;
    2025:188-196. doi:<a href="https://doi.org/10.1145/3747199.3747561">10.1145/3747199.3747561</a>'
  apa: 'Gonzalez-Diaz, R., Soriano Trigueros, M., &#38; Torras-Casas, A. (2025). Additive
    partial matchings for persistent homology. In <i>Proceedings of the 2025 International
    Symposium on Symbolic and Algebraic Computation</i> (pp. 188–196). Guanajuato,
    Mexico: Association for Computing Machinery. <a href="https://doi.org/10.1145/3747199.3747561">https://doi.org/10.1145/3747199.3747561</a>'
  chicago: Gonzalez-Diaz, Rocio, Manuel Soriano Trigueros, and Alvaro Torras-Casas.
    “Additive Partial Matchings for Persistent Homology.” In <i>Proceedings of the
    2025 International Symposium on Symbolic and Algebraic Computation</i>, 188–96.
    Association for Computing Machinery, 2025. <a href="https://doi.org/10.1145/3747199.3747561">https://doi.org/10.1145/3747199.3747561</a>.
  ieee: R. Gonzalez-Diaz, M. Soriano Trigueros, and A. Torras-Casas, “Additive partial
    matchings for persistent homology,” in <i>Proceedings of the 2025 International
    Symposium on Symbolic and Algebraic Computation</i>, Guanajuato, Mexico, 2025,
    pp. 188–196.
  ista: 'Gonzalez-Diaz R, Soriano Trigueros M, Torras-Casas A. 2025. Additive partial
    matchings for persistent homology. Proceedings of the 2025 International Symposium
    on Symbolic and Algebraic Computation. ISSAC: International Symposium on Symbolic
    and Algebraic Computation, 188–196.'
  mla: Gonzalez-Diaz, Rocio, et al. “Additive Partial Matchings for Persistent Homology.”
    <i>Proceedings of the 2025 International Symposium on Symbolic and Algebraic Computation</i>,
    Association for Computing Machinery, 2025, pp. 188–96, doi:<a href="https://doi.org/10.1145/3747199.3747561">10.1145/3747199.3747561</a>.
  short: R. Gonzalez-Diaz, M. Soriano Trigueros, A. Torras-Casas, in:, Proceedings
    of the 2025 International Symposium on Symbolic and Algebraic Computation, Association
    for Computing Machinery, 2025, pp. 188–196.
conference:
  end_date: 2025-08-01
  location: Guanajuato, Mexico
  name: 'ISSAC: International Symposium on Symbolic and Algebraic Computation'
  start_date: 2025-07-28
corr_author: '1'
date_created: 2025-12-07T23:02:01Z
date_published: 2025-11-10T00:00:00Z
date_updated: 2025-12-09T13:46:42Z
day: '10'
ddc:
- '510'
department:
- _id: HeEd
doi: 10.1145/3747199.3747561
file:
- access_level: open_access
  checksum: 1c299cca165a20e2518afe4fda63dbf1
  content_type: application/pdf
  creator: dernst
  date_created: 2025-12-09T13:43:17Z
  date_updated: 2025-12-09T13:43:17Z
  file_id: '20751'
  file_name: 2025_ISSAC_GonzalezDiaz.pdf
  file_size: 761617
  relation: main_file
  success: 1
file_date_updated: 2025-12-09T13:43:17Z
has_accepted_license: '1'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
page: 188-196
publication: Proceedings of the 2025 International Symposium on Symbolic and Algebraic
  Computation
publication_identifier:
  isbn:
  - '9798400720758'
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
scopus_import: '1'
status: public
title: Additive partial matchings for persistent homology
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
year: '2025'
...
---
_id: '14739'
abstract:
- lang: eng
  text: Attempts to incorporate topological information in supervised learning tasks
    have resulted in the creation of several techniques for vectorizing persistent
    homology barcodes. In this paper, we study thirteen such methods. Besides describing
    an organizational framework for these methods, we comprehensively benchmark them
    against three well-known classification tasks. Surprisingly, we discover that
    the best-performing method is a simple vectorization, which consists only of a
    few elementary summary statistics. Finally, we provide a convenient web application
    which has been designed to facilitate exploration and experimentation with various
    vectorization methods.
acknowledgement: "The work of Maria-Jose Jimenez, Eduardo Paluzo-Hidalgo and Manuel
  Soriano-Trigueros was supported in part by the Spanish grant Ministerio de Ciencia
  e Innovacion under Grants TED2021-129438B-I00 and PID2019-107339GB-I00, and in part
  by REXASI-PRO H-EU project, call HORIZON-CL4-2021-HUMAN-01-01 under Grant 101070028.
  The work of\r\nMaria-Jose Jimenez was supported by a grant of Convocatoria de la
  Universidad de Sevilla para la recualificacion del sistema universitario español,
  2021-23, funded by the European Union, NextGenerationEU. The work of Vidit Nanda
  was supported in part by EPSRC under Grant EP/R018472/1 and in part by US AFOSR
  under Grant FA9550-22-1-0462. \r\nWe are grateful to the team of GUDHI and TEASPOON
  developers, for their work and their support. We are also grateful to Streamlit
  for providing extra resources to deploy the web app\r\nonline on Streamlit community
  cloud. We thank the anonymous referees for their helpful suggestions."
article_processing_charge: Yes (in subscription journal)
article_type: original
author:
- first_name: Dashti
  full_name: Ali, Dashti
  last_name: Ali
- first_name: Aras
  full_name: Asaad, Aras
  last_name: Asaad
- first_name: Maria-Jose
  full_name: Jimenez, Maria-Jose
  last_name: Jimenez
- first_name: Vidit
  full_name: Nanda, Vidit
  last_name: Nanda
- first_name: Eduardo
  full_name: Paluzo-Hidalgo, Eduardo
  last_name: Paluzo-Hidalgo
- first_name: Manuel
  full_name: Soriano Trigueros, Manuel
  id: 15ebd7cf-15bf-11ee-aebd-bb4bb5121ea8
  last_name: Soriano Trigueros
  orcid: 0000-0003-2449-1433
citation:
  ama: Ali D, Asaad A, Jimenez M-J, Nanda V, Paluzo-Hidalgo E, Soriano Trigueros M.
    A survey of vectorization methods in topological data analysis. <i>IEEE Transactions
    on Pattern Analysis and Machine Intelligence</i>. 2023;45(12):14069-14080. doi:<a
    href="https://doi.org/10.1109/tpami.2023.3308391">10.1109/tpami.2023.3308391</a>
  apa: Ali, D., Asaad, A., Jimenez, M.-J., Nanda, V., Paluzo-Hidalgo, E., &#38; Soriano
    Trigueros, M. (2023). A survey of vectorization methods in topological data analysis.
    <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>. IEEE. <a
    href="https://doi.org/10.1109/tpami.2023.3308391">https://doi.org/10.1109/tpami.2023.3308391</a>
  chicago: Ali, Dashti, Aras Asaad, Maria-Jose Jimenez, Vidit Nanda, Eduardo Paluzo-Hidalgo,
    and Manuel Soriano Trigueros. “A Survey of Vectorization Methods in Topological
    Data Analysis.” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>.
    IEEE, 2023. <a href="https://doi.org/10.1109/tpami.2023.3308391">https://doi.org/10.1109/tpami.2023.3308391</a>.
  ieee: D. Ali, A. Asaad, M.-J. Jimenez, V. Nanda, E. Paluzo-Hidalgo, and M. Soriano
    Trigueros, “A survey of vectorization methods in topological data analysis,” <i>IEEE
    Transactions on Pattern Analysis and Machine Intelligence</i>, vol. 45, no. 12.
    IEEE, pp. 14069–14080, 2023.
  ista: Ali D, Asaad A, Jimenez M-J, Nanda V, Paluzo-Hidalgo E, Soriano Trigueros
    M. 2023. A survey of vectorization methods in topological data analysis. IEEE
    Transactions on Pattern Analysis and Machine Intelligence. 45(12), 14069–14080.
  mla: Ali, Dashti, et al. “A Survey of Vectorization Methods in Topological Data
    Analysis.” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>,
    vol. 45, no. 12, IEEE, 2023, pp. 14069–80, doi:<a href="https://doi.org/10.1109/tpami.2023.3308391">10.1109/tpami.2023.3308391</a>.
  short: D. Ali, A. Asaad, M.-J. Jimenez, V. Nanda, E. Paluzo-Hidalgo, M. Soriano
    Trigueros, IEEE Transactions on Pattern Analysis and Machine Intelligence 45 (2023)
    14069–14080.
date_created: 2024-01-08T09:59:46Z
date_published: 2023-12-01T00:00:00Z
date_updated: 2025-09-09T14:08:56Z
day: '01'
ddc:
- '000'
department:
- _id: HeEd
doi: 10.1109/tpami.2023.3308391
external_id:
  isi:
  - '001104973300002'
file:
- access_level: open_access
  checksum: 465c28ef0b151b4b1fb47977ed5581ab
  content_type: application/pdf
  creator: dernst
  date_created: 2024-01-08T10:09:14Z
  date_updated: 2024-01-08T10:09:14Z
  file_id: '14740'
  file_name: 2023_IEEEToP_Ali.pdf
  file_size: 2370988
  relation: main_file
  success: 1
file_date_updated: 2024-01-08T10:09:14Z
has_accepted_license: '1'
intvolume: '        45'
isi: 1
issue: '12'
keyword:
- Applied Mathematics
- Artificial Intelligence
- Computational Theory and Mathematics
- Computer Vision and Pattern Recognition
- Software
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
page: 14069-14080
publication: IEEE Transactions on Pattern Analysis and Machine Intelligence
publication_identifier:
  eissn:
  - 1939-3539
  issn:
  - 0162-8828
publication_status: published
publisher: IEEE
quality_controlled: '1'
scopus_import: '1'
status: public
title: A survey of vectorization methods in topological data analysis
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: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 45
year: '2023'
...