Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
184 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Reconstruction for the Signature of a Rough Path (1508.06890v2)

Published 27 Aug 2015 in math.CA and math.PR

Abstract: 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 this uniqueness result does not contain any information on how to "see" the trajectory of a (tree-reduced) rough path from its signature, and a constructive understanding on the uniqueness result (in particular on the inverse of S) has become an interesting and important question. The aim of the present paper is to reconstruct a rough path from its signature in an explicit and universal way.

Summary

We haven't generated a summary for this paper yet.