Related papers: An isomorphism between branched and geometric roug…
The signature of a rectifiable path is a tensor series in the tensor algebra whose coefficients are definite iterated integrals of the path. The signature characterises the path up to a generalised form of reparametrisation. It is a…
The classical random walk isomorphism theorems relate the local times of a continuous-time random walk to the square of a Gaussian free field. A Gaussian free field is a spin system that takes values in Euclidean space, and this article…
We prove an algebraic version of the Gauge-Invariant Uniqueness Theorem, a result which gives information about the injectivity of certain homomorphisms between ${\mathbb Z}$-graded algebras. As our main application of this theorem, we…
Determining whether two graphs are structurally identical is a fundamental problem with applications spanning mathematics, computer science, chemistry, and network science. Despite decades of study, graph isomorphism remains a challenging…
We study harmonic morphisms of graphs as a natural discrete analogue of holomorphic maps between Riemann surfaces. We formulate a graph-theoretic analogue of the classical Riemann-Hurwitz formula, study the functorial maps on Jacobians and…
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…
We describe a method for generating graphs that provide difficult examples for practical Graph Isomorphism testers. We first give the theoretical construction, showing that we can have a family of graphs without any non-trivial…
The Hairer-Kelly map has been introduced for establishing a correspondence between geometric and non-geometric rough paths. Recently, a new renormalisation on rough paths has been proposed in (arxiv 1810.12179), built on this map and the…
We introduce the class of "smooth rough paths" and study their main properties. Working in a smooth setting allows us to discard sewing arguments and focus on algebraic and geometric aspects. Specifically, a Maurer-Cartan perspective is the…
An isomorphism between two graphs is a bijection between their vertices that preserves the edges. We consider the problem of determining whether two finite undirected weighted graphs are isomorphic, and finding an isomorphism relating them…
Motivated by recent results in graph C*-algebras concerning an equivariant pushout structure of the Vaksman-Soibelman quantum odd spheres, we introduce a class of graphs called trimmable. Then we show that the Leavitt path algebra of a…
Whenever an It\^o-Wentsel type of formula holds for composition of flows of a certain differential dynamics, there exists locally a decomposition of the corresponding flow according to complementary distributions (or foliations, in the case…
We develop a general framework for pathwise stochastic integration that extends F\"ollmer's classical approach beyond gradient-type integrands and standard left-point Riemann sums and provides pathwise counterparts of It\^o, Stratonovich,…
We study the complexity of isomorphism problems for d-way arrays, or tensors, under natural actions by classical groups such as orthogonal, unitary, and symplectic groups. Such problems arise naturally in statistical data analysis and…
The expected signature kernel arises in statistical learning tasks as a similarity measure of probability measures on path space. Computing this kernel for known classes of stochastic processes is an important problem that, in particular,…
In this paper we study a natural generalization of both {\sc $k$-Path} and {\sc $k$-Tree} problems, namely, the {\sc Subgraph Isomorphism} problem. In the {\sc Subgraph Isomorphism} problem we are given two graphs $F$ and $G$ on $k$ and $n$…
The stack of iterated integrals of a path is embedded in a larger algebraic structure where iterated integrals are indexed by decorated rooted trees and where an extended Chen's multiplicative property involves the D\"urr-Connes-Kreimer…
We introduce the tree distance, a new distance measure on graphs. The tree distance can be computed in polynomial time with standard methods from convex optimization. It is based on the notion of fractional isomorphism, a characterization…
We establish universal approximation theorems for infinite-dimensional geometric rough paths, i.e., we show that continuous functions on the space of infinite-dimensional weakly geometric H\"older continuous rough paths can be approximated…
We show how to use geometric arguments to prove that the terminal solution to a rough differential equation driven by a geometric rough path can be obtained by driving the same equation by a piecewise linear path. For this purpose, we…