Related papers: Universal Distances for Extended Persistence
We believe three ingredients are needed for further progress in persistence and its use: invariants not relying on decomposition theorems to go beyond 1-dimension, outcomes suitable for statistical analysis and a setup adopted for…
One of the central notions to emerge from the study of persistent homology is that of interleaving distance. It has found recent applications in symplectic and contact geometry, sheaf theory, computational geometry, and phylogenetics. Here…
This paper presents a generalization of the Wasserstein distance for both persistence diagrams and merge trees [20], [66] that takes advantage of the regions of their topological features in the input domain. Specifically, we redefine the…
In this paper we deal with infinite-dimensional nonlinear forward complete dynamical systems which are subject to external disturbances. We first extend the well-known Datko lemma to the framework of the considered class of systems. Thanks…
A method to apply and visualize persistent homology of time series is proposed. The method captures persistent features in space and time, in contrast to the existing procedures, where one usually chooses one while keeping the other fixed.…
We introduce and investigate a new notion of resilience in graph spanners. Let $S$ be a spanner of a graph $G$. Roughly speaking, we say that a spanner $S$ is resilient if all its point-to-point distances are resilient to edge failures.…
Let $\Delta \ge 3$ be fixed, $n \ge n_\Delta$ be a large integer. It is a classical result that $\Delta$--regular expanders on $n$ vertices are not embeddable as geometric (distance) graphs into Euclidean space of dimension less than $c…
This paper concerns piecewise-smooth maps on $\mathbb{R}^d$ that are continuous but not differentiable on switching manifolds (where the functional form of the map changes). The stability of fixed points on switching manifolds is…
Let $G=(V,E)$ be a finite, simple, connected, combinatorial graph on $n$ vertices and let $D \in \mathbb{R}^{n \times n}$ be its graph distance matrix $D_{ij} = d(v_i, v_j)$. Steinerberger (J. Graph Theory, 2023) empirically observed that…
We introduce the persistent homotopy type distance dHT to compare real valued functions defined on possibly different homotopy equivalent topological spaces. The underlying idea in the definition of dHT is to measure the minimal shift that…
Metric graphs are special types of metric spaces used to model and represent simple, ubiquitous, geometric relations in data such as biological networks, social networks, and road networks. We are interested in giving a qualitative…
Exploiting geometric structure to improve the asymptotic complexity of discrete assignment problems is a well-studied subject. In contrast, the practical advantages of using geometry for such problems have not been explored. We implement…
The larger the distance to instability from a matrix is, the more robustly stable the associated autonomous dynamical system is in the presence of uncertainties and typically the less severe transient behavior its solution exhibits.…
We study an interplay between delay and discontinuous hysteresis in dynamical systems. After having established existence and uniqueness of solutions, we focus on the analysis of stability of periodic solutions. The main object we study is…
The kinetic data structure (KDS) framework is a powerful tool for maintaining various geometric configurations of continuously moving objects. In this work, we introduce the kinetic hourglass, a novel KDS implementation designed to compute…
We consider random walk among iid, uniformly elliptic conductances on $\mathbb Z^d$, and prove the Einstein relation (see Theorem 1). It says that the derivative of the velocity of a biased walk as a function of the bias equals the…
It is known that the famous Feigenbaum-Coullet-Tresser period doubling universality has a counterpart for area-preserving maps of ${\fR}^2$. A renormalization approach has been used in \cite{EKW1} and \cite{EKW2} in a computer-assisted…
Distance measures play an important role in shape classification and data analysis problems. Topological distances based on Reeb graphs and persistence diagrams have been employed to obtain effective algorithms in shape matching and scalar…
We define persistent homology groups over any set of spaces which have inclusions defined so that the corresponding directed graph between the spaces is acyclic, as well as along any subgraph of this directed graph. This method…
The Steiner distance of a graph, introduced by Chartrand, Oellermann, Tian and Zou in 1989, is a natural generalization of the concept of classical graph distance. For a connected graph $G$ of order at least $2$ and $S\subseteq V(G)$, the…