Related papers: Topologies on unparameterised rough path space
Rough path theory is focused on capturing and making precise the interactions between highly oscillatory and non-linear systems. It draws on the analysis of LC Young and the geometric algebra of KT Chen. The concepts and the uniform…
A marked metric measure space (mmm-space) is a triple (X,r,mu), where (X,r) is a complete and separable metric space and mu is a probability measure on XxI for some Polish space I of possible marks. We study the space of all (equivalence…
Cyclomatic complexity is an incompletely specified but mathematically principled software metric that can be usefully applied to both source and binary code. We consider the application of path homology as a stronger analogue of cyclomatic…
We study the properties of topological spaces $(X,\tau)$, where $X$ is a definable set in an o-minimal structure and the topology $\tau$ on $X$ has a basis that is (uniformly) definable. Examples of such spaces include the canonical…
The signature transform, defined by the formal tensor series of global iterated path integrals, is a homomorphism between the path space and the tensor algebra that has been studied in geometry, control theory, number theory as well as…
A topological space is called a submetrizable if it can be mapped onto a metrizable topological space by a continuous one-to-one map. In this paper we answer two questions concerning sequence-covering maps on submetrizable spaces.
Shape inference is classically ill-posed, because it involves a map from the (2D) image domain to the (3D) world. Standard approaches regularize this problem by either assuming a prior on lighting and rendering or restricting the domain,…
This paper develops a structural theory of unique shortest paths in real-weighted graphs. Our main goal is to characterize exactly which sets of node sequences, which we call path systems, can be realized as unique shortest paths in a graph…
Paths of persistence diagrams provide a summary of the dynamic topological structure of a one-parameter family of metric spaces. These summaries can be used to study and characterize the dynamic shape of data such as swarming behavior in…
We construct a topology on the class of pointed proper quantum metric spaces which generalizes the topology of the Gromov-Hausdorff distance on proper metric spaces, and the topology of the dual propinquity on Leibniz quantum compact metric…
We study topological properties of random metric spaces which arise by Lambda-coalescents. These are stochastic processes, which start with an infinite number of lines and evolve through multiple mergers in an exchangeable setting. We show…
Computational topology provides a tool, persistent homology, to extract quantitative descriptors from structured objects (images, graphs, point clouds, etc). These descriptors can then be involved in optimization problems, typically as a…
Inferring topological and geometrical information from data can offer an alternative perspective on machine learning problems. Methods from topological data analysis, e.g., persistent homology, enable us to obtain such information,…
Recently many papers on cone metric spaces have been appeared, and main topological properties of such spaces have been obtained. A cone metric space is Hausdorff, and first countable, so the topology of it coincides with a topology induced…
Despite the obvious similarities between the metrics used in topological data analysis and those of optimal transport, an optimal-transport based formalism to study persistence diagrams and similar topological descriptors has yet to come.…
We give a topological classification of quantum walks on an infinite 1D lattice, which obey one of the discrete symmetry groups of the tenfold way, have a gap around some eigenvalues at symmetry protected points, and satisfy a mild locality…
In this paper we examine two basic topological properties of partial metric spaces, namely compactness and completeness. Our main result claims that in these spaces compactness is equivalent to sequential compactness. We also show that…
This paper establishes a comprehensive concentration theory for truncated signatures of Gaussian rough paths. The signature of a path, defined as the collection of all iterated integrals, provides a complete description of its geometric…
Splines are central objects for the interpolation of discrete data via piecewise smooth paths. Their iterated-integral signature is an infinite collection of tensors which characterizes paths almost uniquely. We study truncations of this…
A path-following control algorithm enables a system's trajectories under its guidance to converge to and evolve along a given geometric desired path. There exist various such algorithms, but many of them can only guarantee local convergence…