This paper considers a class of continuous-time long-range-dependent Gaussian processes. The corresponding spectral density is assumed to have a general and flexible form, which covers some important and special cases. For example, the spectral density of a continuous-time fractional stochastic differential equation is included. A modelling procedure is then established through estimating the parameters involved in the spectral density by using an extended continuous-time version of the Gauss–Whittle objective function. The resulting estimates are shown to be strongly consistent and asymptotically normal. An application of the modelling procedure to the identification and modelling of a fractional stochastic volatility is discussed in some detail.

In this paper, we obtain sharp estimates for the expected payoffs and prices of European call options on an asset with an absolutely continuous price in terms of the price density characteristics. These techniques and results complement other approaches to the derivative pricing problem. Exact analytical solutions to option-pricing problems and to Monte-Carlo techniques make strong assumptions on the underlying asset's distribution. In contrast, our results are semi-parametric. This allows the derivation of results without knowing the entire distribution of the underlying asset's returns. Our results can be used to test different modelling assumptions. Finally, we derive bounds in the multiperiod binomial option-pricing model with time-varying moments. Our bounds reduce the multiperiod setup to a two-period setting, which is advantageous from a computational perspective.

Consider a sequence of independent Bernoulli trials with success probability p. Let N(n; k 1, k 2) denote the number of times that k 1 failures are followed by k 2 successes among the first n Bernoulli trials. We employ the Stein-Chen method to obtain a total variation upper bound for the rate of convergence of N(n; k 1, k 2) to a suitable Poisson random variable. As a special case, the corresponding limit theorem is established. Similar results are obtained for N k 3 (n; k 1, k 2), the number of times that k 1 failures followed by k 2 successes occur k 3 times successively in n Bernoulli trials. The bounds obtained are generally sharper than, and improve upon, some of the already known results. Finally, the technique is adapted to obtain Poisson approximation results for the occurrences of the above-mentioned events under Markov-dependent trials.

This paper investigates the rate of convergence to the probability distribution of the embedded M/G/1 and GI/M/n queues. We introduce several types of ergodicity including l-ergodicity, geometric ergodicity, uniformly polynomial ergodicity and strong ergodicity. The usual method to prove ergodicity of a Markov chain is to check the existence of a Foster–Lyapunov function or a drift condition, while here we analyse the generating function of the first return probability directly and obtain practical criteria. Moreover, the method can be extended to M/G/1- and GI/M/1-type Markov chains.

In supercritical population-size-dependent branching processes with independent and identically distributed random environments, it is shown that under certain regularity conditions there exist constants 0 < α 1 ≤α 0 < + ∞ and 0 < C 1, C 2 < + ∞ such that the extinction probability starting with k individuals is bounded below by C 1 k -α 0 and above by C 2 k -α 1 for sufficiently large k. Moreover, a similar conclusion, which follows from a result of Höpfner, is presented along with some remarks.

This paper studies a class of stationary covariance models, in both the discrete- and the continuous-time domains, which possess a simple functional form γ(τ + τ0)+γ(τ − τ0)− 2γ(τ), where τ 0 is a fixed lag andγ(τ) is an intrinsically stationary variogram, and include the fractional Gaussian noise of Kolmogorov (1940) and a stochastic volatility model of Barndorff-Nielsen and Shephard (2001), (2002) as special cases. Properties of the class, and interesting special cases with long memory, are studied. We also characterize the covariance function via the variogram.

Optimal stopping rules are developed for the correlated random walk when future returns are discounted by a constant factor per unit time. The optimal rule is shown to be of dual threshold form: one threshold for stopping after an up-step, and another for stopping after a down-step. Precise expressions for the thresholds are given for both the positively and the negatively correlated cases. The optimal rule is illustrated by several numerical examples.

We derive a large-deviation principle for super-Brownian motion with immigration, where the immigration is governed by the Lebesgue measure. We show that the speed function is t 1/2 for d = 1, t/logt for d = 2 and t for d ≥ 3, which is different from that of the occupation-time process counterpart (without immigration) and the model of random immigration.

In this paper, insurance claims X on [0, ∞) with tail distributions which are O(x−δ) for some δ > 1 are considered. Markets are assumed arbitrageable, the insurer setting a premium P > E[X]. Setting a premium as a fixed quantile of the loss distribution presents difficulties; for Pareto distributions with F(x) = 1 – (x + l)–δ ‘ultimately' (as δ ↓ 1) E[X] is larger than any quantile. When δ is near 1, premiums determined by weighting outcomes and a rule analogous to the expected utility principle are highly sensitive to change in δ, which is generally unknown or known only approximately. Under these circumstances, to protect insurers' interests, strategies are needed which provide some ‘premium stability' across a range of δ-values. We introduce a class of pricing functions which are functionally dependent on the governing loss distribution, and which are themselves distribution functions. We demonstrate that they provide a coherent framework for pricing insurance premiums when the loss distribution is fat tailed, and enable some degree of premium stability to be established.

For a K-stage cyclic queueing network with N customers and general service times, we provide bounds on the nth departure time from each stage. Furthermore, we analyze the asymptotic tail behavior of cycle times and waiting times given that at least one service-time distribution is subexponential.

We prove some central limit theorems for a two-level super-Brownian motion with random immigration, which lead to limiting Gaussian random fields. The covariances of those Gaussian fields are explicitly characterized.

We demonstrate that the residual lifetime distribution of a compound geometric distribution convoluted with another distribution, termed a compound geometric convolution, is again a compound geometric convolution. Conditions under which the compound geometric convolution is new worse than used (NWU) or new better than used (NBU) are then derived. The results are applied to ruin probabilities in the stationary renewal risk model where the convolution components are of particular interest, as well as to the equilibrium virtual waiting time distribution in the G/G/1 queue, an approximation to the equilibrium M/G/c waiting time distribution, ruin in the classical risk model perturbed by diffusion, and second-order reliability classifications.

We study numerical integration based on Markov chains. Our focus is on establishing error bounds uniformly on classes of integrands. Since in general state space the concept of uniform ergodicity is too restrictive to cover important cases, we analyze the error of V-uniformly ergodic Markov chains. We place emphasis on the interplay between ergodicity properties of the transition kernel, the initial distributions and the classes of integrands. Our analysis is based on arguments from interpolation theory.

This paper has as its main theme the fitting in practice of the variance-gamma distribution, which allows for skewness, by moment methods. This fitting procedure allows for possible dependence of increments in log returns, while retaining their stationarity. It is intended as a step in a partial synthesis of some ideas of Madan, Carr and Chang (1998) and of Heyde (1999). Standard estimation and hypothesis-testing theory depends on a large sample of observations which are independently as well as identically distributed and consequently may give inappropriate conclusions in the presence of dependence.

Let {X(t), V(t), t ≥ 0} be a telegraph process, with V(0+) = 1. The distribution of X(t) is derived for the general case of an alternating renewal process, describing the length of time a particle is moving to the right or to the left. The distributions of the first-crossing times of given levels a and −a are studied for M/G and for G/M processes.

In this paper, we study the on-line parameter estimation problem for a partially observable system subject to deterioration and random failure. The state of the system evolves according to a continuous-time homogeneous Markov process with a finite state space. The state of the system is hidden except for the failure state. When the system is operating, only the information obtained by condition monitoring, which is related to the working state of the system, is available. The condition monitoring observations are assumed to be in continuous range, so that no discretization is required. A recursive maximum likelihood (RML) algorithm is proposed for the on-line parameter estimation of the model. The new RML algorithm proposed in the paper is superior to other RML algorithms in the literature in that no projection is needed and no calculation of the gradient on the surface of the constraint manifolds is required. A numerical example is provided to illustrate the algorithm.

An annihilating process is an interacting particle system in which the only interaction is that a particle may kill a neighbouring particle. Since there is no birth and no movement, once a particle has no neighbours its site remains occupied for ever. The survival probability is calculated for a random tree and for the square lattice. A connection is made between annihilating processes and the adsorption of molecules onto surfaces. A one-dimensional adsorption problem is solved in the case in which the two neighbours do not act independently.

Univariate heavy-tailed analysis rests on the analytic notion of regularly varying functions. For multivariate heavy-tailed analysis, reliance on functions is awkward because multivariate distribution functions are not natural objects for many purposes and are difficult to manipulate. An approach based on vague convergence of measures makes the differences between univariate and multivariate analysis evaporate. We survey the foundations of the subject and discuss statistical attempts to assess dependence of large values. An exploratory technique is applied to exchange rate return data and shows clear differences in the dependence structure of large values for the Japanese Yen versus German Mark compared with the French Franc versus the German Mark.

Recently, several authors have studied the transient and the equilibrium behaviour of stochastic population processes with total catastrophes. These models are reasonable for modelling populations that are exposed to extreme disastrous phenomena. However, under mild disastrous conditions, the appropriate model is a stochastic process subject to binomial catastrophes. In the present paper we consider a special such model in which a population evolves according to a compound Poisson process and catastrophes occur according to a renewal process. Every individual of the population survives after a catastrophe with probability p, independently of anything else, i.e. the population size is reduced according to a binomial distribution. We study the equilibrium distribution of this process and we derive an algorithmic procedure for its approximate computation. Bounds on the error of this approximation are also included.

In the characterization of multivariate extremal indices of multivariate stationary processes, multivariate maxima of moving maxima processes, or M4 processes for short, have been introduced by Smith and Weissman. Central to the introduction of M4 processes is that the extreme observations of multivariate stationary processes may be characterized in terms of a limiting max-stable process under quite general conditions, and that a max-stable process can be arbitrarily closely approximated by an M4 process. In this paper, we derive some additional basic probabilistic properties for a finite class of M4 processes, each of which contains finite-range clustered moving patterns, called signature patterns, when extreme events occur. We use these properties to construct statistical estimation schemes for model parameters.