Related papers: SL_2(R)-developments and Signature Asymptotics for…
The aim of this article is to develop an explicit procedure that enables one to reconstruct any $C^1$ path (at natural parametrization) from its signature. We also explicitly quantify the distance between the reconstructed path and the…
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…
Two graphs are isomorphic exactly when they admit the same number of homomorphisms from every graph. Hence, a graph is recognized up to isomorphism by homomorphism counts over the class of all graphs. Restricting to a specific graph class…
Lov\'asz (1967) showed that two graphs $G$ and $H$ are isomorphic if and only if they are homomorphism indistinguishable over the class of all graphs, i.e. for every graph $F$, the number of homomorphisms from $F$ to $G$ equals the number…
We establish a universal approximation theorem for signatures of rough paths that are not necessarily weakly geometric. By extending the path with time and its rough path bracket terms, we prove that linear functionals of the signature of…
We prove that a continuous path with finite length in a real Banach space cannot have infinitely many zero components in its signature unless it is tree-like. In particular, this allows us to strengthen a limit theorem for signature…
Sampling-based motion planners have proven to be efficient solutions to a variety of high-dimensional, geometrically complex motion planning problems with applications in several domains. The traditional view of these approaches is that…
We introduce a crossed module of piecewise linear surfaces and study the signature homomorphism, defined as the surface holonomy of a universal translation invariant $2$-connection. This provides a transform whereby surfaces are represented…
In this article we introduce the insertion method for reconstructing the path from its signature, i.e. inverting the signature of a path. For this purpose, we prove that a converging upper bound exists for the difference between the…
Suppose that $\gamma$ and $\sigma$ are two continuous bounded variation paths which take values in a finite-dimensional inner product space $V$. Recent papers have introduced the truncated and the untruncated signature kernel of $\gamma$…
Path signatures embed trajectories into tensor algebra and constitute a universal, non-parametric representation of paths; however, in the standard form, they collapse temporal structure into a single global object, which limits their…
A signed graph $\Gamma$ is said to be determined by its spectrum if every signed graph with the same spectrum as $\Gamma$ is switching isomorphic with $\Gamma$. Here it is proved that the path $P_n$, interpreted as a signed graph, is…
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…
Solutions to linear controlled differential equations can be expressed in terms of iterated path integrals of the driving path. This collection of iterated integrals encodes essentially all information about the driving path. While upper…
We characterize the signature of piecewise continuously differentiable paths transformed by a polynomial map in terms of the signature of the original path. For this aim, we define recursively an algebra homomorphism between two shuffle…
The signature of a $p$-weakly geometric rough path summarises a path up to a generalised notion of reparameterisation. The quotient space of equivalence classes on which the signature is constant yields unparameterised path space. The study…
Matrix congruence extends naturally to the setting of tensors. We apply methods from tensor decomposition, algebraic geometry and numerical optimization to this group action. Given a tensor in the orbit of another tensor, we compute a…
A drawing in the plane ($\mathbb{R}^2$) of a graph $G=(V,E)$ equipped with a function $\gamma: V \rightarrow \mathbb{N}$ is \emph{$x$-bounded} if (i) $x(u) <x(v)$ whenever $\gamma(u)<\gamma(v)$ and (ii) $\gamma(u)\leq\gamma(w)\leq…
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 introduce a new feature map for barcodes that arise in persistent homology computation. The main idea is to first realize each barcode as a path in a convenient vector space, and to then compute its path signature which takes values in…