SearcharxivSearch

arXiv · 1508.05984

Pathwise Stochastic Calculus with Local Times

Abstract

We study a notion of local time for a continuous path, defined as a limit of suitable discrete quantities along a general sequence of partitions of the time interval. Our approach subsumes other existing definitions and agrees with the usual (stochastic) local times a.s. for paths of a continuous semimartingale. We establish pathwise version of the It\^o-Tanaka, change of variables and change of time formulae. We provide equivalent conditions for existence of pathwise local time. Finally, we study in detail how the limiting objects, the quadratic variation and the local time, depend on the choice of partitions. In particular, we show that an arbitrary given non-decreasing process can be achieved a.s. by the pathwise quadratic variation of a standard Brownian motion for a suitable sequence of (random) partitions; however, such degenerate behavior is excluded when the partitions are constructed from stopping times.

Explore related subjects

Keep this discovery

BibTeXRIS

Mark Davis, Jan Obłój, Pietro Siorpaes. 2015-08-24. Pathwise Stochastic Calculus with Local Times. https://arxiv.org/abs/1508.05984

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