Related papers: An isomorphism between branched and geometric roug…
The signature of a path, introduced by K.T. Chen [5] in $1954$, has been extensively studied in recent years. The $2010$ paper [12] of Hambly and Lyons showed that the signature is injective on the space of continuous finite-variation paths…
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…
Annealed functional CLT in the rough path topology is proved for the standard class of ballistic random walks in random environment. Moreover, the `area anomaly', i.e. a deterministic linear correction for the second level iterated integral…
This paper is a first of a series of three papers which study eta invariants for laminations. In this first paper, we extend the results of Higson and Roe to deal with regular (unbounded) operators and more importantly to take into account…
We develop a rough-path framework for two-parameter rough differential equations on rectangular and simplicial domains, motivated by the signature kernel and Schwinger--Dyson kernel equations. The theory is formulated in spaces of jointly…
In this work we study the Friedmann-Lema\^{i}tre-Robertson-Walker cosmologies with arbitrary spatial curvature for the symmetric teleparallel theories of gravity, giving the first presentation of their coincident gauge form. Our approach…
Self-similar Markov trees constitute a remarkable family of random compact real trees carrying a decoration function that is positive on the skeleton. As the terminology suggests, they are self-similar objects that further satisfy a Markov…
We give a fixed-parameter tractable algorithm that, given a parameter $k$ and two graphs $G_1,G_2$, either concludes that one of these graphs has treewidth at least $k$, or determines whether $G_1$ and $G_2$ are isomorphic. The running time…
Let $S$ be a normal complex analytic surface singularity. We say that $S$ is arborescent if the dual graph of any resolution of it is a tree. Whenever $A,B$ are distinct branches on $S$, we denote by $A \cdot B$ their intersection number in…
We establish two results concerning a class of geometric rough paths $\mathbf{X}$ which arise as Markov processes associated to uniformly subelliptic Dirichlet forms. The first is a support theorem for $\mathbf{X}$ in $\alpha$-H\"older…
We study various classes of random processes defined on the regular tree $T_d$ that are invariant under the automorphism group of $T_d$. Most important ones are factor of i.i.d. processes (randomized local algorithms), branching Markov…
We study nonparametric regression and classification for path-valued data. We introduce a functional Nadaraya-Watson estimator that combines the signature transform from rough path theory with local kernel regression. The signature…
Recently, Hairer--Pillai proposed the notion of $\theta$-roughness of a path which leads to a deterministic Norris lemma. In the Gubinelli framework (Hoelder, level 2) of rough paths, they were then able to prove a Hoermander type result…
Building on work of Cai, F\"urer, and Immerman \cite{CFI92}, we show two hardness results for the Graph Isomorphism problem. First, we show that there are pairs of nonisomorphic $n$-vertex graphs $G$ and $H$ such that any sum-of-squares…
A factor graph of a point process is a graph whose vertices are the points of the process, and which is constructed from the process in a deterministic isometry-invariant way. We prove that the d-dimensional Poisson process has a one-ended…
This paper provides the generating series for the embedding of tree-like graphs of arbitrary number of vertices, accourding to their genus. It applies and extends the techniques of Chan, where it was used to give an alternate proof of the…
We present algorithms that run in linear time on pointer machines for a collection of problems, each of which either directly or indirectly requires the evaluation of a function defined on paths in a tree. These problems previously had…
We develop a branched signature kernel solver for linear and nonlinear ordinary differential equations driven by a \emph{single observed trajectory} of a possibly rough forcing signal -- a setting that arises naturally in earthquake…
In this paper, we study uniform rooted plane trees with given degree sequence. We show, under some natural hypotheses on the degree sequence, that these trees converge toward the so-called Inhomogeneous Continuum Random Tree after…
We give a linear-time algorithm that checks for isomorphism between two 0-1 matrices that obey the circular-ones property. This algorithm leads to linear-time isomorphism algorithms for related graph classes, including Helly circular-arc…