Related papers: A Closed Formula for the Interleaving Distance of …
In the persistent homology of filtrations, the indecomposable decompositions provide the persistence diagrams. However, in almost all cases of multidimensional persistence, the classification of all indecomposable modules is known to be a…
The natural pseudo-distance of spaces endowed with filtering functions is precious for shape classification and retrieval; its optimal estimate coming from persistence diagrams is the bottleneck distance, which unfortunately suffers from…
The study of persistent homology has contributed new insights and perspectives into a variety of interesting problems in science and engineering. Work in this domain relies on the result that any finitely-indexed persistence module of…
We demonstrate that an equivalence of categories using $\varepsilon$-interleavings as a fundamental component exists between the model of persistence modules as graded modules over a polynomial ring and the model of persistence modules as…
Useful approximation formulae for radiation impedance are given for the reflection coefficients of both infinitely flanged and unflanged rigid-walled cylindrical ducts. The expressions guarantee that simple but necessary physical and…
The rapid collapse of a polymer, due to external forces or changes in solvent, yields a long-lived `crumpled globule.' The conjectured fractal structure shaped by hierarchical collapse dynamics has proved difficult to establish, even with…
Given a metric pair $(X,A)$, i.e. a metric space $X$ and a distinguished closed set $A \subset X$, one may construct in a functorial way a pointed pseudometric space $\mathcal{D}_\infty(X,A)$ of persistence diagrams equipped with the…
In this paper we give a survey of methods used to calculate values of resistance distance (also known as effective resistance) in graphs. Resistance distance has played a prominent role not only in circuit theory and chemistry, but also in…
Computing the Fr\'{e}chet distance for surfaces is a surprisingly hard problem and the only known algorithm is limited to computing it between flat surfaces. We adapt this algorithm to create one for computing the Fr\'{e}chet distance for a…
The problem of intermittency in developed hydrodynamic turbulence is considered. Explicit formulae taking into account effects of finite size of the inertial range are presented for the whole set of intermittency exponents. The formulae fit…
The Persistent Homology Transform (PHT) summarizes a shape in $\mathbb{R}^m$ by collecting persistence diagrams obtained from linear height filtrations in all directions on $\mathbb{S}^{m-1}$. It enjoys strong theoretical guarantees,…
This paper addresses two questions: (a) can we identify a sensible class of 2-parameter persistence modules on which the rank invariant is complete? (b) can we determine efficiently whether a given 2-parameter persistence module belongs to…
An exact upper bound on the sum of squared nearest-neighbor distances between points in a rectangle is given.
We calculate the mean end-to-end distance ($R$) of a self-avoiding polymer encapsulated in an infinitely long cylinder with radius $D$. A self-consistent perturbation theory is used to calculate $R$ as a function of $D$ for impenetrable…
Given strong local Dirichlet forms and $\mathbb{R}^N$-valued functions on a metrizable space, we introduce the concepts of geodesic distance and intrinsic distance on the basis of these objects. They are defined in a geometric and an…
In this work, we present a generalization of extended persistent homology to filtrations of graded sub-groups by defining relative homology in this setting. Our work provides a more comprehensive and flexible approach to get an algebraic…
We give a self-contained treatment of the theory of persistence modules indexed over the real line. We give new proofs of the standard results. Persistence diagrams are constructed using measure theory. Linear algebra lemmas are simplified…
Persistent homology is a way of determining the topological properties of a data set. It is well known that each persistence module admits the structure of a representation of a finite totally ordered set. In previous work, the authors…
In this paper, we show that the pointwise finite-dimensional two-parameter persistence module $\mathbb{HF}_*^{(\bullet,\bullet]}$, defined in terms of interlevel filtered Floer homology, is rectangle-decomposable. This allows for the…
In topological data analysis (TDA), persistence diagrams have been a succesful tool. To compare them, Wasserstein and Bottleneck distances are commonly used. We address the shortcomings of these metrics and show a way to investigate them in…