SearcharxivSearch

arXiv · 1904.04344

Approximating exit times of continuous Markov processes

Abstract

The time at which a one-dimensional continuous strong Markov process attains a boundary point of its state space is a discontinuous path functional and it is, therefore, unclear whether the exit time can be approximated by hitting times of approximations of the process. We prove a functional limit theorem for approximating weakly both the paths of the Markov process and its exit times. In contrast to the functional limit theorem in [arXiv:1902.06249v1] for approximating the paths, we impose a stronger assumption here. This is essential, as we present an example showing that the theorem extended with the convergence of the exit times does not hold under the assumption in [arXiv:1902.06249v1]. However, the EMCEL scheme introduced in [arXiv:1902.06249v1] satisfies the assumption of our theorem, and hence we have a scheme capable of approximating both the process and its exit times for every one-dimensional continuous strong Markov process, even with irregular behavior (e.g., a solution of an SDE with irregular coefficients or a Markov process with sticky features). Moreover, our main result can be used to check for some other schemes whether the exit times converge. As an application we verify that the weak Euler scheme is capable of approximating the absorption time of the CEV diffusion and that the scale-transformed weak Euler scheme for a squared Bessel process is capable of approximating the time when the squared Bessel process hits zero.

Explore related subjects

Keep this discovery

BibTeXRIS

Thomas Kruse, Mikhail Urusov. 2019-04-08. Approximating exit times of continuous Markov processes. https://arxiv.org/abs/1904.04344

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