Related papers: Topologies on unparameterised path space
The signature of a path is a non-commutative power series whose coefficients are given by certain iterated integrals over the path coordinates. This series almost uniquely characterizes the path up to translation and reparameterization.…
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,…
The symmetries of paths in a manifold $M$ are classified with respect to a given pointwise proper action of a Lie group $G$ on $M$. Here, paths are embeddings of a compact interval into $M$. There are at least two types of symmetries:…
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…
Two channels are said to be equivalent if they are degraded from each other. The space of equivalent channels with input alphabet $X$ and output alphabet $Y$ can be naturally endowed with the quotient of the Euclidean topology by the…
Rough path theory provides one with the notion of signature, a graded family of tensors which characterise, up to a negligible equivalence class, and ordered stream of vector-valued data. In the last few years, use of the signature has…
Persistent homology (PH) has been widely applied to graph data to extract topological features. However, little attention has been paid to how different distance functions on a graph affect the resulting persistence barcodes and their…
Over the past decade, the importance of the 1D signature which can be seen as a functional defined along a path, has been pivotal in both path-wise stochastic calculus and the analysis of time series data. By considering an image as a…
The signature of a path is a sequence of tensors which allows to uniquely reconstruct the path. By employing the geometric theory of nonlinear systems of ordinary differential equations, we find necessary and sufficient algebraic conditions…
Connectedness, path connectedness, and uniform connectedness are well-known concepts. In the traditional presentation of these concepts there is a substantial difference between connectedness and the other two notions, namely connectedness…
We want to investigate 'spaces' where paths have a 'weight', or 'cost', expressing length, duration, price, energy, etc. The weight function is not assumed to be invariant up to path-reversion. Thus, 'weighted algebraic topology' can be…
A reparametrization (of a continuous path) is given by a surjective weakly increasing self-map of the unit interval. We show that the monoid of reparametrizations (with respect to compositions) can be understood via ``stop-maps'' that allow…
We derive the equations of chains for path geometries on surfaces by solving the equivalence problem of a related structure: sub-Riemannian geometry of signature $(1,1)$ on a contact 3-manifold. This approach is significantly simpler than…
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…
Motivated by persistent homology and topological data analysis, we consider formal sums on a metric space with a distinguished subset. These formal sums, which we call persistence diagrams, have a canonical 1-parameter family of metrics…
Signatures provide a succinct description of certain features of paths in a reparametrization invariant way. We propose a method for classifying shapes based on signatures, and compare it to current approaches based on the SRV transform and…
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…
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…
For a signature L with at least one constant symbol, an L-structure is called minimal if it has no proper substructures. Let S_L be the set of isomorphism types of minimal L-structures. The elements of S_L can be identified with…
We investigate path-, ray- and branch spaces of trees, certain topological spaces naturally associated with order theoretic trees, and provide topological characterisations for these spaces in terms of the existence of certain kinds of…