In this paper, we discuss max-sum equivalence and convolution closure of heavy-tailed distributions. We generalize the well-known max-sum equivalence and convolution closure in the class of regular variation to two larger classes of heavy-tailed distributions. As applications of these results, we study asymptotic behaviour of the tails of compound geometric convolutions, the ruin probability in the compound Poisson risk process perturbed by an α-stable Lévy motion, and the equilibrium waiting-time distribution of the M/G/k queue.

There are standard modifications of certain compactly supported wavelets that yield orthonormal bases on a bounded interval. We extend one such construction to those wavelets, such as ‘coiflets', that may have fewer vanishing moments than had to be assumed previously. Our motivation lies in function estimation in statistics. We use these boundary-modified coiflets to show that the discrete wavelet transform of finite data from sampled regression models asymptotically provides a close approximation to the wavelet transform of the continuous Gaussian white noise model. In particular, estimation errors in the discrete setting of computational practice need not be essentially larger than those expected in the continuous setting of statistical theory.

Caching is an effective mechanism for reducing bandwidth usage and alleviating server load. However, the use of caching entails a compromise between content freshness and refresh cost. Constant refreshing allows a high degree of content freshness at a greater cost of system resource. Conversely, too little refreshing reduces content freshness but saves the cost of resource usage. To address the freshness-cost problem, we formulate the refresh scheduling problem with a generic cost model and use this cost model to determine an optimal refresh frequency that gives the best trade-off between refresh cost and content freshness. We prove the existence and uniqueness of an optimal refresh frequency under the assumptions that the arrival of updated content is Poisson and the age-related cost monotonically increases with decreasing freshness. In addition, we provide an analytic comparison of system performance under fixed refresh scheduling and random refresh scheduling, showing that two refresh schedulings with the same average refresh frequency are mathematically equivalent in terms of the long-run average cost.

Known results relating the tail behaviour of a compound Poisson distribution function to that of its Lévy measure when one of them is convolution equivalent are extended to general infinitely divisible distributions. A tail equivalence result is obtained for random sum distributions in which the summands have a two-sided distribution.

We consider a branching model, which we call the collision branching process (CBP), that accounts for the effect of collisions, or interactions, between particles or individuals. We establish that there is a unique CBP, and derive necessary and sufficient conditions for it to be nonexplosive. We review results on extinction probabilities, and obtain explicit expressions for the probability of explosion and the expected hitting times. The upwardly skip-free case is studied in some detail.

One approach to the computation of the price of an Asian option involves the Hartman–Watson distribution. However, numerical problems for its density occur for small values. This motivates the asymptotic study of its distribution function.

Burn-in is a widely used engineering procedure useful for eliminating ‘weak’ items and consequently improving the quality of remaining items. The quality of items can be measured via various performance characteristics. In the present paper we develop new performance criteria for the burn-in method. Our criteria not only take into account the reliability of an item, they also incorporate covariates.

We observe a sequence X 1, X 2,…, X n of independent and identically distributed coordinatewise nonnegative d-dimensional random vectors. When a vector is observed it can either be selected or rejected but once made this decision is final. In each coordinate the sum of the selected vectors must not exceed a given constant. The problem is to find a selection policy that maximizes the expected number of selected vectors. For a general absolutely continuous distribution of the X i we determine the maximal expected number of selected vectors asymptotically and give a selection policy which asymptotically achieves optimality. This problem raises a question closely related to the following problem. Given an absolutely continuous measure μ on Q = [0,1] d and a τ ∈ Q, find a set A of maximal measure μ(A) among all A ⊂ Q whose center of gravity lies below τ in all coordinates. We will show that a simplicial section { x ∈ Q | 〈 x , θ 〉 ≤ 1}, where θ ∈ ℝ d , θ ≥ 0, satisfies a certain additional property, is a solution to this problem.

We study geometric moment contracting properties of nonlinear time series that are expressed in terms of iterated random functions. Under a Dini-continuity condition, a central limit theorem for additive functionals of such systems is established. The empirical processes of sample paths are shown to converge to Gaussian processes in the Skorokhod space. An exponential inequality is established. We present a bound for joint cumulants, which ensures the applicability of several asymptotic results in spectral analysis of time series. Our results provide a vehicle for statistical inferences for fractals and many nonlinear time series models.

This paper introduces a new estimation technique for discretely observed diffusion processes. Transform functions are applied to transform the data to obtain good and easily calculated estimators of both the drift and diffusion coefficients. Consistency and asymptotic normality of the resulting estimators is investigated. Power transforms are used to estimate the parameters of affine diffusions, for which explicit estimators are obtained.

The focus of our attention is the limit distribution of the sum of independent and identically distributed random vectors from which all the extreme summands are removed. The problem is rather trivial if the summands are ordered by their norms. It is of much more interest when the vertices of the convex hull generated by the vectors are taken as the extremes.

The maximum drawdown at time T of a random process on [0,T] can be defined informally as the largest drop from a peak to a trough. In this paper, we investigate the behaviour of this statistic for a Brownian motion with drift. In particular, we give an infinite series representation of its distribution and consider its expected value. When the drift is zero, we give an analytic expression for the expected value, and for nonzero drift, we give an infinite series representation. For all cases, we compute the limiting (T → ∞) behaviour, which can be logarithmic (for positive drift), square root (for zero drift) or linear (for negative drift).

The ‘rendezvous time’ of two stochastic processes is the first time at which they cross or hit each other. We consider such times for a Brownian motion with drift, starting at some positive level, and a compound Poisson process or a process with one random jump at some random time. We also ask whether a rendezvous takes place before the Brownian motion hits zero and, if so, at what time. These questions are answered in terms of Laplace transforms for the underlying distributions. The analogous problem for reflected Brownian motion is also studied.

This paper applies the theory of the quasi-likelihood method to model-based inference for sample surveys. Currently, much of the theory related to sample surveys is based on the theory of maximum likelihood. The maximum likelihood approach is available only when the full probability structure of the survey data is known. However, this knowledge is rarely available in practice. Based on central limit theory, statisticians are often willing to accept the assumption that data have, say, a normal probability structure. However, such an assumption may not be reasonable in many situations in which sample surveys are used. We establish a framework for sample surveys which is less dependent on the exact underlying probability structure using the quasi-likelihood method.

We consider a fluid queue controlled by a semi-Markov process and we apply the Markov-renewal approach developed earlier in the context of quasi-birth-and-death processes and of Markovian fluid queues. We analyze two subfamilies of semi-Markov processes. In the first family, we assume that the intervals during which the input rate is negative have an exponential distribution. In the second family, we take the complementary case and assume that the intervals during which the input rate is positive have an exponential distribution. We thoroughly characterize the structure of the stationary distribution in both cases.

In this work we prove the existence of a solution for a doubly reflected backward SDE with a continuous linearly increasing coefficient in the case where the barriers L and U are such that L < U on [0,T) and there exists a continuous semimartingale between L and U.

In this paper we review some recent work on limit results on realised power variation, that is, sums of powers of absolute increments of various semimartingales. A special case of this analysis is realised variance and its probability limit, quadratic variation. Such quantities often appear in financial econometrics in the analysis of volatility. The paper also provides some new results and discusses open issues.

The eigentime identity is proved for continuous-time reversible Markov chains with Markov generator L. When the essential spectrum is empty, let {0 = λ0 < λ1 ≤ λ2 ≤ ···} be the whole spectrum of L in L2. Then ∑ n≥1 λ n -1 < ∞ implies the existence of the spectral gap α of L in L∞. Explicit formulae are presented in the case of birth–death processes and from these formulae it is proved that ∑ n≥1 λ n -1 < ∞ if and only if α > 0.

Continuous-time random walks incorporate a random waiting time between random jumps. They are used in physics to model particle motion. A physically realistic rescaling uses two different time scales for the mean waiting time and the deviation from the mean. This paper derives the scaling limits for such processes. These limit processes are governed by fractional partial differential equations that may be useful in physics. A transfer theorem for weak convergence of finite-dimensional distributions of stochastic processes is also obtained.

We consider an infinite-capacity second-order fluid queue governed by a continuous-time Markov chain and with linear service rate. The variability of the traffic is modeled by a Brownian motion and a local variance function modulated by the Markov chain and proportional to the fluid level in the queue. The behavior of this second-order fluid-flow model is described by a linear stochastic differential equation, satisfied by the transient queue level. We study the transient level's convergence in distribution under weak assumptions and we obtain an expression for the stationary queue level. For the first-order case, we give a simple expression of all its moments as well as of its Laplace transform. For the second-order model we compute its first two moments.