To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure no-reply@cambridge.org
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
In this paper we consider the class of Lévy processes that can be written as a Brownian motion time changed by an independent Lévy subordinator. Examples in this class include the variance-gamma (VG) model, the normal-inverse Gaussian model, and other processes popular in financial modeling. The question addressed is the precise relation between the standard first passage time and an alternative notion, which we call the first passage of the second kind, as suggested by Hurd (2007) and others. We are able to prove that the standard first passage time is the almost-sure limit of iterations of the first passage of the second kind. Many different problems arising in financial mathematics are posed as first passage problems, and motivated by this fact, we are led to consider the implications of the approximation scheme for fast numerical methods for computing first passage. We find that the generic form of the iteration can be competitive with other numerical techniques. In the particular case of the VG model, the scheme can be further refined to give very fast algorithms.
In this paper we consider an extension of the Sparre Andersen insurance risk model by relaxing one of its independence assumptions. The newly proposed dependence structure is introduced through the premise that the joint distribution of the interclaim time and the subsequent claim size is bivariate phase-type (see, e.g. Assaf et al. (1984) and Kulkarni (1989)). Relying on the existing connection between risk processes and fluid flows (see, e.g. Badescu et al. (2005), Badescu, Drekic and Landriault (2007), Ramaswami (2006), and Ahn, Badescu and Ramaswami (2007)), we construct an analytically tractable fluid flow that leads to the analysis of various ruin-related quantities in the aforementioned risk model. Using matrix-analytic methods, we obtain an explicit expression for the Gerber–Shiu discounted penalty function (see Gerber and Shiu (1998)) when the penalty function depends on the deficit at ruin only. Finally, we investigate how some ruin-related quantities involving the surplus immediately prior to ruin can also be analyzed via our fluid flow methodology.
We study defaultable bond prices in the Black–Cox model with jumps in the asset value. The jump-size distribution is arbitrary, and following Longstaff and Schwartz (1995) and Zhou (2001) we assume that, if default occurs, the recovery at maturity depends on the ‘severity of default’. Under this general setting, the vehicle for our analysis is an integral equation. With the aid of this, we prove some properties of the bond price which are consistent numerically and empirically with earlier works. In particular, the limiting credit spread as time to maturity tends to 0 is nonzero. As a byproduct, we show that the integral equation implies an infinite-series expansion for the bond price.
Let Xi be transient βi-stable processes on ℝdi, i=1,2. Assume further that X1 and X2 are independent. We shall find the exact Hausdorff measure function for the product sets R1(1)×R2(1), where . The result of Hu generalizes [Some fractal sets determined by stable processes, Probab. Theory Related Fields100 (1994), 205–225].
We consider a stochastic fluid queue served by a constant rate server and driven by a process which is the local time of a reflected Lévy process. Such a stochastic system can be used as a model in a priority service system, especially when the time scales involved are fast. The input (local time) in our model is typically (but not necessarily) singular with respect to the Lebesgue measure, a situation which, in view of the nonsmooth or bursty nature of several types of Internet traffic, is nowadays quite realistic. We first discuss how to rigorously construct the (necessarily) unique stationary version of the system under some natural stability conditions. We then consider the distribution of performance steady-state characteristics, namely, the buffer content, the idle period, and the busy period. These derivations are much based on the fact that the inverse of the local time of a Markov process is a Lévy process (a subordinator), hence making the theory of Lévy processes applicable. Another important ingredient in our approach is the use of Palm calculus for stationary random point processes and measures.
In the subfair red-and-black gambling problem, a gambler can stake any amount in his possession, winning an amount equal to the stake with probability w and losing the stake with probability 1 − w, where 0 < w < ½. The gambler seeks to maximize the probability of reaching a fixed fortune (to be normalized to unity) by gambling repeatedly with suitably chosen stakes. In their classic work, Dubins and Savage (1965), (1976) showed that it is optimal to play boldly. When there is a house limit of l (0 < l < ½), so that the gambler can stake no more than l, Wilkins (1972) showed that bold play remains optimal provided that 1 / l is an integer. On the other hand, building on an earlier surprising result of Heath, Pruitt and Sudderth (1972), Schweinsberg (2005) recently showed that, for all irrational 0 < l < ½ and all 0 < w < ½, bold play is not optimal for some initial fortune. The purpose of the present paper is to present several results supporting the conjecture that, for all rational l with 1 / l not an integer and all 0 < w < ½, bold play is not optimal for some initial fortune. While most of these results are based on Schweinsberg's method, in a special case where his method is shown to be inapplicable, we argue that the conjecture can be verified with the help of symbolic-computation software.
In this paper we study the α-stable continuous-state branching processes (for α ∈ (1, 2]) and the α-stable continuous-state branching processes conditioned never to become extinct in the light of positive self-similarity. Understanding the interaction of the Lamperti transformation for continuous-state branching processes and the Lamperti transformation for positive, self-similar Markov processes gives access to a number of explicit results concerning the paths of α-stable continuous-state branching processes and α-stable continuous-state branching processes conditioned never to become extinct.
Consider a sequence (Xk: k ≥ 0) of regularly varying independent and identically distributed random variables with mean 0 and finite variance. We develop efficient rare-event simulation methodology associated with large deviation probabilities for the random walk (Sn: n ≥ 0). Our techniques are illustrated by examples, including large deviations for the empirical mean and path-dependent events. In particular, we describe two efficient state-dependent importance sampling algorithms for estimating the tail of Sn in a large deviation regime as n ↗ ∞. The first algorithm takes advantage of large deviation approximations that are used to mimic the zero-variance change of measure. The second algorithm uses a parametric family of changes of measure based on mixtures. Lyapunov-type inequalities are used to appropriately select the mixture parameters in order to guarantee bounded relative error (or efficiency) of the estimator. The second example involves a path-dependent event related to a so-called knock-in financial option under heavy-tailed log returns. Again, the importance sampling algorithm is based on a parametric family of mixtures which is selected using Lyapunov bounds. In addition to the theoretical analysis of the algorithms, numerical experiments are provided in order to test their empirical performance.
Classical results for exchangeable systems of random variables are extended to multiclass systems satisfying a natural partial exchangeability assumption. It is proved that the conditional law of a finite multiclass system, given the value of the vector of the empirical measures of its classes, corresponds to independent uniform orderings of the samples within {each} class, and that a family of such systems converges in law {if and only if} the corresponding empirical measure vectors converge in law. As a corollary, convergence within {each} class to an infinite independent and identically distributed system implies asymptotic independence between {different} classes. A result implying the Hewitt-Savage 0-1 law is also extended.
In this paper we consider a single-server queue with Lévy input and, in particular, its workload process (Qt)t≥0, with a focus on the correlation structure. With the correlation function defined as r(t) := cov(Q0, Qt) / var(Q0) (assuming that the workload process is in stationarity at time 0), we first determine its transform ∫0∞r(t)e-ϑtdt. This expression allows us to prove that r(·) is positive, decreasing, and convex, relying on the machinery of completely monotone functions. We also show that r(·) can be represented as the complementary distribution function of a specific random variable. These results are used to compute the asymptotics of r(t), for large t, for the cases of light-tailed and heavy-tailed Lévy inputs.
We study the number of collisions, Xn, of an exchangeable coalescent with multiple collisions (Λ-coalescent) which starts with n particles and is driven by rates determined by a finite characteristic measure η(dx) = x−2Λ(dx). Via a coupling technique, we derive limiting laws of Xn, using previous results on regenerative compositions derived from stick-breaking partitions of the unit interval. The possible limiting laws of Xn include normal, stable with index 1 ≤ α < 2, and Mittag-Leffler distributions. The results apply, in particular, to the case when η is a beta(a − 2, b) distribution with parameters a > 2 and b > 0. The approach taken allows us to derive asymptotics of three other functionals of the coalescent: the absorption time, the length of an external branch chosen at random from the n external branches, and the number of collision events that occur before the randomly selected external branch coalesces with one of its neighbours.
The upper tail behaviour is explored for a stopped random product ∏j=1NXj, where the factors are positive and independent and identically distributed, and N is the first time one of the factors occupies a subset of the positive reals. This structure is motivated by a heavy-tailed analogue of the factorial n!, called the factoid of n. Properties of the factoid suggested by computer explorations are shown to be valid. Two topics about the determination of the Zipf exponent in the rank-size law for city sizes are discussed.
In this paper, a fourth moment bound for partial sums of functionals of strongly ergodic Markov chains is established. This type of inequality plays an important role in the study of the empirical process invariance principle. This inequality is specially adapted to the technique of Dehling, Durieu, and Volný (2008). The same moment bound can be proved for dynamical systems whose transfer operator has some spectral properties. Examples of applications are given.
Customers arriving at a queue do not usually see its time-average behavior unless arrivals occur according to a Poisson process. In this article we study how nearly customers see time-average behavior. We give total variation error bounds for comparing the distance between the time- and customer-average distributions of a queueing system in terms of properties of the interarrival distribution. Some refinements are given for special cases and numerical computations are used to demonstrate the performance of the inequalities.
We study investment and disinvestment decisions in situations where there is a time lag d > 0 from the time t when the decision is taken to the time t + d when the decision is implemented. In this paper we apply the probabilistic approach to the combined entry and exit decisions under the Parisian implementation delay. In particular, we prove the independence between Parisian stopping times and a general Brownian motion with drift stopped at the stopping time. Relying on this result, we solve the constrained maximization problem, obtaining an analytic solution to the optimal ‘starting’ and ‘stopping’ levels. We compare our results with the instantaneous entry and exit situation, and show that an increase in the uncertainty of the underlying process hastens the decision to invest or disinvest, extending a result of Bar-Ilan and Strange (1996).
We investigate the properties of multifractal products of geometric Ornstein-Uhlenbeck (OU) processes driven by Lévy motion. The conditions on the mean, variance, and covariance functions of the resulting cumulative processes are interpreted in terms of the moment generating functions. We consider five cases of infinitely divisible distributions for the background driving Lévy processes, namely, the gamma and variance gamma distributions, the inverse Gaussian and normal inverse Gaussian distributions, and the z-distributions. We establish the corresponding scenarios for the limiting processes, including their Rényi functions and dependence structure.
We introduce a modification of the linear ARCH (LARCH) model (Giraitis, Robinson, and Surgailis (2000)) - a special case of Sentana's (1995) quadratic ARCH (QARCH) model - for which the conditional variance is a sum of a positive constant and the square of an inhomogeneous linear combination of past observations. Necessary and sufficient conditions for the existence of a stationary solution with finite variance are obtained. We give conditions under which the stationary solution with infinite fourth moment can exhibit long memory, the leverage effect, and a Lévy-stable limit behavior of partial sums of squares.
A systematic study of random Laguerre tessellations, weighted generalisations of the well-known Voronoi tessellations, is presented. We prove that every normal tessellation with convex cells in dimension three and higher is a Laguerre tessellation. Tessellations generated by stationary marked Poisson processes are then studied in detail. For these tessellations, we obtain integral formulae for geometric characteristics and densities of the typical k-faces. We present a formula for the linear contact distribution function and prove various limit results for convergence of Laguerre to Poisson-Voronoi tessellations. The obtained integral formulae are subsequently evaluated numerically for the planar case, demonstrating their applicability for practical purposes.
We consider a piecewise-deterministic Markov process (Xt) governed by a jump intensity function, a rate function that determines the behaviour between jumps, and a stochastic kernel describing the conditional distribution of jump sizes. The paper deals with the point process of upcrossings of some level b by (Xt). We prove a version of Rice's formula relating the stationary density of (Xt) to level crossing intensities and show that, for a wide class of processes (Xt), as b → ∞, the scaled point process where ν+(b) denotes the intensity of upcrossings of b, converges weakly to a geometrically compound Poisson process.
We discuss some issues regarding the accuracy of a quantile-based estimation of risk capital. In this context, extreme value theory (EVT) emerges naturally. The paper sheds some further light on the ongoing discussion concerning the use of a semi-parametric approach like EVT and the use of specific parametric models such as the g-and-h. In particular, we discusses problems and pitfalls evolving from such parametric models when using EVT and highlight the importance of the underlying second-order tail behavior.