More Like this

1. Measure-Theoretic Reeb Graphs and Reeb Spaces

   https://doi.org/10.4230/LIPIcs.SoCG.2024.80  

   Wang, Qingsong ; Ma, Guanqun ; Sridharamurthy, Raghavendra ; Wang, Bei ( June 2024 , 40th International Symposium on Computational Geometry (SoCG 2024), Leibniz International Proceedings in Informatics (LIPIcs))

   Mulzer, Wolfgang ; Phillips, Jeff M (Ed.)

   A Reeb graph is a graphical representation of a scalar function on a topological space that encodes the topology of the level sets. A Reeb space is a generalization of the Reeb graph to a multiparameter function. In this paper, we propose novel constructions of Reeb graphs and Reeb spaces that incorporate the use of a measure. Specifically, we introduce measure-theoretic Reeb graphs and Reeb spaces when the domain or the range is modeled as a metric measure space (i.e., a metric space equipped with a measure). Our main goal is to enhance the robustness of the Reeb graph and Reeb space in representing the topological features of a scalar field while accounting for the distribution of the measure. We first introduce a Reeb graph with local smoothing and prove its stability with respect to the interleaving distance. We then prove the stability of a Reeb graph of a metric measure space with respect to the measure, defined using the distance to a measure or the kernel distance to a measure, respectively. 

   more » « less
2. A Family of Metrics from the Truncated Smoothing of Reeb Graphs

   https://doi.org/10.4230/LIPIcs.SoCG.2021.22  

   Chambers, Erin Wolf ; Munch, Elizabeth ; Ophelders, Tim ( June 2021 , Forensic toxicology)

   Buchin, Kevin ; Colin de Verdi\` (Ed.)

   In this paper, we introduce an extension of smoothing on Reeb graphs, which we call truncated smoothing; this in turn allows us to define a new family of metrics which generalize the interleaving distance for Reeb graphs. Intuitively, we "chop off" parts near local minima and maxima during the course of smoothing, where the amount cut is controlled by a parameter τ. After formalizing truncation as a functor, we show that when applied after the smoothing functor, this prevents extensive expansion of the range of the function, and yields particularly nice properties (such as maintaining connectivity) when combined with smoothing for 0 ≤ τ ≤ 2ε, where ε is the smoothing parameter. Then, for the restriction of τ ∈ [0,ε], we have additional structure which we can take advantage of to construct a categorical flow for any choice of slope m ∈ [0,1]. Using the infrastructure built for a category with a flow, this then gives an interleaving distance for every m ∈ [0,1], which is a generalization of the original interleaving distance, which is the case m = 0. While the resulting metrics are not stable, we show that any pair of these for m, m' ∈ [0,1) are strongly equivalent metrics, which in turn gives stability of each metric up to a multiplicative constant. We conclude by discussing implications of this metric within the broader family of metrics for Reeb graphs. 

   more » « less
3. An Efficient Data Retrieval Parallel Reeb Graph Algorithm

   https://doi.org/10.3390/a13100258  

   Hajij, Mustafa ; Rosen, Paul ( October 2020 , Algorithms)

   null (Ed.)

   The Reeb graph of a scalar function that is defined on a domain gives a topologically meaningful summary of that domain. Reeb graphs have been shown in the past decade to be of great importance in geometric processing, image processing, computer graphics, and computational topology. The demand for analyzing large data sets has increased in the last decade. Hence, the parallelization of topological computations needs to be more fully considered. We propose a parallel augmented Reeb graph algorithm on triangulated meshes with and without a boundary. That is, in addition to our parallel algorithm for computing a Reeb graph, we describe a method for extracting the original manifold data from the Reeb graph structure. We demonstrate the running time of our algorithm on standard datasets. As an application, we show how our algorithm can be utilized in mesh segmentation algorithms. 

   more » « less
4. A polyfold proof of the Arnold conjecture

   https://doi.org/10.1007/s00029-021-00680-z  

   Filippenko, Benjamin ; Wehrheim, Katrin ( February 2022 , Selecta Mathematica)

   Abstract We give a detailed proof of the homological Arnold conjecture for nondegenerate periodic Hamiltonians on general closed symplectic manifolds M via a direct Piunikhin–Salamon–Schwarz morphism. Our constructions are based on a coherent polyfold description for moduli spaces of pseudoholomorphic curves in a family of symplectic manifolds degenerating from $${{\mathbb {C}}{\mathbb {P}}}^1\times M$$ C P 1 × M to $${{\mathbb {C}}}^+ \times M$$ C + × M and $${{\mathbb {C}}}^-\times M$$ C - × M , as developed by Fish–Hofer–Wysocki–Zehnder as part of the Symplectic Field Theory package. To make the paper self-contained we include all polyfold assumptions, describe the coherent perturbation iteration in detail, and prove an abstract regularization theorem for moduli spaces with evaluation maps relative to a countable collection of submanifolds. The 2011 sketch of this proof was joint work with Peter Albers, Joel Fish. 

   more » « less
5. Probabilistic convergence and stability of random mapper graphs

   https://doi.org/10.1007/s41468-020-00063-x  

   Brown, Adam ; Bobrowski, Omer ; Munch, Elizabeth ; Wang, Bei ( March 2021 , Journal of Applied and Computational Topology)

   null (Ed.)

   Abstract We study the probabilistic convergence between the mapper graph and the Reeb graph of a topological space $${\mathbb {X}}$$ X equipped with a continuous function $$f: {\mathbb {X}}\rightarrow \mathbb {R}$$ f : X → R . We first give a categorification of the mapper graph and the Reeb graph by interpreting them in terms of cosheaves and stratified covers of the real line $$\mathbb {R}$$ R . We then introduce a variant of the classic mapper graph of Singh et al. (in: Eurographics symposium on point-based graphics, 2007), referred to as the enhanced mapper graph, and demonstrate that such a construction approximates the Reeb graph of $$({\mathbb {X}}, f)$$ ( X , f ) when it is applied to points randomly sampled from a probability density function concentrated on $$({\mathbb {X}}, f)$$ ( X , f ) . Our techniques are based on the interleaving distance of constructible cosheaves and topological estimation via kernel density estimates. Following Munch and Wang (In: 32nd international symposium on computational geometry, volume 51 of Leibniz international proceedings in informatics (LIPIcs), Dagstuhl, Germany, pp 53:1–53:16, 2016), we first show that the mapper graph of $$({\mathbb {X}}, f)$$ ( X , f ) , a constructible $$\mathbb {R}$$ R -space (with a fixed open cover), approximates the Reeb graph of the same space. We then construct an isomorphism between the mapper of $$({\mathbb {X}},f)$$ ( X , f ) to the mapper of a super-level set of a probability density function concentrated on $$({\mathbb {X}}, f)$$ ( X , f ) . Finally, building on the approach of Bobrowski et al. (Bernoulli 23 (1):288–328, 2017b), we show that, with high probability, we can recover the mapper of the super-level set given a sufficiently large sample. Our work is the first to consider the mapper construction using the theory of cosheaves in a probabilistic setting. It is part of an ongoing effort to combine sheaf theory, probability, and statistics, to support topological data analysis with random data. 

   more » « less