SearcharxivSearch

arXiv · 2311.07101

Non-explicit formula of boundary crossing probabilities by the Girsanov theorem

Abstract

This paper derives several formulae for the probability that a Wiener process, which has a stochastic drift and random variance, crosses a one-sided stochastic boundary within a finite time interval. A non-explicit formula is first obtained by the Girsanov theorem when considering an equivalent probability measure in which the boundary is constant and equal to its starting value. A more explicit formula is then achieved by decomposing the Radon-Nikodym derivative inverse. This decomposition expresses it as the product of a random variable, which is measurable with respect to the Wiener process's final value, and an independent random variable. We also provide an explicit formula based on a strong theoretical assumption. To apply the Girsanov theorem, we assume that the difference between the drift increment and the boundary increment, divided by the standard deviation, is absolutely continuous. Additionally, we assume that its derivative satisfies Novikov's condition.

Explore related subjects

Keep this discovery

BibTeXRIS

Yoann Potiron. 2023-11-13. Non-explicit formula of boundary crossing probabilities by the Girsanov theorem. https://arxiv.org/abs/2311.07101

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