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.
We consider the lifetimes of systems that can be modeled as particles that move within a bounded region in ℝn. Particles move within the set according to a random walk, and particles that leave the set are lost. We divide the set into equal cells and define the lifetime of the set as the time required for the number of particles in one of the cells to fall below a predetermined threshold. We show that the lifetime of the system, given a sufficiently large number of particles, is Weibull distributed.
Let {Xk, k=1,2,…} be a sequence of independent random variables with common subexponential distribution F, and let {wk, k=1,2,…} be a sequence of positive numbers. Under some mild summability conditions, we establish simple asymptotic estimates for the extreme tail probabilities of both the weighted sum ∑k=1nwkXk and the maximum of weighted sums max1≤m≤n∑k=1mwkXk, subject to the requirement that they should hold uniformly for n=1,2,…. Potentially, a direct application of the result is to risk analysis, where the ruin probability is to be evaluated for a company having gross loss Xk during the kth year, with a discount or inflation factor wk.
Random vectors in the positive orthant whose distributions possess hidden regular variation are a subclass of those whose distributions are multivariate regularly varying with asymptotic independence. The concept is an elaboration of the coefficient of tail dependence of Ledford and Tawn. We show that the rank transform that brings unequal marginals to the standard case also preserves the hidden regular variation. We discuss applications of the results to two examples, one involving flood risk and the other Internet data.
For general risk processes, we introduce and study the expected time-integrated negative part of the process on a fixed time interval. Differentiation theorems are stated and proved. They make it possible to derive the expected value of this risk measure, and to link it with the average total time below 0, studied by Dos Reis, and the probability of ruin. We carry out differentiation of other functionals of one-dimensional and multidimensional risk processes with respect to the initial reserve level. Applications to ruin theory, and to the determination of the optimal allocation of the global initial reserve that minimizes one of these risk measures, illustrate the variety of fields of application and the benefits deriving from an efficient and effective use of such tools.
In this paper, we consider a certain type of space- and time-fractional kinetic equation with Gaussian or infinitely divisible noise input. The solutions to the equation are provided in the cases of both bounded and unbounded domains, in conjunction with bounds for the variances of the increments. The role of each of the parameters in the equation is investigated with respect to second- and higher-order properties. In particular, it is shown that long-range dependence may arise in the temporal solution under certain conditions on the spatial operators.
We study the asymptotic tail behavior of the conditional probability distributions of rt+k and rt+1+⋯+rt+k when (rt)t∈ℕ is a GARCH(1, 1) process. As an application, we examine the relation between the extreme lower quantiles of these random variables.
In this paper we derive precise tail-area approximations for the sum of an arbitrary finite number of independent heavy-tailed random variables. In order to achieve second-order asymptotics, a mild regularity condition is imposed on the class of distribution functions with regularly varying tails.
Higher-order asymptotics are also obtained when considering asemiparametric subclass of distribution functions with regularly varying tails. These semiparametric subclasses are shown to be closed under convolutions and a convolution algebra is constructed to evaluate the parameters of a convolution from the parameters of the constituent distributions in the convolution. A Maple code is presented which does this task.
In this work, we study some geometrical properties of a stationary Gaussian field modeling the sea surface, using the energy spectrum. We consider the length of a crest and the mean speed of contours, which can be expressed as integrals over level sets. We also give central limit theorems for some of these quantities, using chaos expansions.
Suppose that a gambler starts with a fortune in (0,1) and wishes to attain a fortune of 1 by making a sequence of bets. Assume that whenever the gambler stakes an amount s, the gambler's fortune increases by s with probability w and decreases by s with probability 1 − w, where w < ½. Dubins and Savage showed that the optimal strategy, which they called ‘bold play’, is always to bet min{f, 1 − f}, where f is the gambler's current fortune. Here we consider the problem in which the gambler may stake no more than ℓ at one time. We show that the bold strategy of always betting min{ℓ, f, 1 − f} is not optimal if ℓ is irrational, extending a result of Heath, Pruitt, and Sudderth.
We consider solutions of Burgers' equation with linear or quadratic external potential and stationary random initial conditions of Ornstein-Uhlenbeck type. We study a class of limit laws that correspond to a scale renormalization of the solutions.
We consider a heterogeneous population of identical particles divided into a finite number of classes according to their level of health. The partition can change over time, and a suitable exchangeability assumption is made to allow for having identical items of different types. The partition is not observed; we only observe the cardinality of a particular class. We discuss the problem of finding the conditional distribution of particle lifetimes, given such observations, using stochastic filtering techniques. In particular, a discrete-time approximation is given.
Stochastic processes with Student marginals and various types of dependence structure, allowing for both short- and long-range dependence, are discussed in this paper. A particular motivation is the modelling of risky asset time series.
Mr. G owes $100 000 to a loan shark, and will be killed at dawn if the loan is not repaid in full. Mr. G has $20 000, but partial payments are not accepted, and he has no other source of income or credit. The loan shark owns a primitive casino where one can stake any amount in one's possession, gaining r times the stake with probability w and losing the stake with probability 1 - w (r > 0, 0 < w < 1). Mr. G is permitted to gamble at the casino, but each time he places a bet, the amount of his debt is increased by a factor of 1 + α (α ≥ 0). How should Mr. G gamble to maximize his chance of reaching his (moving) target and thereby surviving? Dubins and Savage showed that an optimal strategy is to stake boldly if the primitive casino is subfair or fair (i.e. w(1 + r) ≤ 1) and the inflation rate α is 0. Intuitively, a positive inflation rate would motivate Mr. G to try to reach his goal as quickly as possible, so it seems plausible that the bold strategy is optimal. However, Chen, Shepp, and Zame found that, surprisingly, the bold strategy is no longer optimal for subfair primitive casinos with inflation if both r > 1 and α satisfies 1/r ≤ α < r. They also conjectured that the bold strategy is optimal for subfair primitive casinos with inflation if r < 1. It is shown in the present paper that this conjecture is true provided that w ≤ ½. Furthermore, by introducing an interesting notion of sharp strategy, additional results are obtained on optimality of the bold strategy.
We give explicit upper bounds for convergence rates when approximating both one- and two-sided general curvilinear boundary crossing probabilities for the Wiener process by similar probabilities for close boundaries of simpler form, for which computation of the boundary crossing probabilities is feasible. In particular, we partially generalize and improve results obtained by Pötzelberger and Wang in the case when the approximating boundaries are piecewise linear. Applications to barrier option pricing are also discussed.
The first passage time of a random walk to a barrier (constant or concave) is of great importance in many areas, such as insurance, finance, and sequential analysis. Here, we consider a sum of independent, identically distributed random variables and the convex barrier cb(n/c), where c is a scale parameter and n is time. It is shown, using large-deviation techniques, that the limit distribution of the first passage time decays exponentially in c. Under a tilt of measure, which changes the drift, four properties are proved: the limit distribution of the overshoot is distributed as an overshoot over a linear barrier; the stopping time is asymptotically normally distributed when it is properly normalized; the overshoot and the asymptotic normal part are asymptotically independent; and the overshoot over a linear barrier is bounded by an exponentially distributed random variable. The determination of the function that multiplies the exponential part is guided by consideration of these properties.
Let (Yn, Nn)n≥1 be independent and identically distributed bivariate random variables such that the Nn are positive with finite mean ν and the Yn have a common heavy-tailed distribution F. We consider the process (Zn)n≥1 defined by Zn = Yn - Σn-1, where It is shown that the probability that the maximum M = maxn≥1Zn exceeds x is approximately as x → ∞, where F' := 1 - F. Then we study the integrated tail of the maximum of a random walk with long-tailed increments and negative drift over the interval [0, σ], defined by some stopping time σ, in the case in which the randomly stopped sum is negative. Finally, an application to risk theory is considered.
In practical situations, we observe the number of claims to an insurance portfolio but not the claim intensity. It is therefore of interest to try to solve the ‘filtering problem’; that is, to obtain the best estimate of the claim intensity on the basis of reported claims. In order to use the Kalman-Bucy filter, based on the Cox process incorporating a shot noise process as claim intensity, we need to approximate it by a Gaussian process. We demonstrate that, if the primary-event arrival rate of the shot noise process is reasonably large, we can then approximate the intensity, claim arrival, and aggregate loss processes by a three-dimensional Gaussian process. We establish weak-convergence results. We then use the Kalman-Bucy filter and we obtain the price of reinsurance contracts involving high-frequency events.
We introduce a class of Cox cluster processes called generalised shot noise Cox processes (GSNCPs), which extends the definition of shot noise Cox processes (SNCPs) in two directions: the point process that drives the shot noise is not necessarily Poisson, and the kernel of the shot noise can be random. Thereby, a very large class of models for aggregated or clustered point patterns is obtained. Due to the structure of GSNCPs, a number of useful results can be established. We focus first on deriving summary statistics for GSNCPs and, second, on how to simulate such processes. In particular, results on first- and second-order moment measures, reduced Palm distributions, the J-function, simulation with or without edge effects, and conditional simulation of the intensity function driving a GSNCP are given. Our results are exemplified in important special cases of GSNCPs, and we discuss their relation to the corresponding results for SNCPs.
Let X1, X2,…, Xn be independent, identically distributed random variables, uniform on [0,1]. We observe the Xk sequentially and must stop on exactly one of them. No recollection of the preceding observations is permitted. What stopping rule τ minimizes the expected rank of the selected observation? This full-information expected-rank problem is known as Robbins' problem. The general solution is still unknown, and only some bounds are known for the limiting value as n tends to infinity. After a short discussion of the history and background of this problem, we summarize what is known. We then try to present, in an easily accessible form, what the author believes should be seen as the essence of the more difficult remaining questions. The aim of this article is to evoke interest in this problem and so, simply by viewing it from what are possibly new angles, to increase the probability that a reader may see what seems to evade probabilistic intuition.
We prove the existence and uniqueness of the solution to certain reflected backward stochastic differential equations (RBSDEs) with one continuous barrier and deterministic terminal time, under monotonicity, and general increasing growth conditions on the associated coefficient. As an application, we obtain, in some constraint cases, the price of an American contingent claim as the unique solution of such an RBSDE.