SearcharxivSearch

arXiv · 2604.27627

Jump It\^o-type formula with arbitrary regularity

Abstract

We establish an It\^o-type formula for finite $p$-variation paths with jumps for arbitrary $p\geq 1$. The formula is stated in a fully pathwise form and separates the reduced rough integral from explicit left- and right-jump correction terms. In the c\`adl\`ag case, only the left-jump correction remains, while in the continuous case, both jump correction terms vanish and the formula recovers the corresponding continuous arbitrary-regularity change-of-variable formula. The proof is based on the reduced rough path framework and a refinement Riemann-Stieltjes convergence criterion adapted to discontinuous paths. This approach allows us to handle the higher-order Taylor expansions required for large values of $p$ and to control the interaction between rough increments and discrete jumps. As applications, we derive It\^o-type formulas for stochastic processes whose sample paths have finite $p$-variation, including pure-jump models and mixed fractional Brownian-jump signals. The latter class includes cases with Hurst parameter $H\leq 1/3$, which fall outside the regime $2\leq p<3$. We also obtain chain-rule identities for nonlinear observables of c\`adl\`ag finite-$p$-variation solutions of random differential equations with jumps, together with a pathwise log-wealth decomposition.

Explore related subjects

Keep this discovery

BibTeXRIS

Nannan Li, Xing Gao. 2026-04-30. Jump It\^o-type formula with arbitrary regularity. https://arxiv.org/abs/2604.27627

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