Related papers: Stable comparison of multidimensional persistent h…
Persistent homology, a technique from computational topology, has recently shown strong empirical performance in the context of graph classification. Being able to capture long range graph properties via higher-order topological features,…
We extend the basic formalism of mimetic-metric-torsion gravity theory, in a way that the mimetic scalar field can manifest itself geometrically as the source of not only the trace mode of torsion, but also its axial (or, pseudo-trace)…
Continuing the study of Hamiltonian pseudo-rotations of projective spaces, we focus on the conjecture that the fixed-point data set (the actions and the linearized flows at one-periodic orbits) of a pseudo-rotation exactly matches that data…
This article gives an up-to-date account of the theory of discrete group actions on non-Riemannian homogeneous spaces. As an introduction of the motifs of this article, we begin by reviewing the current knowledge of possible global forms of…
The diffusive transport distance, a novel pseudo-metric between probability measures on the real line, is introduced. It generalizes Martingale optimal transport, and forms a hierarchy with the Hellinger and the Wasserstein metrics. We…
In many robotics applications, it is necessary to compute not only the distance between the robot and the environment, but also its derivative - for example, when using control barrier functions. However, since the traditional Euclidean…
Persistent homology is a popular technique in topological data analysis that tracks the lifespans of homological features in a nested sequence of spaces. This data is typically presented in a multi-set called a persistence diagram or a…
The stability of persistence diagrams is among the most important results in applied and computational topology. Most results in the literature phrase stability in terms of the bottleneck distance between diagrams and the $\infty$-norm of…
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…
Persistent homology was shown by Carlsson and Zomorodian to be homology of graded chain complexes with coefficients in the graded ring $\kk[t]$. As such, the behavior of persistence modules -- graded modules over $\kk[t]$ is an important…
Symmetry is ubiquitous throughout nature and can often give great insights into the formation, structure and stability of objects studied by mathematicians, physicists, chemists and biologists. However, perfect symmetry occurs rarely so…
Temporal difference (TD) learning is a foundational algorithm in reinforcement learning (RL). For nearly forty years, TD learning has served as a workhorse for applied RL as well as a building block for more complex and specialized…
Symmetry-protected topological (SPT) phases are gapped short-range-entangled quantum phases with a symmetry $G$, which can all be smoothly connected to the trivial product states if we break the symmetry. It has been shown that a large…
Information networks are becoming increasingly popular to capture complex relationships across various disciplines, such as social networks, citation networks, and biological networks. The primary challenge in this domain is measuring…
\v{C}ech Persistence diagrams (PDs) are topological descriptors routinely used to capture the geometry of complex datasets. They are commonly compared using the Wasserstein distances $OT_{p}$; however, the extent to which PDs are stable…
Dynamics in delayed differential equations (DDEs) is a well studied problem mainly because DDEs arise in models in many areas of science including biology, physiology, population dynamics and engineering. The change of nature in the…
In this paper we introduce a statistic, the persistent homology transform (PHT), to model surfaces in $\mathbb{R}^3$ and shapes in $\mathbb{R}^2$. This statistic is a collection of persistence diagrams - multiscale topological summaries…
This is a revised version of the author's PhD thesis, including the corrections by the examiners. It also includes a few additional small corrections. In this thesis the objects of study are classifying spaces of groups with stabilisers in…
The stable torsion length in a group is the stable word length with respect to the set of all torsion elements. We show that the stable torsion length vanishes in crystallographic groups. We then give a linear programming algorithm to…
We propose a functorial framework for persistent homology based on finite topological spaces and their associated posets. Starting from a finite metric space, we associate a filtration of finite topologies whose structure maps are…