{"type":"dissertation","project":[{"_id":"2561EBF4-B435-11E9-9278-68D0E5697425","grant_number":"I02979-N35","call_identifier":"FWF","name":"Persistence and stability of geometric complexes"},{"name":"Wittgenstein Award - Herbert Edelsbrunner","call_identifier":"FWF","grant_number":"Z00342","_id":"268116B8-B435-11E9-9278-68D0E5697425"}],"ddc":["514","004"],"tmp":{"short":"CC BY (4.0)","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)"},"citation":{"mla":"Draganov, Ondrej. Structures and Computations in Topological Data Analysis. Institute of Science and Technology Austria, 2025, doi:10.15479/at:ista:18979.","apa":"Draganov, O. (2025). Structures and computations in topological data analysis. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:18979","chicago":"Draganov, Ondrej. “Structures and Computations in Topological Data Analysis.” Institute of Science and Technology Austria, 2025. https://doi.org/10.15479/at:ista:18979.","ieee":"O. Draganov, “Structures and computations in topological data analysis,” Institute of Science and Technology Austria, 2025.","ista":"Draganov O. 2025. Structures and computations in topological data analysis. Institute of Science and Technology Austria.","short":"O. Draganov, Structures and Computations in Topological Data Analysis, Institute of Science and Technology Austria, 2025.","ama":"Draganov O. Structures and computations in topological data analysis. 2025. doi:10.15479/at:ista:18979"},"year":"2025","day":"03","related_material":{"record":[{"id":"18981","status":"public","relation":"part_of_dissertation"},{"status":"public","relation":"part_of_dissertation","id":"15091"}]},"oa":1,"doi":"10.15479/at:ista:18979","keyword":["topological data analysis","chromatic point set","alpha complex","persistent homology","six pack","sheaf","microlocal discrete Morse","injective resolution","collapse","knot","discrete Morse theory"],"OA_place":"repository","date_published":"2025-02-03T00:00:00Z","abstract":[{"lang":"eng","text":"Topological Data Analysis (TDA) is a discipline utilizing the mathematical field of topology to study data, most prominently collections of point sets. This thesis summarizes three projects related to computations in TDA.\r\n\r\nThe first one establishes a variant of TDA for chromatic point sets, where each point is given a color. For example, we are given positions of cells within a tumor microenvironment, and color the cancerous cells red, and the immune cells blue.\r\n\r\nThe aim is then to give a quantitative description of how the two or more sets of points spatially interact. Building on image, kernel and cokernel variants of persistent homology, we suggest six-packs of persistent diagrams as such a descriptor.\r\n\r\nWe describe a construction of a chromatic alpha complex, which enables efficient computation of several variants of the six-packs. We give topological descriptions of natural subcomplexes of the chromatic alpha complex, and show that the radii of the simplices form a discrete Morse function. Finally, we provide an implementation of the presented chromatic TDA pipeline.\r\n\r\nThe second part aims to translate a powerful tool of sheaf theory to elementary terms using labeled matrices. The goal is to enable their use in computational settings. We show that derived categories of sheaves over finite posets have, up to isomorphism, unique objects---minimal injective resolutions---and give a concrete algorithm to compute them. We further describe simple algorithms to compute derived pushforwards and pullbacks for monotonic maps, and their proper variants for inclusions, and demonstrate their tractability by providing an implementation. Finally, we suggest a discrete definition of microsupport and show desirable properties inspired by discrete Morse theory.\r\n\r\nIn the last part, we present a collection of observations about collapses. We give a characterization of collapsibility in terms of unitriangular submatrices of the boundary matrix, a cotree-tree decomposition, and the optimal solution to a variant of the Procrustes problem. We establish relation between dual collapses and relative Morse theory and pose several open questions. Finally, focusing on complexes embedded in the three-dimensional Euclidean space, we describe a relation between the collapsibility and the triviality of a polygonal knot."}],"corr_author":"1","alternative_title":["ISTA Thesis"],"publisher":"Institute of Science and Technology Austria","_id":"18979","degree_awarded":"PhD","title":"Structures and computations in topological data analysis","author":[{"orcid":"0000-0003-0464-3823","full_name":"Draganov, Ondrej","last_name":"Draganov","first_name":"Ondrej","id":"2B23F01E-F248-11E8-B48F-1D18A9856A87"}],"publication_identifier":{"issn":["2663-337X"]},"department":[{"_id":"GradSch"},{"_id":"HeEd"}],"publication_status":"published","supervisor":[{"last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert"}],"acknowledgement":"The research presented in this thesis was funded with the Wittgenstein Prize,\r\nAustrian Science Fund (FWF), grant no. Z 342-N31, and from the DFG Collaborative Research\r\nCenter TRR 109, ‘Discretization in Geometry and Dynamics’, Austrian Science Fund (FWF),\r\ngrant no. I 02979-N35.\r\n","page":"140","file":[{"file_id":"18983","date_created":"2025-01-31T16:58:30Z","access_level":"closed","file_size":11899491,"date_updated":"2025-01-31T16:58:30Z","relation":"source_file","creator":"odragano","checksum":"af6567e5d35e5eb330b8925ae37f1998","content_type":"application/zip","file_name":"Thesis.zip"},{"file_id":"19000","date_created":"2025-02-04T16:22:07Z","access_level":"open_access","creator":"odragano","relation":"main_file","file_size":8857514,"date_updated":"2025-02-04T16:22:07Z","checksum":"c3fef68e35b9dc2020b2ca6006da6343","content_type":"application/pdf","file_name":"Thesis.pdf"}],"file_date_updated":"2025-02-04T16:22:07Z","article_processing_charge":"No","has_accepted_license":"1","language":[{"iso":"eng"}],"month":"02","oa_version":"Published Version","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","date_created":"2025-01-31T17:04:40Z","date_updated":"2025-02-07T11:29:42Z","status":"public"}