We develop a novel Monte Carlo algorithm for the vector consisting of the supremum, the time at which the supremum is attained, and the position at a given (constant) time of an exponentially tempered Lévy process. The algorithm, based on the increments of the process without tempering, converges geometrically fast (as a function of the computational cost) for discontinuous and locally Lipschitz functions of the vector. We prove that the corresponding multilevel Monte Carlo estimator has optimal computational complexity (i.e. of order $\varepsilon^{-2}$ if the mean squared error is at most $\varepsilon^2$) and provide its central limit theorem (CLT). Using the CLT we construct confidence intervals for barrier option prices and various risk measures based on drawdown under the tempered stable (CGMY) model calibrated/estimated on real-world data. We provide non-asymptotic and asymptotic comparisons of our algorithm with existing approximations, leading to rule-of-thumb principles guiding users to the best method for a given set of parameters. We illustrate the performance of the algorithm with numerical examples.

Let X be an Ornstein–Uhlenbeck process driven by a Brownian motion. We propose an expression for the joint density / distribution function of the process and its running supremum. This law is expressed as an expansion involving parabolic cylinder functions. Numerically, we obtain this law faster with our expression than with a Monte Carlo method. Numerical applications illustrate the interest of this result.

Let {X(s, t): s, t ≥ 0} be a centred homogeneous Gaussian field with almost surely continuous sample paths and correlation function r(s, t) = cov(X(s, t), X(0, 0)) such that r(s, t) = 1 - |s|α1 - |t|α2 + o(|s|α1 + |t|α2), s, t → 0, with α1, α2 ∈ (0, 2], and r(s, t) < 1 for (s, t) ≠ (0, 0). In this contribution we derive an asymptotic expansion (as u → ∞) of P(sup(sn1(u),tn2(u)) ∈[0,x]∙[0,y]X(s, t) ≤ u), where n1(u)n2(u) = u2/α1+2/α2Ψ(u), which holds uniformly for (x, y) ∈ [A, B]2 with A, B two positive constants and Ψ the survival function of an N(0, 1) random variable. We apply our findings to the analysis of extremes of homogeneous Gaussian fields over more complex parameter sets and a ball of random radius. Additionally, we determine the extremal index of the discretised random field determined by X(s, t).

We derive an expansion for the (expected) difference between the continuously monitored supremum and evenly monitored discrete maximum over a finite time horizon of a jump diffusion process with independent and identically distributed normal jump sizes. The monitoring error is of the form a 0 / N 1/2 + a 1 / N 3/2 + · · · + b 1 / N + b 2 / N 2 + b 4 / N 4 + · · ·, where N is the number of monitoring intervals. We obtain explicit expressions for the coefficients {a 0, a 1, …, b 1, b 2, …}. In particular, a 0 is proportional to the value of the Riemann zeta function at ½, a well-known fact that has been observed for Brownian motion in applied probability and mathematical finance.

For functions u, subharmonic in the plane, let

and let N(r,u) be the integrated counting function. Suppose that is a non-negative non-decreasing convex function of log r for which for all small r and , where 1 < ρ < 2, and define

A sharp upper bound is obtained for and a sharp lower bound is obtained for .

The present paper generalises some results for spectrally negative Lévy processes to the setting of Markov additive processes (MAPs). A prominent role is assumed by the first passage times, which will be determined in terms of their Laplace transforms. These have the form of a phase-type distribution, with a rate matrix that can be regarded as an inverse function of the cumulant matrix. A numerically stable iteration to compute this matrix is given. The theory is first developed for MAPs without positive jumps and then extended to include positive jumps having phase-type distributions. Numerical and analytical examples show agreement with existing results in special cases.

This paper is concerned with submultiplicative moments for the stationary distributions π of some Markov chains taking values in ℝ+ or ℝ which are closely related to the random walks generated by sequences of independent identically distributed random variables. Necessary and sufficient conditions are given for ∫φ(x)π(dx) < ∞, where φ(x) is a submultiplicative function, i.e. φ(0) = 1 and φ(x+y) ≤ φ(x)φ(y) for all x, y.

The scan statistic is defined as the supremum of a particular continuous-time stochastic process, and is used as a test statistic for testing uniformity against a simple clustering type of alternative. Its distribution under the null hypothesis is investigated and weak convergence of the stochastic process to the appropriate Gaussian process is proved. An interesting link is forged between the circular scan statistic and Kuiper's statistic, which rids us of the trouble of estimating a nuisance parameter. Distributions under the alternative are then derived, and asymptotic power comparisons are made.