Topological Complex Systems

Project Period: 2012-10-01 – 2015-09-30
Externally Funded
Acronym
TOPOSYS
Principal Investigator
Herbert Edelsbrunner
Department(s)
Edelsbrunner Group
Description
In dynamics, local behaviour is often very unstable, while global behaviour often is immensely hard to derive from local knowledge. Traditionally, topology has been used in abstracting the local behaviour into qualitative classes of behaviour -- while we cannot describe the path a particular flow will take around a strange attractor in a chaotic system, we can often say meaningful things about the trajectory as an entirety, and its abstract properties. We propose to use computational topology, which takes notions from algebraic topology and adapts and extends them into more algorithmic forms, to enrich the study of the dynamics of multi-scale complex systems. With the algorithmic approach, we are able to consider inverse problems, such as reconstructing dynamical behaviorus from discrete point samples. This is the right approach to take for complex systems, where the precise behaviour is difficult if not impossible to analyse analytically. In particular we will extend the technique of persistence to include ideas from dynamical systems, as well as incorporating category theory and statistics. Persistence is inherently multi-scale, and provides a framework that will support the analysis of multi-scale systems, category theory provides a platform for a unified theory and joint abstraction layers, and statistics allows us to provide quality measures, inferences, and provide confidence intervals and variance measures for our analyses. The combination of these four areas: category theory, statistics, and dynamical systems with computational topology as the joint platform for the three other components, will allow for a mathematically rigorous description of the dynamics of a system from a local to a global scale. In this framework, multi-scale features have a natural place, and the focus on computation and algorithmics means we can easily verify and validate our theory. We propose to do this on two datasets, capturing robot configuration spaces and social media.
Grant Number
318493
Funding Organisation
FP7_Cooperation

17 Publications

2014 | Conference Paper | IST-REx-ID: 2153   OA
Induced matchings of barcodes and the algebraic stability of persistence
U. Bauer, M. Lesnick, in:, Proceedings of the Annual Symposium on Computational Geometry, ACM, 2014, pp. 355–364.
View | DOI | Download (ext.)
 
2016 | Journal Article | IST-REx-ID: 1662
Approximation and convergence of the intrinsic volume
H. Edelsbrunner, F. Pausinger, Advances in Mathematics 287 (2016) 674–703.
View | Files available | DOI
 
2016 | Journal Article | IST-REx-ID: 1295
Multiple covers with balls II: Weighted averages
H. Edelsbrunner, M. Iglesias Ham, Electronic Notes in Discrete Mathematics 54 (2016) 169–174.
View | DOI
 
2014 | Journal Article | IST-REx-ID: 2255
Stable length estimates of tube-like shapes
H. Edelsbrunner, F. Pausinger, Journal of Mathematical Imaging and Vision 50 (2014) 164–177.
View | Files available | DOI
 
2014 | Conference Paper | IST-REx-ID: 2043   OA
Distributed computation of persistent homology
U. Bauer, M. Kerber, J. Reininghaus, in:, C. McGeoch, U. Meyer (Eds.), Proceedings of the Workshop on Algorithm Engineering and Experiments, Society of Industrial and Applied Mathematics, 2014, pp. 31–38.
View | DOI | Download (ext.)
 
2014 | Conference Paper | IST-REx-ID: 2156   OA
Measuring distance between Reeb graphs
U. Bauer, X. Ge, Y. Wang, in:, Proceedings of the Annual Symposium on Computational Geometry, ACM, 2014, pp. 464–473.
View | DOI | Download (ext.)
 
2015 | Journal Article | IST-REx-ID: 1805
Homological reconstruction and simplification in R3
D. Attali, U. Bauer, O. Devillers, M. Glisse, A. Lieutier, Computational Geometry: Theory and Applications 48 (2015) 606–621.
View | Files available | DOI
 
2014 | Conference Paper | IST-REx-ID: 2155   OA
The morse theory of Čech and Delaunay filtrations
U. Bauer, H. Edelsbrunner, in:, Proceedings of the Annual Symposium on Computational Geometry, ACM, 2014, pp. 484–490.
View | DOI | Download (ext.)
 
2015 | Journal Article | IST-REx-ID: 2035   OA
The persistent homology of a self-map
H. Edelsbrunner, G. Jablonski, M. Mrozek, Foundations of Computational Mathematics 15 (2015) 1213–1244.
View | Files available | DOI
 
2017 | Conference Paper | IST-REx-ID: 836
Finding eigenvalues of self-maps with the Kronecker canonical form
M. Ethier, G. Jablonski, M. Mrozek, in:, I. Kotsireas, E. Martínez-Moro (Eds.), Springer, 2017, pp. 119–136.
View | DOI
 
2017 | Journal Article | IST-REx-ID: 1072   OA
The Morse theory of Čech and delaunay complexes
U. Bauer, H. Edelsbrunner, Transactions of the American Mathematical Society 369 (2017) 3741–3762.
View | Download (ext.)
 
2017 | Journal Article | IST-REx-ID: 1173   OA
The Voronoi functional is maximized by the Delaunay triangulation in the plane
H. Edelsbrunner, A. Glazyrin, O. Musin, A. Nikitenko, Combinatorica 37 (2017) 887–910.
View | DOI | Download (ext.)
 
2015 | Conference Paper | IST-REx-ID: 1495   OA
Relaxed disk packing
H. Edelsbrunner, M. Iglesias Ham, V. Kurlin, in:, Proceedings of the 27th Canadian Conference on Computational Geometry, 2015, pp. 128–135.
View | Download (ext.)
 
2017 | Journal Article | IST-REx-ID: 1433
Phat - Persistent homology algorithms toolbox
U. Bauer, M. Kerber, J. Reininghaus, H. Wagner, Journal of Symbolic Computation 78 (2017) 76–90.
View | DOI
 
2014 | Book Chapter | IST-REx-ID: 2044   OA
Clear and Compress: Computing Persistent Homology in Chunks
U. Bauer, M. Kerber, J. Reininghaus, in:, P.-T. Bremer, I. Hotz, V. Pascucci, R. Peikert (Eds.), Topological Methods in Data Analysis and Visualization III, Springer, 2014, pp. 103–117.
View | DOI | Download (ext.)
 
2018 | Journal Article | IST-REx-ID: 530   OA
Multiple covers with balls I: Inclusion–exclusion
H. Edelsbrunner, M. Iglesias Ham, Computational Geometry: Theory and Applications 68 (2018) 119–133.
View | Files available | DOI
 
2017 | Journal Article | IST-REx-ID: 718
Expected sizes of poisson Delaunay mosaics and their discrete Morse functions
H. Edelsbrunner, A. Nikitenko, M. Reitzner, Advances in Applied Probability 49 (2017) 745–767.
View | Files available | DOI | Download (ext.)