Local equivalence and intrinsic metrics between Reeb graphs

DOI10.4230/LIPICS.SOCG.2017.25zbMATH Open1432.68504arXiv1703.02901MaRDI QIDQ4580099FDOQ4580099

Authors: Mathieu Carrière, Steve Y. Oudot 

Publication date: 13 August 2018

Abstract: As graphical summaries for topological spaces and maps, Reeb graphs are common objects in the computer graphics or topological data analysis literature. Defining good metrics between these objects has become an important question for applications, where it matters to quantify the extent by which two given Reeb graphs differ. Recent contributions emphasize this aspect, proposing novel distances such as {em functional distortion} or {em interleaving} that are provably more discriminative than the so-called {em bottleneck distance}, being true metrics whereas the latter is only a pseudo-metric. Their main drawback compared to the bottleneck distance is to be comparatively hard (if at all possible) to evaluate. Here we take the opposite view on the problem and show that the bottleneck distance is in fact good enough {em locally}, in the sense that it is able to discriminate a Reeb graph from any other Reeb graph in a small enough neighborhood, as efficiently as the other metrics do. This suggests considering the {em intrinsic metrics} induced by these distances, which turn out to be all {em globally} equivalent. This novel viewpoint on the study of Reeb graphs has a potential impact on applications, where one may not only be interested in discriminating between data but also in interpolating between them.

Full work available at URL: https://arxiv.org/abs/1703.02901

Recommendations

• Strong equivalence of the interleaving and functional distortion metrics for Reeb graphs
• Measuring distance between Reeb graphs (extended abstract)
• The Reeb graph edit distance is universal
• The relationship between the intrinsic Čech and persistence distortion distances for metric graphs
• Categorified Reeb graphs

zbMATH Keywords

topological data analysisextended persistenceReeb graphsinduced metrics

Mathematics Subject Classification ID

Persistent homology and applications, topological data analysis (55N31) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cited In (10)

• Statistical analysis and parameter selection for Mapper
• Structure and stability of the one-dimensional Mapper
• The relationship between the intrinsic Čech and persistence distortion distances for metric graphs
• Realizable piecewise linear paths of persistence diagrams with Reeb graphs
• Strong equivalence of the interleaving and functional distortion metrics for Reeb graphs
• Measuring distance between Reeb graphs (extended abstract)
• Topological data analysis and its usefulness for precision medicine studies
• Universal distances for extended persistence
• Generalized persistence diagrams for persistence modules over posets
• Labeled interleaving distance for Reeb graphs

This page was built for publication: Local equivalence and intrinsic metrics between Reeb graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4580099)