Related papers: H\"older-continuous rough paths by Fourier normal …
The Aho, Hopcroft and Ullman (AHU) algorithm has been the state of the art since the 1970s for determining in linear time whether two unordered rooted trees are isomorphic or not. However, it has been criticized (by Campbell and Radford)…
In "Hopf algebra of the planar binary trees", Adv. Math. 139 (1998), no. 2, 293--309, we constructed by induction a graded associative product on the vector space generated by the planar binary trees (resp. the permutations). In the present…
In this paper we prove the strong averaging principle for a slow-fast system of rough differential equations. The slow and the fast component of the system are driven by a rather general random rough path and Brownian rough path,…
We study the concept of quadratic variation of a continuous path along a sequence of partitions and its dependence with respect to the choice of the partition sequence. We define the concept of quadratic roughness of a path along a…
In this work, we propose a systematic derivation of normal forms for dispersive equations using decorated trees introduced in arXiv:2005.01649. The key tool is the arborification map which is a morphism from the Butcher-Connes-Kreimer Hopf…
We develop the structure theory for transformations of weakly geometric rough paths of bounded $1 < p$-variation and their controlled paths. Our approach differs from existing approaches as it does not rely on smooth approximations. We…
In this work, we propose a systematic derivation of resonance-based schemes via normal forms. The main idea is to use an arborification map on decorated trees together with a Butcher-Connes-Kreimer type coproduct and lower-dominant parts…
We introduce a canonical method for transforming a discrete sequential data set into an associated rough path made up of lead-lag increments. In particular, by sampling a $d$-dimensional continuous semimartingale $X:[0,1] \rightarrow…
In recent years a Hopf algebraic structure underlying the process of renormalization in quantum field theory was found. It led to a Birkhoff factorization for (regularized) Hopf algebra characters, i.e. for Feynman rules. In this work we…
Based on two isomorphisms of Hopf algebras, we provide a bound in the optimal order on the remainder of the truncated Taylor expansion for controlled differential equations driven by branched rough paths.
In this article, we propose a way to consider processes indexed by a collection $\mathcal{A}$ of subsets of a general set $\mathcal{T}$. A large class of vector spaces, manifolds and continuous $\mathbb{R}$-trees are particular cases.…
This note is devoted to construct a rough path above a multidimensional fractional Brownian motion $B$ with any Hurst parameter $H\in(0,1)$, by means of its representation as a Volterra Gaussian process. This approach yields some algebraic…
We study a general procedure that builds random $\mathbb R$-trees by gluing recursively a new branch on a uniform point of the pre-existing tree. The aim of this paper is to see how the asymptotic behavior of the sequence of lengths of…
This work provides a systematic recipe for computing accurate high order Fourier expansions of quasiperiodic invariant circles in area preserving maps. The recipe requires only a finite data set sampled from the quasiperiodic circle. Our…
Combining fractional calculus and the Rough Path Theory we study the existence and uniqueness of mild solutions to evolutions equations driven by a H\"older continuous function with H\"older exponent in $(1/3,1/2)$. Our stochastic integral…
Differential equations perturbed by multiplicative fractional Brownian motions are considered. Depending on the value of the Hurst parameter $H$, the resulting equation is pathwise viewed as an ODE, YDE, or RDE. In all three regimes we show…
Inspired by recent advances in singular SPDE theory, we use the Poincar\'e inequality on Wiener space to show that controlled complementary Young regularity is sufficient to obtain Gaussian rough paths lifts. This allows us to completely…
We show that an algorithmic construction of sequences of recursive trees leads to a direct proof of the convergence of random recursive trees in an associated Doob-Martin compactification; it also gives a representation of the limit in…
Rough paths theory allows for a pathwise theory of solutions to differential equations driven by highly irregular signals. The fundamental observation of rough paths theory is that if one can define "iterated integrals" above a signal, then…
Our approach to higher order Fourier analysis is to study the ultra product of finite (or compact) Abelian groups on which a new algebraic theory appears. This theory has consequences on finite (or compact) groups usually in the form of…