Simulation of hitting times for Bessel processes with non integer dimension

Madalina Deaconu; Samuel Herrmann

Home/Archive/arXiv

arXiv · 1401.4843

Simulation of hitting times for Bessel processes with non integer dimension

Madalina Deaconu·Samuel Herrmann

View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper we pursue and complete the study of the simulation of the hitting time of some given boundaries for Bessel processes. These problems are of great interest in many application fields as finance and neurosciences. In a previous work, the authors introduced a new method for the simulation of hitting times for Bessel processes with integer dimension. The method was based mainly on the explicit formula for the distribution of the hitting time and on the connexion between the Bessel process and the Euclidean norm of the Brownian motion. This method does not apply anymore for a non integer dimension. In this paper we consider the simulation of the hitting time of Bessel processes with non integer dimension and provide a new algorithm by using the additivity property of the laws of squared Bessel processes. We split each simulation step in two parts: one is using the integer dimension case and the other one considers hitting time of a Bessel process starting from zero.

Explore related subjects

math.PR

Keep this discovery

BibTeX RIS

Madalina Deaconu, Samuel Herrmann. 2014-01-20. Simulation of hitting times for Bessel processes with non integer dimension. https://arxiv.org/abs/1401.4843

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

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↗

arXiv2026

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↗

arXiv2026

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↗