Intrinsic Interleaving Distance for Merge Trees - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Preprints, Working Papers, ... Year : 2019

Intrinsic Interleaving Distance for Merge Trees

Ellen Gasparovic
  • Function : Author
Steve Y. Oudot
  • Function : Author
  • PersonId : 845393
Bei Wang
  • Function : Author
  • PersonId : 994406


Merge trees are a type of graph-based topological summary that tracks the evolution of connected components in the sublevel sets of scalar functions. They enjoy widespread applications in data analysis and scientific visualization. In this paper, we consider the problem of comparing two merge trees via the notion of interleaving distance in the metric space setting. We investigate various theoretical properties of such a metric. In particular, we show that the interleaving distance is intrinsic on the space of labeled merge trees and provide an algorithm to construct metric 1-centers for collections of labeled merge trees. We further prove that the intrinsic property of the interleaving distance also holds for the space of unlabeled merge trees. Our results are a first step toward performing statistics on graph-based topological summaries.

Dates and versions

hal-02425600 , version 1 (30-12-2019)



Ellen Gasparovic, Elizabeth Munch, Steve Y. Oudot, Katharine Turner, Bei Wang, et al.. Intrinsic Interleaving Distance for Merge Trees. 2019. ⟨hal-02425600⟩
82 View
0 Download



Gmail Mastodon Facebook X LinkedIn More