Related papers: A Transfer Principle for Branched Rough Paths
A central question in rough path theory is characterising the law of stochastic processes on path spaces. It is established in [I. Chevyrev & T. Lyons, Characteristic functions of measures on geometric rough paths, Ann. Probab. 44 (2016),…
Applying robust optimization often requires selecting an appropriate uncertainty set both in shape and size, a choice that directly affects the trade-off between average-case and worst-case performances. In practice, this calibration is…
Path integrals represent a powerful route to quantization: they calculate probabilities by summing over classical configurations of variables such as fields, assigning each configuration a phase equal to the action of that configuration.…
We discuss the issue of branching in quasiregular mapping, and in particular the relation between branching and the problem of finding geometric parametrizations for topological manifolds. Other recent progress and open problems of a more…
The universal limit theorem is a central result in rough path theory, which has been proved for: (i) rough paths with roughness $\frac{1}{3}< \alpha \leq \frac{1}{2}$; (ii) geometric rough paths with roughness $0< \alpha \leq 1$; (iii)…
If $X$ is a smooth scheme of characteristic zero or a complex analytic manifold, and $S$ is a locally split infinitesimal thickening of $X$, we compute explicitly the derived self-intersection of $X$ in $S$.
We study the theoretical and practical aspects of computing braids described by approximate descriptions of paths in the plane. Exact algorithms rely on the lexicographic ordering of the points in the plane, which is unstable under…
We consider 5d $\mathcal{N}=1$ SU(2) super Yang-Mills theory on $X\times S^1$, with $X$ a closed smooth four-manifold. A partial topological twisting along $X$ renders the theory formally independent of the metric on $X$. The theory depends…
Weighted counting problems are a natural generalization of counting problems where a weight is associated with every computational path of polynomial-time non-deterministic Turing machines and the goal is to compute the sum of the weights…
We study controlled differential equations driven by a rough path (in the sense of T. Lyons) with an additional, possibly unbounded drift term. We show that the equation induces a solution flow if the drift grows at most linearly.…
Esnault-Viehweg developed the theory of cyclic branched coverings $\tilde X\to X$ of smooth surfaces providing a very explicit formula for the decomposition of $H^1(\tilde X,\mathbb{C})$ in terms of a resolution of the ramification locus.…
We study fully nonlinear second-order (forward) stochastic partial differential equations (SPDEs). They can also be viewed as forward path-dependent PDEs (PPDEs) and will be treated as rough PDEs (RPDEs) under a unified framework. We…
We introduce a notion of distributional $k$-forms on $d$-dimensional manifolds which can be integrated against suitably regular $k$-submanifolds. Our approach combines ideas from Whitney's geometric integration [Whi57] with those of sewing…
Using truncated variation techniques we obtain an improved version of the Loeve-Young inequality for the Riemann-Stieltjes integrals driven by rough paths. This allowed us to strenghten some result on the existence of solutions of integral…
A bounded curvature path is a continuously differentiable piece-wise $C^2$ path with bounded absolute curvature connecting two points in the tangent bundle of a surface. These paths have been widely considered in computer science and…
This note addresses the construction of a notion of parallel transport along superpaths arising from the concept of a superconnection on a vector bundle over a manifold $M$. A superpath in $M$ is, loosely speaking, a path in $M$ together…
In mathematics there is a wide class of knot invariants that may be expressed in the form of multiple line integrals computed along the trajectory C describing the spatial conformation of the knot. In this work it is addressed the problem…
We present a rough path analog of the classical Gronwall Lemma introduced recently by A. Deya, M. Gubinelli, M. Hofmanov\'a, S. Tindel in [arXiv:1604.00437] and discuss two of its applications. First, it is applied in the framework of rough…
We consider a rough differential equation of the form \(dY_t=\sum_i V_i(Y_t)d\boldsymbol{X}^i_t+V_0(Y_t)dt \), where \(\boldsymbol{X}_t \) is a Markovian rough path. We demonstrate that if the vector fields \((V_i)_{0\leq i\leq d} \)…
Discriminative Random Walks (DRWs) are a simple yet powerful tool for semi-supervised node classification, but their theoretical foundations remain fragmentary. We revisit DRWs through the lens of information geometry, treating the family…