Related papers: Geodesics in persistence diagram space
We study intersections of projective convex sets in the sense of Steinitz. In a projective space, an intersection of a nonempty family of convex sets splits into multiple connected components each of which is a convex set. Hence, such an…
Geodesics deviation equation (GDE) is itroduced. In "adiabatic" approximation exact solution of the GDE if found. Perturbation theory in general case is formulated. Geometrical criterion of local instability which may lead to chaos is…
A shape of a combinatorial polytope is a convex embedding into Euclidean space. We provide necessary and sufficient conditions for a piecewise linear map between two shapes of the same polytope to be a compression (respectively a weak…
We show that large subsets of vector spaces over finite fields determine certain point configurations with prescribed distance structure. More specifically, we consider the complete graph with vertices as the points of $A \subseteq…
One of the most elusive challenges within the area of topological data analysis is understanding the distribution of persistence diagrams. Despite much effort, this is still largely an open problem. In this paper, we present a series of…
We introduce a theory of "patterns" in order to study geodesics in a certain class of group presentations. Using patterns we show that there does not exist a geodesic automatic structure for certain group presentations, and that certain…
Geodesic problems involve computing trajectories between prescribed initial and final states to minimize a user-defined measure of distance, cost, or energy. They arise throughout physics and engineering -- for instance, in determining…
In this note we continue our investigation of geodesics in the space of convex and plurisubharmonic functions. We show optimal regularity for geodesics joining two smooth strictly convex functions. We also investigate the regularity theory…
This paper is a review on recently found connection between geodesically equivalent metrics and integrable geodesic flows. Suppose two different metrics on one manifold have the same geodesics. We show that then the geodesic flows of these…
Variational analysis presents a unified theory encompassing in particular both smoothness and convexity. In a Euclidean space, convex sets and smooth manifolds both have straightforward local geometry. However, in the most basic hybrid case…
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…
We define the notion of near geodesic between points of a metric space when no geodesic exists, and use this to extend Recio-Mitter's notion of geodesic complexity to non-geodesic spaces. This has potential application to topological…
We define and study several new interleaving distances for persistent cohomology which take into account the algebraic structures of the cohomology of a space, for instance the cup product or the action of the Steenrod algebra. In…
This expository article discusses some connections between the geometry of a hyperbolic 3-manifold homotopy-equivalent to a surface, and the combinatorial properties of its end invariants. In particular a necessary and sufficient condition…
We consider planar directed last-passage percolation on the square lattice with general i.i.d. weights and study the geometry of the full set of semi-infinite geodesics in a typical realization of the random environment. The structure of…
Throughout this paper, a persistence diagram ${\cal P}$ is composed of a set $P$ of planar points (each corresponding to a topological feature) above the line $Y=X$, as well as the line $Y=X$ itself, i.e., ${\cal P}=P\cup\{(x,y)|y=x\}$.…
We provide an alternative, constructive proof that the collection $\mathcal{M}$ of isometry classes of compact metric spaces endowed with the Gromov-Hausdorff distance is a geodesic space. The core of our proof is a construction of explicit…
We investigate how effectively finite metric spaces can be distinguished by distance-based invariants. As model spaces, we consider regular polygons, cycle graphs, and their generalization, circular metric spaces, and as invariants we…
We introduce a persistence-type invariant for finite weighted graphs based on combinatorial multivector dynamics. For each threshold parameter, a relation matrix determines a graph multivector field, whose induced directed dynamics admits a…
We survey theoretical, algorithmic, and computational results at the intersection of distance geometry problems and mathematical programming, both with and without adjacencies as part of the input. While mathematical programming methods can…