SearcharxivSearch

arXiv · 1911.10839

On occupation times of one-dimensional diffusions

Abstract

In this paper we study the moment generating function and the moments of occupation time functionals of one-dimensional diffusions. Assuming, specifically, that the process lives on $\mathbb{R}$ and starts at~0, we apply Kac's moment formula and the strong Markov property to derive an expression for the moment generating function in terms of the Green kernel of the underlying diffusion. Moreover, the approach allows us to derive a recursive equation for the Laplace transforms of the moments of the occupation time on $\mathbb{R}_+$. If the diffusion has a scaling property, the recursive equation simplifies to an equation for the moments of the occupation time up to time 1. As examples of diffusions with scaling property we study in detail skew two-sided Bessel processes and, as a special case, skew Brownian motion. It is seen that for these processes our approach leads to simple explicit formulas. The recursive equation for a sticky Brownian motion is also discussed.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Paavo Salminen, David Stenlund. 2019-11-25. On occupation times of one-dimensional diffusions. https://doi.org/10.1007/s10959-020-00993-3

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