Applied and Combinatorial Topology (Dagstuhl Seminar 24092)
This report documents the program and the outcomes of Dagstuhl Seminar 24092 "Applied and Combinatorial Topology".
The last twenty years of rapid development of Topological Data Analysis (TDA) have shown the need to analyze the shape of data to better understand the data. Since an explosion of new ideas in 2000’ including those of Persistent Homology and Mapper Algorithms, the community rushed to solve detailed theoretical questions related to the existing invariants. However, topology and geometry still have much to offer to the data science community. New tools and techniques are within reach, waiting to be brought over the fence to enrich our understanding and potential to analyze data. At the same time, the fields of Discrete Morse Theory (DMT) and Combinatorial Topology (CT) are developed in parallel with no strong connection to data-intensive TDA or to other statistical pipelines (e.g. machine learning).
This Dagstuhl Seminar brought together a number of experts in Discrete Morse Theory, Combinatorial Topology, Topological Data Analysis, and Statistics to (i) enhance the existing interactions between these fields on the one hand, and (ii) discuss the possibilities of adopting new invariants from algebra, geometry, and topology; in particular inspired by continuous and discrete Morse theory and combinatorial topology; to analyze and better understand the notion of shape of the data.
The different talks in the seminar included both introductory talks as well as current research expositions and proved fruitful for the open problem and break-out sessions. The topics that were discussed included
1) algorithmic aspects for efficient computation as well as Morse theoretic approximations
2) topological information gain of multiparameter persistence
3) understanding the magnitude function and its relation to graph problems.
Applied Topology
Topological Data Analysis
Discrete Morse Theory
Combinatorial Topology
Statistics
Theory of computation~Computational geometry
Mathematics of computing~Discrete mathematics
Information systems~Data structures
206-239
Regular Paper
Paweł
Dłotko
Paweł Dłotko
Polish Academy of Science, PL
Dmitry
Feichtner-Kozlov
Dmitry Feichtner-Kozlov
Universität Bremen, DE
Anastasios
Stefanou
Anastasios Stefanou
Universität Bremen, DE
Yusu
Wang
Yusu Wang
University of California, San Diego - La Jolla, US
Jan F
Senge
Jan F Senge
Universität Bremen, DE
10.4230/DagRep.14.2.206
Paweł Dłotko, Dmitry Feichtner-Kozlov, Anastasios Stefanou, Yusu Wang, and Jan F Senge
Creative Commons Attribution 4.0 International license
https://creativecommons.org/licenses/by/4.0/legalcode