[LIVRE][B] Computational topology for data analysis

TK Dey, Y Wang - 2022 - books.google.com
" In this chapter, we introduce some of the very basics that are used throughout the book.
First, we give the definition of a topological space and related notions of open and closed …

The theory of the interleaving distance on multidimensional persistence modules

M Lesnick - Foundations of Computational Mathematics, 2015 - Springer
In 2009, Chazal et al. introduced ϵ ϵ-interleavings of persistence modules. ϵ ϵ-
interleavings induce a pseudometric d_ I d I on (isomorphism classes of) persistence …

Scalar field comparison with topological descriptors: Properties and applications for scientific visualization

L Yan, TB Masood, R Sridharamurthy… - Computer Graphics …, 2021 - Wiley Online Library
In topological data analysis and visualization, topological descriptors such as persistence
diagrams, merge trees, contour trees, Reeb graphs, and Morse–Smale complexes play an …

Metrics for generalized persistence modules

P Bubenik, V De Silva, J Scott - Foundations of Computational …, 2015 - Springer
We consider the question of defining interleaving metrics on generalized persistence
modules over arbitrary preordered sets. Our constructions are functorial, which implies a …

Categorified reeb graphs

V De Silva, E Munch, A Patel - Discrete & Computational Geometry, 2016 - Springer
The Reeb graph is a construction which originated in Morse theory to study a real-valued
function defined on a topological space. More recently, it has been used in various …

Generalized persistence diagrams

A Patel - Journal of Applied and Computational Topology, 2018 - Springer
We generalize the persistence diagram of Cohen-Steiner, Edelsbrunner, and Harer to the
setting of constructible persistence modules valued in a symmetric monoidal category. We …

Generalized persistence diagrams for persistence modules over posets

W Kim, F Mémoli - Journal of Applied and Computational Topology, 2021 - Springer
When a category CC satisfies certain conditions, we define the notion of rank invariant for
arbitrary poset-indexed functors F: P → CF: P→ C from a category theory perspective. This …

Measuring distance between Reeb graphs

U Bauer, X Ge, Y Wang - Proceedings of the thirtieth annual symposium …, 2014 - dl.acm.org
We propose a metric for Reeb graphs, called the functional distortion distance. Under this
distance, the Reeb graph is stable against small changes of input functions. At the same …

Wasserstein distances, geodesics and barycenters of merge trees

M Pont, J Vidal, J Delon, J Tierny - IEEE Transactions on …, 2021 - ieeexplore.ieee.org
This paper presents a unified computational framework for the estimation of distances,
geodesics and barycenters of merge trees. We extend recent work on the edit distance 104 …

Principal geodesic analysis of merge trees (and persistence diagrams)

M Pont, J Vidal, J Tierny - IEEE Transactions on Visualization …, 2022 - ieeexplore.ieee.org
This article presents a computational framework for the Principal Geodesic Analysis of
merge trees (MT-PGA), a novel adaptation of the celebrated Principal Component Analysis …