In this paper, we consider the compound Poisson process that is perturbed by diffusion (CPD). We derive formulae for the Laplace transform, expectation and variance of total duration of negative surplus for the CPD and also present some examples of the CPD with an exponential individual claim amount distribution and a mixture exponential individual claim amount distribution.

Suppose that there is a sequence of programs or jobs that are scheduled to be executed one after another on a computer. A program may terminate its execution because of the failure of the computer, which will obliterate all work the computer has accomplished, and the program has to be run all over again. Hence, it is common to save the work just completed after the computer has been working for a certain amount of time, say y units. It is assumed that it takes a certain time to perform a save. During the saving process, the computer is still subject to random failure. No matter when the computer failure occurs, it is assumed that the computer will be repaired completely and the repair time will be negligible. If saving is successful, then the computer will continue working from the end of the last saved work; if the computer fails during the saving process, then only unsaved work needs to be repeated. This paper discusses the optimal work size y under which the long-run average amount of work saved is maximized. In particular, the case of an exponential failure time distribution is studied in detail. The properties of the optimal age-replacement policy are also derived when the work size y is fixed.

Probability generation functions of waiting time distributions of runs and patterns have been used successfully in various areas of statistics and applied probability. In this paper, we provide a simple way to obtain the probability generating functions for waiting time distributions of compound patterns by using the finite Markov chain imbedding method. We also study the characters of waiting time distributions for compound patterns. A computer algorithm based on Markov chain imbedding technique has been developed for automatically computing the distribution, probability generating function, and mean of waiting time for a compound pattern.

The traditional Dirichlet process is characterized by its distribution on a measurable partition of the state space - namely, the Dirichlet distribution. In this paper, we consider a generalization of the Dirichlet process and the family of multivariate distributions it induces, with particular attention to a special case where the multivariate density function is tractable.

In this paper, we study ruin probabilities in two generalized risk models. The effects of timing of payments and interest on the ruin probabilities in the models are considered. The rates of interest are assumed to have a dependent autoregressive structure. Generalized Lundberg inequalities for the ruin probabilities are derived by a renewal recursive technique. An illustrative application is given to the compound binomial risk process.

In this paper we introduce the notion of structured phase-type representations. A structured representation corresponds to a class of phase-type representations having the same graph but free parameters. We define a generic property for such a representation. Then we prove that, generically, an irreducible structured representation of a given order corresponds to a distribution whose degree is equal to this order.

Ease of computation of Fréchet-optimal lower bounds, given numerical values of the binomial moments Sij, i, j = 1, 2, is demonstrated. A sufficient condition is given for an explicit bivariate bound of Dawson-Sankoff structure to be Fréchet optimal. An example demonstrates that in the bivariate case even the multiplicative structure of the Sij does not guarantee a Dawson-Sankoff structure for Fréchet-optimal bounds. A final section is used to illuminate the nature of Fréchet optimality by using generalized explicit bounds. This note is a sequel to both Chen and Seneta (1995) and Chen (1998).

Recently Bassan and Spizzichino (1999) have given some new concepts of multivariate ageing for exchangeable random variables, such as a special type of bivariate IFR, by comparing distributions of residual lifetimes of dependent components of different ages. In the same vein, we further study some properties of these concepts of IFR in the bivariate case. Then we introduce certain concepts of bivariate DMRL ageing and we develop a treatment that parallels those developed for bivariate IFR. For both the IFR and DMRL concepts, we analyse a weak and a strong version, and discuss some of the differences between them.

We consider the estimation of Markov transition matrices by Bayes’ methods. We obtain large and moderate deviation principles for the sequence of Bayesian posterior distributions.

This paper concentrates on investigating ergodicity and stability for generalised Markov branching processes with resurrection. Easy checking criteria including several clear-cut corollaries are established for ordinary and strong ergodicity of such processes. The equilibrium distribution is given in an elegant closed form for the ergodic case. The probabilistic interpretation of the results is clear and thus explained.

We deal with compound geometric sums of independent positive random variables and study the moment problem for the distributions of such sums (the Stieltjes moment problem). We find conditions under which the distributions are uniquely determined by their moments. We also treat related topics, including the Hamburger moment problem involving random variables on the whole real line. Some conjectures are outlined.

An explicit convolution representation for the equilibrium residual lifetime distribution of compound zero-modified geometric distributions is derived. Second-order reliability properties are seen to be essentially preserved under geometric compounding, and complement results of Brown (1990) and Cai and Kalashnikov (2000). The convolution representation is then extended to the nth-order equilibrium distribution. This higher-order convolution representation is used to evaluate the stop-loss premium and higher stop-loss moments of the compound zero-modified geometric distribution, as well as the Laplace transform of the kth moment of the time of ruin in the classical risk model.

We consider an infinite capacity buffer where the incoming fluid traffic belongs to K different types modulated by K independent Markovian on-off processes. The kth input process is described by three parameters: (λk, μk, rk), where 1/λk is the mean off time, 1/μk is the mean on time, and rk is the constant peak rate during the on time. The buffer empties the fluid at rate c according to a first come first served (FCFS) discipline. The output process of type k fluid is neither Markovian, nor on-off. We approximate it by an on-off process by defining the process to be off if no fluid of type k is leaving the buffer, and on otherwise. We compute the mean on time τkon and mean off time τkoff. We approximate the peak output rate by a constant rko so as to conserve the fluid. We approximate the output process by the three parameters (λko, μko, rko), where λko = 1/τkoff, and μko = 1/τkon. In this paper we derive methods of computing τkon, τkoff and rko for k = 1, 2,…, K. They are based on the results for the computation of expected reward in a fluid queueing system during a first passage time. We illustrate the methodology by a numerical example. In the last section we conduct a similar output analysis for a standard M/G/1 queue with K types of customers arriving according to independent Poisson processes and requiring independent generally distributed service times, and following a FCFS service discipline. For this case we are able to get analytical results.

If Z is the branching mechanism for a supercritical Galton-Watson tree with a single progenitor and E[ZlogZ] < ∞, then there is a branching measure μ defined on ∂Γ, the set of all paths ξ which have a unique node ξ|n at each generation n. We use the natural metric ρ(ξ,η) = e−n, where n = max{k : ξ|k = η|k}, and observe that the local dimension index is d(μ,ξ) = limn→∞ log(μB(ξ|n))/(-n) = α = logm, for μ-almost every ξ. Our objective is to consider the exceptional points where the above display may fail. There is a nontrivial ‘thin’ spectrum for ̄d(μ,ξ) when p1 = P{Z = 1} > 0 and Z has finite moments of all positive orders. Because ̱d(μ,ξ) = a for all ξ, we obtain a ‘thick’ spectrum by introducing the ‘right’ power of a logarithm. In both cases, we find the Hausdorff dimension of the exceptional sets.

Testing in order to produce software of high reliability is an area of major concern in software engineering. In an effort to find efficient methods of testing, the comparison of partition and random sampling testing methods has received considerable attention in the literature. A standard criterion for comparisons between random and partition testing, based on their expected efficacy in program debugging, is the probability of detecting at least one failure causing input in the program's domain. However, the goal in software testing is usually to find as many faults as possible in a reasonable period of time, and therefore stochastic comparisons of the number of faults obtained in partition and random testing may provide more valuable information on which testing procedures to use. We establish various conditions which guarantee that the number of faults discovered in partition testing is stochastically greater than the number discovered in random testing (using a fixed total sample size) for many of the well-established stochastic orders (including the usual stochastic order, the hazard rate order, the likelihood ratio order, and the variability order). The results established also allow us to obtain both upper and lower bounds with these stochastic orders for the sum of n independent Bernoulli random trials (with varying probability of success) in terms of the binomial distribution with parameters n and p.

In this paper, the class of controlled branching processes with random control functions introduced by Yanev (1976) is considered. For this class, necessary and sufficient conditions are established for the process to become extinct with probability 1 and the limit probabilistic behaviour of the population size, suitably normed, is investigated.

We consider an infinite-capacity buffer receiving fluid at a rate depending on the state of an M/M/1 queue. We obtain a new analytic expression for the joint stationary distribution of the buffer level and the state of the M/M/1 queue. This expression is obtained by the use of generating functions which are explicitly inverted. The case of a finite capacity fluid queue is also considered.

The paper is concerned with filtering the cardinality of a branching process observing the cardinality of a subpopulation. In this model, both the processes, state and observation are pure jump processes and may have common jump times. Preliminary properties are studied in the tree framework. A recursive structure for the filtering equation is proved in the supercritical case.

Motivated by the question of the age in a branching population we try to recreate the past by looking back from the currently observed population size. We define a new backward Galton-Watson process and study the case of the geometric offspring distribution with parameter p in detail. The backward process is then the Galton-Watson process with immigration, again with a geometric offspring distribution but with parameter 1-p, and it is also the dual to the original Galton-Watson process. We give the asymptotic distribution of the age when the initial population size is large in supercritical and critical cases. To this end, we give new asymptotic results on the Galton-Watson immigration processes stopped at zero.

In this paper, we consider a Hilbert-space-valued autoregressive stochastic sequence (Xn) with several regimes. We suppose that the underlying process (In) which drives the evolution of (Xn) is stationary. Under some dependence assumptions on (In), we prove the existence of a unique stationary solution, and with a symmetric compact autocorrelation operator, we can state a law of large numbers with rates and the consistency of the covariance estimator. An overall hypothesis states that the regimes where the autocorrelation operator's norm is greater than 1 should be rarely visited.