arXiv subjects

Benedikt Fluhr

Publications and source records attributed to Benedikt Fluhr.

5 recordsLinked to original sources

arXiv2025

Group Cross-Correlations with Faintly Constrained Filters

Group convolutional layers with respect to some group $G$ are modeled by convolutions or cross-correlations with a filter, and they provide the fundamental building block for group convolutional neural networks. For entirely unconstrained filters and $G$ a non-abelian group, any hidden layer of such a network requires as many nodes as vertices in a fine enough discretization of $G$. In order to reduce the necessary number of nodes, certain constraints on filters were proposed in the literature. We propose weaker constraints retaining this benefit while also resolving an incompatibility previous constraints have for group actions with non-compact stabilizers. Moreover, we generalize previous results to group actions that are not necessarily transitive, and we weaken the common assumption that $G$ is unimodular.

math.DS↗

arXiv2024

Universal Distances for Extended Persistence

The extended persistence diagram is an invariant of piecewise linear functions, which is known to be stable under perturbations of functions with respect to the bottleneck distance as introduced by Cohen-Steiner, Edelsbrunner, and Harer. We address the question of universality, which asks for the largest possible stable distance on extended persistence diagrams, showing that a more discriminative variant of the bottleneck distance is universal. Our result applies more generally to settings where persistence diagrams are considered only up to a certain degree. We achieve our results by establishing a functorial construction and several characteristic properties of relative interlevel set homology, which mirror the classical Eilenberg--Steenrod axioms. Finally, we contrast the bottleneck distance with the interleaving distance of sheaves on the real line by showing that the latter is not intrinsic, let alone universal. This particular result has the further implication that the interleaving distance of Reeb graphs is not intrinsic either.

math.AT↗

arXiv2023

Tight quasi-universality of Reeb graph distances

We establish tight bi-Lipschitz bounds certifying quasi-universality (universality up to a constant factor) for various distances between Reeb graphs: the interleaving distance, the functional distortion distance, and the functional contortion distance. The definition of the latter distance is a novel contribution, and for the special case of contour trees we also prove strict universality of this distance. Furthermore, we prove that for the special case of merge trees the functional contortion distance coincides with the interleaving distance, yielding universality of all four distances in this case.

math.GT↗

arXiv2022

Relative Interlevel Set Cohomology Categorifies Extended Persistence Diagrams

The extended persistence diagram introduced by Cohen-Steiner, Edelsbrunner, and Harer is an invariant of real-valued continuous functions, which are $\mathbb{F}$-tame in the sense that all open interlevel sets have degree-wise finite-dimensional cohomology with coefficients in a fixed field $\mathbb{F}$. We show that relative interlevel set cohomology (RISC), which is based on the Mayer--Vietoris pyramid by Carlsson, de Silva, and Morozov, categorifies this invariant. More specifically, we define an abelian Frobenius category $\mathrm{pres}(\mathcal{J})$ of presheaves, which are presentable in a certain sense, such that the RISC $h(f)$ of an $\mathbb{F}$-tame function $f \colon X \rightarrow \mathbb{R}$ is an object of $\mathrm{pres}(\mathcal{J})$, and moreover the extended persistence diagram of $f$ uniquely determines - and is determined by - the corresponding element $[h(f)] \in K_0 (\mathrm{pres}(\mathcal{J}))$ in the Grothendieck group $K_0 (\mathrm{pres}(\mathcal{J}))$ of the abelian category $\mathrm{pres}(\mathcal{J})$. As an intermediate step we show that $\mathrm{pres}(\mathcal{J})$ is the abelianization of the (localized) category of complexes of $\mathbb{F}$-linear sheaves on $\mathbb{R}$, which are tame in the sense that sheaf cohomology of any open interval is finite-dimensional in each degree. This yields a close link between derived level set persistence by Curry, Kashiwara, and Schapira and the categorification of extended persistence diagrams.

math.AT↗

arXiv2022

Structure and Interleavings of Relative Interlevel Set Cohomology

The relative interlevel set cohomology (RISC) is an invariant of real-valued continuous functions closely related to the Mayer--Vietoris pyramid introduced by Carlsson, de Silva, and Morozov. As such, the relative interlevel set cohomology is a parametrization of the cohomology vector spaces of all open interlevel sets relative complements of closed interlevel sets. We provide a structure theorem, which applies to the RISC of real-valued continuous functions whose open interlevel sets have finite-dimensional cohomology in each degree. Moreover, we show this tameness assumption is in some sense equivalent to $q$-tameness as introduced by Chazal, de Silva, Glisse, and Oudot. Furthermore, we provide the notion of an interleaving for RISC and we show that it is stable in the sense that any space with two functions that are $δ$-close induces a $δ$-interleaving of the corresponding relative interlevel set cohomologies. Finally, we provide an elementary form of quantitative homotopy invariance for RISC.

math.AT↗