SearcharxivSearch

arXiv · 1212.5287

First passage times of two-correlated processes: analytical results for the Wiener process and a numerical method for diffusion processes

Abstract

Given a two-dimensional correlated diffusion process, we determine the joint density of the first passage times of the process to some constant boundaries. This quantity depends on the joint density of the first passage time of the first crossing component and of the position of the second crossing component before its crossing time. First we show that these densities are solutions of a system of Volterra-Fredholm first kind integral equations. Then we propose a numerical algorithm to solve it and we describe how to use the algorithm to approximate the joint density of the first passage times. The convergence of the method is theoretically proved for bivariate diffusion processes. We derive explicit expressions for these and other quantities of interest in the case of a bivariate Wiener process, correcting previous misprints appearing in the literature. Finally we illustrate the application of the method through a set of examples.

Explore related subjects

Keep this discovery

BibTeXRIS

Laura Sacerdote, Massimiliano Tamborrino, Cristina Zucca. 2012-12-20. First passage times of two-correlated processes: analytical results for the Wiener process and a numerical method for diffusion processes. https://doi.org/10.1016/j.cam.2015.09.033

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