SearcharxivSearch

arXiv · 2606.20908

On It\^o-Stratonovich formula for rough sheets

Abstract

In this paper, we explore a new strategy towards an It\^o-Stratonovich type formula for rough sheets. Historically, planar integration for irregular paths has been notoriously cumbersome. The emergence of mixed differential terms in 2D leads to overlapping iterated integrals, which previously required the construction of exhaustive combinatorial structures. As an example of this kind of structure, let us mention the massive 36-element planar signature introduced by K. Chouk and M. Gubinelli in their influential paper 'Rough sheets'. In this work we propose a simplified setting for rough calculus in the plane, which relies on elementary Taylor expansions in a more fundamental way. We claim that this simple trick allows us to significantly streamline the complexity of planar algebraic integration. We illustrate this methodology for a specialized Rough-Young framework: we extend the classical planar change-of-variable formula to paths possessing an asymmetric H\"older regularity: $\gamma_1 > 1/3$ in the first direction and $\gamma_2 > 1/2$ in the second direction. Relying on a structured controlled path expansions, we rigorously minimize the set of iterated integrals needed in the signature, and express the resulting planar change-of-variable formula as the explicit limit of Riemann sums.

Explore related subjects

Keep this discovery

BibTeXRIS

Youssef Hakiki, Samy Tindel. 2026-06-18. On It\^o-Stratonovich formula for rough sheets. https://arxiv.org/abs/2606.20908

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR