SearcharxivSearch

arXiv · 2501.02862

Stochastic Calculus via Stopping Derivatives

Abstract

We show that a substantial portion of stochastic calculus can be developed along similar lines to ordinary calculus, with derivative-based concepts driving the development. We define a notion of stopping derivative, which is a form of right derivative with respect to stopping times. Using this, we define the drift and variance rate of a process as stopping derivatives for (generalised) conditional expectation and conditional variance respectively. Applying elementary, derivative-based methods, we derive a calculus of rules describing how drift and variance rate transform under operations on processes, culminating in a version of the multi-dimensional It\^o formula. Our approach connects with the standard machinery of stochastic calculus via a theorem establishing that continuous processes with zero drift coincide with random translations of continuous local martingales. This equivalence allows us to derive a fundamental theorem of calculus for stopping derivatives, which relates the quantities of drift and variance rate, defined as stopping derivatives, to parameters used in the description of a process as a stochastic integral.

Explore related subjects

Keep this discovery

BibTeXRIS

Alex Simpson. 2025-01-06. Stochastic Calculus via Stopping Derivatives. https://arxiv.org/abs/2501.02862

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