Related papers: Integration of branched rough paths

Given a graph $G$, a probability measure $\mu$ on the subsets of the edge set of $G$ is said to be $1$-independent if events determined by edge sets that are at graph distance at least $1$ apart in $G$ are independent. Call such a…

We determine an upper bound for the size of a stem $p$-group in terms of its breadth and its maximum character degree.

We consider Euclidean path integrals with higher derivative actions, including those that depend quadratically on acceleration, velocity and position. Such path integrals arise naturally in the study of stiff polymers, membranes with…

We study the computational complexity of routing multiple objects through a network in such a way that only few collisions occur: Given a graph $G$ with two distinct terminal vertices and two positive integers $p$ and $k$, the question is…

We consider random discrepancy under weighted importance sampling of a class of stratified input. We give the expected $L_p-$discrepancy($2\leq p<\infty$) upper bound in weighted form under a class of stratified sampling. This result…

Let $p$ be a real number greater than one and let $\Gamma$ be a graph of bounded degree. We investigate links between the $p$-harmonic boundary of $\Gamma$ and the $D_p$-massive subsets of $\Gamma$. In particular, if there are $n$ pairwise…

A recently developed analytical method for systematic improvement of the convergence of path integrals is used to derive a generalization of Euler's summation formula for path integrals. The first $p$ terms in this formula improve…

Branch points of a real 2-surface S in a 4-manifold M generalize the branch points of complex curves in complex surfaces: for example, they can occur as singularities of minimal surfaces. We investigate such a branch point p when S is…

Multi-dimensional continuous local martingales, enhanced with their stochastic area process, give rise to geometric rough paths with a.s. finite homogenous p-variation, p>2. Here we go one step further and establish quantitative bounds of…

Let $\Gamma$ be a rooted tree and let $t$ be a positive integer. We study algebraic invariants and properties of the path ideal generated by monomial corresponding to paths of length $(t-1)$ in $\Gamma$. In particular, we give a recursive…

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…

In this paper, we show how one can view certain models in regularity structures as some form of geometric rough paths. This is performed by identifying the deformed Butcher-Connes-Kreimer Hopf algebra with a quotient of the shuffle Hopf…

We provide a draft of a theory of geometric integration of rough differential forms which are generalizations of classical (smooth) differential forms to similar objects with very low regularity, for instance, involving H\"older continuous…

In this paper, we establish the theory of $p$-modulus of a family of infinite paths on an infinite-rooted tree and then explore its interpretation and properties. One key result is the formulation of $p$-modulus on the infinite tree as a…

Rough paths techniques give the ability to define solutions of stochastic differential equations driven by signals $X$ which are not semimartingales and whose $p$-variation is finite only for large values of $p$. In this context, rough…

In this paper, we first obtain an $L^q$ gradient estimate for $p$-harmonic maps, by assuming the target manifold supporting a certain function, whose gradient and Hessian satisfy some analysis conditions. From this $L^q$ gradient estimate,…

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.…

In this article we consider rough differential equations (RDEs) driven by non-geometric rough paths, using the concept of branched rough paths introduced in Gubinelli (2004). We first show that branched rough paths can equivalently be…

Graphs have been commonly used to model many applications. A natural problem which abstracts applications such as itinerary planning, playlist recommendation, and flow analysis in information networks is that of finding the heaviest path(s)…

A lamination $\lambda$ is $\epsilon$-thick (with respect to a basepoint $X$), if the Teichm\"uller ray from $X$ in the direction of $\lambda$ stays in the $\epsilon$-thick part. We show that, for surfaces of high enough genus, any two…