Related papers: Geometric versus non-geometric rough paths
The existence of random dynamical systems for McKean--Vlasov SDEs is established. This is approached by considering the joint dynamics of the corresponding nonlinear Fokker-Planck equation governing the law of the system and the underlying…
We consider additive functionals of stationary Markov processes and show that under Kipnis-Varadhan type conditions they converge in rough path topology to a Stratonovich Brownian motion, with a correction to the Levy area that can be…
Iterated integrals of paths arise frequently in the study of the Taylor's expansion for controlled differential equations. We will prove a factorial decay estimate, conjectured by M. Gubinelli, for the iterated integrals of non-geometric…
It is shown that any second order dynamic equation on a configuration bundle $Q\to R$ of non-relativistic mechanics is equivalent to a geodesic equation with respect to a (non-linear) connection on the tangent bundle $TQ\to Q$. The case of…
Simultaneous Geometric Embedding (SGE) asks whether, for a given collection of graphs on the same vertex set V, there is an embedding of V in the plane that admits a crossing-free drawing with straightline edges for each of the given…
A theory of graded manifolds can be viewed as a generalization of differential geometry of smooth manifolds. It allows one to work with functions which locally depend not only on ordinary real variables, but also on $\mathbb{Z}$-graded…
In this paper we revisit the classical Edge Disjoint Paths (EDP) problem, where one is given an undirected graph G and a set of terminal pairs P and asks whether G contains a set of pairwise edge-disjoint paths connecting every terminal…
We generalize Bruned et.al.'s notion of translation in geometric and branched rough paths to a notion of translation in rough paths over any combinatorial Hopf algebra. We show that this notion of translation is equivalent to two bialgebras…
Paths are important structural elements in complex networks because they are finite (unlike walks), related to effective node coverage (minimum spanning trees), and can be understood as being dual to star connectivity. This article…
The Radial Spanning Tree (RST) in dimension $d\geq2$ is a random geometric graph constructed on a homogeneous Poisson point process $\mathcal N$ in $\mathbb R^d$ augmented by the origin, with edges connecting each $x\in\mathcal N$ to the…
Recently it was proved that the group of rough paths modulo tree-like equivalence is isomorphic to the corresponding signature group through the signature map S (a generalized notion of taking iterated path integrals). However, the proof of…
W.Lawvere suggested a approach to differential geometry and to others mathematical disciplines closed to physics, which allows to give definitions of derivatives, tangent vectors and tangent bundles without passages to the limits. This…
Contrary to previous approaches bringing together algebraic geometry and signatures of paths, we introduce a Zariski topology on the space of paths itself, and study path varieties consisting of all paths whose iterated-integrals signature…
McKean-Vlasov SDEs describe systems where the dynamics depend on the law of the process. The corresponding Fokker-Planck equation is a nonlinear, nonlocal PDE for the corresponding measure flow. In the presence of common noise and…
A vertex set $S$ of a graph $G$ is geodetic if every vertex of $G$ lies on a shortest path between two vertices in $S$. Given a graph $G$ and $k \in \mathbb N$, the NP-hard Geodetic Set problem asks whether there is a geodetic set of size…
Recently, it has been shown that Absolute Parallelism (AP) geometry admits paths that are naturally quantized. These paths have been used to describe the motion of spinning particles in a background gravitational field. In case of a weak…
Parametric approaches to Learning, such as deep learning (DL), are highly popular in nonlinear regression, in spite of their extremely difficult training with their increasing complexity (e.g. number of layers in DL). In this paper, we…
A Dubins path is a shortest path with bounded curvature. The seminal result in non-holonomic motion planning is that (in the absence of obstacles) a Dubins path consists either from a circular arc followed by a segment followed by another…
Based on an isomorphism between Grossman Larson Hopf algebra and Tensor Hopf algebra, we apply a sub-Riemannian geometry technique to branched rough differential equations and obtain the explicit Lipschitz continuity of the solution with…
The branching methods developed are effective methods to solve some semi linear PDEs and are shown numerically to be able to solve some full non linear PDEs. These methods are however restricted to some small coefficients in the PDE and…