相关论文: Path Developments and Tail Asymptotics of Signatur…
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…
We state the graph-theoretic computational problem of finding tight paths in a directed, edge-weighted graph, as well as its simplification of finding tight pairs. These problems are motivated by the need of algorithms that find so-called…
Based on a dyadic approximation of It\^o integrals, we show the existence of It\^o c\`adl\`ag rough paths above general semimartingales, suitable Gaussian processes and non-negative typical price paths. Furthermore, Lyons-Victoir extension…
This paper establishes a comprehensive concentration theory for truncated signatures of Gaussian rough paths. The signature of a path, defined as the collection of all iterated integrals, provides a complete description of its geometric…
In this paper, we provide a review on the kernel method, which is one of the options for characterizing so-called exact tail asymptotic properties in stationary probabilities of two-dimensional random walks, discrete or continuous (or…
A branched rough path $X$ consists of a rough integral calculus for $X \colon [0, T] \to \mathbb R^d$ which may fail to satisfy integration by parts. Using Kelly's bracket extension [Kel12], we define a notion of pushforward of branched…
We introduce and analyze a new quantity, the path integral ideal, governing the flow of generic discrete theories to the continuum limit and greatly increasing their convergence. The said flow is classified according to the degree of…
Linear differential equations and recurrences reveal many properties about their solutions. Therefore, these equations are well-suited for representing solutions and computing with special functions. We identify a large class of existing…
Finding paths in graphs is a fundamental graph-theoretic task. In this work, we we are concerned with finding a path with some constraints on its length and the number of vertices neighboring the path, that is, being outside of and incident…
This paper revisits the concept of rough paths of inhomogeneous degree of smoothness (geometric \Pi-rough paths in our terminology) sketched by Lyons ("Differential equations driven by rough signals", Revista Mathematica Iber. Vol 14, Nr.…
The signature of a path \gamma is a sequence whose n-th term is the order-n iterated integrals of \gamma. It arises from solving multidimensional linear differential equations driven by \gamma. We are interested in relating the path…
We build a connection between rough path theory and noncommutative algebra, and interpret the integration of geometric rough paths as an example of a non-abelian Young integration. We identify a class of slowly-varying one-forms, and prove…
The shortest path problem in graphs is a cornerstone of AI theory and applications. Existing algorithms generally ignore edge weight computation time. We present a generalized framework for weighted directed graphs, where edge weight can be…
In this paper I show how path integral techniques can be used to put measures on histories in "susceptible-infectious-recovered" (SIR)-type systems. The standard SIR solution emerges as the classical saddle point of the action describing…
In this article, we consider limit theorems for some weighted type random sums (or discrete rough integrals). We introduce a general transfer principle from limit theorems for unweighted sums to limit theorems for weighted sums via rough…
This paper studies path synthesis for nonholonomic mobile robots moving in two-dimensional space. We first address the problem of interpolating paths expressed as sequences of straight line segments, such as those produced by some planning…
Anytime almost-surely asymptotically optimal planners, such as RRT*, incrementally find paths to every state in the search domain. This is inefficient once an initial solution is found as then only states that can provide a better solution…
Leavitt path algebras associate to directed graphs a $\mathbb Z$-graded algebra and in their simplest form recover the Leavitt algebras L(1,n). In this note, we introduce iterated Leavitt path algebras associated to directed weighted graphs…
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…
The computation of short paths in graphs with arc lengths is a pillar of graph algorithmics and network science. In a more diverse world, however, not every short path is equally valuable. For the setting where each vertex is assigned to a…