SearcharxivSearch

arXiv · 1902.05282

Multiple barrier-crossings of an Ornstein-Uhlenbeck diffusion in consecutive periods

Abstract

We investigate the joint distribution and the multivariate survival functions for the maxima of an Ornstein-Uhlenbeck (OU) process in consecutive time-intervals. A PDE method, alongside an eigenfunction expansion, is adopted with which we first calculate the distribution and the survival functions for the maximum of a homogeneous OU-process in a single interval. By a deterministic time-change and a parameter translation, this result can be extended to an inhomogeneous OU-process. Next, we derive a general formula for the joint distribution and the survival functions for the maxima of a continuous Markov process in consecutive periods. With these results, one can obtain semi-analytical expressions for the joint distribution and the multivariate survival functions for the maxima of an OU-process, with piecewise constant parameter functions, in consecutive time periods. The joint distribution and the survival functions can be evaluated numerically by an iterated quadrature scheme, which can be implemented efficiently by matrix multiplications. Moreover, we show that the computation can be further simplified to the product of single quadratures by imposing a mild condition. Such results may be used for the modelling of heatwaves and related risk management challenges.

Explore related subjects

Keep this discovery

BibTeXRIS

Yupeng Jiang, Andrea Macrina, Gareth W. Peters. 2019-02-14. Multiple barrier-crossings of an Ornstein-Uhlenbeck diffusion in consecutive periods. https://arxiv.org/abs/1902.05282

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