Prediction of future values of a shot noise process observed on a discrete lattice of points is considered. The shot magnitudes are assumed to be independent and identically distributed and to arrive via a Poisson process; the effect of each shot dissipates and/or accumulates according to a known shot function. Conditional mean and linear point predictors of future process values are developed. Distributional prediction, obtained through saddlepoint approximation of the conditional distributions of the process, is also explored.

We derive explicit closed expressions for the moment generating functions of whole collections of quantities associated with the waiting time till the occurrence of composite events in either discrete or continuous-time models. The discrete-time models are independent, or Markov-dependent, binary trials and the events of interest are collections of successes with the property that each two consecutive successes are separated by no more than a fixed number of failures. The continuous-time models are renewal processes and the relevant events are clusters of points. We provide a unifying technology for treating both the discrete and continuous-time cases. This is based on first embedding the problems into similar ones for suitably selected Markov chains or Markov renewal processes, and second, applying tools from the exponential family technology.

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.

A trivariate equality of laws given by Doney and Yor is extended to a quadrivariate version. Some related explicit density calculations are carried out. It is shown that a bivariate case which has been used to establish the Dassios–Port–Wendel equality of laws is in fact equivalent to it.

Following Tweedie (1988), this paper constructs a special test function which leads to sufficient conditions for the stationarity and finiteness of the moments of a general non-linear time series model, the double threshold ARMA conditional heteroskedastic (DTARMACH) model. The results are applied to two well-known special cases, the GARCH and threshold ARMA (TARMA) models. The condition for the finiteness of the moments of the GARCH model is simple and easier to check than the condition given by Milhøj (1985) for the ARCH model. The condition for the stationarity of the TARMA model is identical to the condition given by Brockwell et al. (1992) for a special case, and verifies their conjecture that the moving average component does not affect the stationarity of the model. Under an additional irreducibility assumption, the geometric ergodicity of the GARCH and TARMA models is also established.

Using the Girsanov transformation we derive estimates for the accuracy of piecewise approximations for one-sided and two-sided boundary crossing probabilities. We demonstrate that piecewise linear approximations can be calculated using repeated numerical integration. As an illustrative example we consider the case of one-sided and two-sided square-root boundaries for which we also present analytical representations in a form of infinite power series.

In this paper we derive asymptotically exact expressions for buffer overflow probabilities and cell loss probabilities for a finite buffer which is fed by a large number of independent and stationary sources. The technique is based on scaling, measure change and local limit theorems and extends the recent results of Courcoubetis and Weber on buffer overflow asymptotics. We discuss the cases when the buffers are of the same order as the transmission bandwidth as well as the case of small buffers. Moreover we show that the results hold for a wide variety of traffic sources including ON/OFF sources with heavy-tailed distributed ON periods, which are typical candidates for so-called ‘self-similar’ inputs, showing that the asymptotic cell loss probability behaves in much the same manner for such sources as for the Markovian type of sources, which has important implications for statistical multiplexing. Numerical validation of the results against simulations are also reported.

We analyse a class of diffusion models that (i) allows an explicit expression for the likelihood function of discrete time observation, (ii) allows the possibility of heavy-tailed observations, and (iii) allows an analysis of the tails of the increments. The class simply consists of transformed Ornstein–Uhlenbeck processes and is of relevance for heavy-tailed time series. We also treat the question of the existence of an equivalent martingale measure for the class of models considered.

In a similar spirit to the probabilistic generalization of Taylor's theorem by Massey and Whitt [13], we give a probabilistic analogue of the mean value theorem. The latter is shown to be useful in various contexts of reliability theory. In particular, we provide various applications to the evaluation of the mean total profits of devices having random lifetimes, to the mean total-time-on-test at an arbitrary order statistic of a random sample of lifetimes, and to the mean maintenance cost for the second room of queueing systems in steady state characterized by two serial waiting rooms.

This paper examines the connection between loss networks without controls and Markov random field theory. The approach taken yields insight into the structure and computation of network equilibrium distributions, and into the nature of spatial dependence in networks. In addition, it provides further insight into some commonly used approximations, enables the development of more refined approximations, and permits the derivation of some asymptotically exact results.

Let {Xn, n ≥ 0} be a stationary Gaussian sequence of standard normal random variables with covariance function r(n) = EX0Xn. Let Under some mild regularity conditions on r(n) and the condition that r(n)lnn = o(1) or (r(n)lnn)−1 = O(1), the asymptotic distribution of is obtained. Continuous-time results are also presented as well as a tube formula tail area approximation to the joint distribution of the sum and maximum.

In applied probability, the distribution of a sum of n independent Bernoulli random variables with success probabilities p1,p2,…, pn is often approximated by a Poisson distribution with parameter λ = p1 + p2 + pn. Popular bounds for the approximation error are excellent for small values, but less efficient for moderate values of p1,p2,…,pn.

Upper bounds for the total variation distance are established, improving conventional estimates if the success probabilities are of medium size. The results may be applied directly, e.g. to approximation problems in risk theory.

In this paper, central limit theorems for multivariate semi-Markov sequences and processes are obtained, both as the number of jumps of the associated Markov chain tends to infinity and, if appropriate, as the time for which the process has been running tends to infinity. The theorems are widely applicable since many functions defined on Markov or semi-Markov processes can be analysed by exploiting appropriate embedded multivariate semi-Markov sequences. An application to a problem in ion channel modelling is described in detail. Other applications, including to multivariate stationary reward processes, counting processes associated with Markov renewal processes, the interpretation of Markov chain Monte Carlo runs and statistical inference on semi-Markov models are briefly outlined.

In this paper we describe a model for survival functions. Under this model a system is subject to shocks governed by a Poisson process. Each shock to the system causes a random damage that grows in time. Damages accumulate additively and the system fails if the total damage exceeds a certain capacity or threshold. Various properties of this model are obtained. Sufficient conditions are derived for the failure rate (FR) order and the stochastic order to hold between the random lifetimes of two systems whose failures can be described by our proposed model.

In this paper we study the asymptotic behavior of the tail of the stationary backlog distribution in a single server queue with constant service capacity c, fed by the so-called M/G/∞ input process or Cox input process. Asymptotic lower bounds are obtained for any distribution G and asymptotic upper bounds are derived when G is a subexponential distribution. We find the bounds to be tight in some instances, e.g. when G corresponds to either the Pareto or lognormal distribution and c − ρ < 1, where ρ is the arrival rate at the buffer.

In this paper, we consider a certain class of Markov renewal processes where the matrix of the transition kernel governing the Markov renewal process possesses some block-structured property, including repeating rows. Duality conditions and properties are obtained on two probabilistic measures which often play a key role in the analysis and computations of such a block-structured process. The method used here unifies two different concepts of duality. Applications of duality are also provided, including a characteristic theorem concerning recurrence and transience of a transition matrix with repeating rows and a batch arrival queueing model.

We exhibit solutions of Monge–Kantorovich mass transportation problems with constraints on the support of the feasible transportation plans and additional capacity restrictions. The Hoeffding–Fréchet inequalities are extended for bivariate distribution functions having fixed marginal distributions and satisfying additional constraints. Sharp bounds for different probabilistic functionals (e.g. Lp-distances, covariances, etc.) are given when the family of joint distribution functions has prescribed marginal distributions, satisfies restrictions on the support, and is bounded from above, or below, by other distributions.

We will state a general version of Simpson's paradox, which corresponds to the loss of some dependence properties under marginalization. We will then provide conditions under which the paradox is avoided. Finally we will relate these Simpson-type paradoxes to some well-known paradoxes concerning the loss of ageing properties when the level of information changes.

We consider the tail probabilities of a class of compound distributions. First, the relations between reliability distribution classes and heavy-tailed distributions are discussed. These relations reveal that many previous results on estimating the tail probabilities are not applicable to heavy-tailed distributions.

Then, a generalized Wald's identity and identities for compound geometric distributions are presented in terms of renewal processes. Using these identities, lower and upper bounds for the tail probabilities are derived in a unified way for the class of compound distributions, both under the conditions of NBU and NWU tails, which include exponential tails, as well as under the condition of heavy-tailed distributions.

Finally, simplified bounds are derived by the technique of stochastic ordering. This method removes some unnecessary technical assumptions and corrects errors in the proof of some previous results.

Let {Yn | n=1,2,…} be a stochastic process and M a positive real number. Define the time of ruin by T = inf{n | Yn > M} (T = +∞ if Yn ≤ M for n=1,2,…). We are interested in the ruin probabilities for large M. Define the family of measures {PM | M > 0} by PM(B) = P(T/M ∊ B) for B ∊ ℬ (ℬ = Borel sets of ℝ). We prove that for a wide class of processes {Yn}, the family {PM} satisfies a large deviations principle. The rate function will correspond to the approximation P(T/M ≈ x) ≈ P(Y⌈xM⌉/M ≈ 1) for x > 0. We apply the result to a simulation problem.