Related papers: H\"older-continuous rough paths by Fourier normal …
One of the main virtues of trees is to represent formal solutions of various functional equations which can be cast in the form of fixed point problems. Basic examples include differential equations and functional (Lagrange) inversion in…
We use simple sub-Riemannian techniques to prove that an arbitrary geometric p-rough path in the sense of Lyons (98) is the limit in sup-norm of a sequence of canonically lifted smooth paths, which are uniformly bounded in p-variation,…
Gian-Carlo Rota mentioned in one of his last articles the problem of developing a theory around the notion of integration algebras, which should be dual to the one of differential algebras. This idea has been developed historically along…
Under the key assumption of finite {\rho}-variation, {\rho}\in[1,2), of the covariance of the underlying Gaussian process, sharp a.s. convergence rates for approximations of Gaussian rough paths are established. When applied to Brownian…
We consider differential equations driven by rough paths and study the regularity of the laws and their long time behavior. In particular, we focus on the case when the driving noise is a rough path valued fractional Brownian motion with…
We present several constructions of paths and processes with finite quadratic variation along a refining sequence of partitions, extending previous constructions to the non-uniform case. We study in particular the dependence of quadratic…
We prove the existence and uniqueness of solutions to a class of stochastic scalar conservation laws with joint space-time transport noise and affine-linear noise driven by a geometric p-rough path. In particular, stability of the solutions…
We introduce a general recursive method to construct continuum random trees (CRTs) from independent copies of a random string of beads, that is, any random interval equipped with a random discrete probability measure, and from related…
We introduce and study the {\em orderly spanning trees} of plane graphs. This algorithmic tool generalizes {\em canonical orderings}, which exist only for triconnected plane graphs. Although not every plane graph admits an orderly spanning…
We develop a theory of higher order structures in compact abelian groups. In the frame of this theory we prove general inverse theorems and regularity lemmas for Gowers's uniformity norms. We put forward an algebraic interpretation of the…
We propose a Fourier-based learning algorithm for highly nonlinear multiclass classification. The algorithm is based on a smoothing technique to calculate the probability distribution of all classes. To obtain the probability distribution,…
We develop the algebraic theory of rough path translation. Particular attention is given to the case of branched rough paths, whose underlying algebraic structure (Connes-Kreimer, Grossman-Larson) makes it a useful model case of a…
The recursive and hierarchical structure of full rooted trees is applicable to represent statistical models in various areas, such as data compression, image processing, and machine learning. In most of these cases, the full rooted tree is…
For a wide variety of regularization methods, algorithms computing the entire solution path have been developed recently. Solution path algorithms do not only compute the solution for one particular value of the regularization parameter but…
Exponential integrators based on contour integral representations lead to powerful numerical solvers for a variety of ODEs, PDEs, and other time-evolution equations. They are embarrassingly parallelizable and lead to global-in-time…
The \emph{generalized sorting problem} is a restricted version of standard comparison sorting where we wish to sort $n$ elements but only a subset of pairs are allowed to be compared. Formally, there is some known graph $G = (V, E)$ on the…
Individualization-Refinement (IR) algorithms form the standard method and currently the only practical method for symmetry computations of graphs and combinatorial objects in general. Through backtracking, on each graph an IR-algorithm…
We define a natural notion of higher order stability and show that subsets of $\mathbb{F}_p^n$ that are tame in this sense can be approximately described by a union of low-complexity quadratic varieties, up to linear error. This generalizes…
We consider the problem of inferring the topology of a network using the measurements available at the end nodes, without cooperation from the internal nodes. To this end, we provide a simple method to obtain path interference which…
We first show that increasing trees are in bijection with set compositions, extending simultaneously a recent result on trees due to Tonks and a classical result on increasing binary trees. We then consider algebraic structures on the…