This paper studies limiting properties of discretely sampled Poisson shot noise processes. Versions of the law of large numbers and central limit theorem are derived under very general conditions. Examples demonstrating the utility of the results are included.

An explicit formula for the probability of nonruin of an insurance company in a finite time interval is derived, assuming Poisson claim arrivals, any continuous joint distribution of the claim amounts and any nonnegative, increasing real function representing its premium income. The formula is compact and expresses the nonruin probability in terms of Appell polynomials. An example, illustrating its numerical convenience, is also given in the case of inverted Dirichlet-distributed claims and a linearly increasing premium-income function.

Using a known fact that a Galton–Watson branching process can be represented as an embedded random walk, together with a result of Heyde (1964), we first derive finite exponential moment results for the total number of descendants of an individual. We use this basic and simple result to prove analogous results for the population size at time t and the total number of descendants by time t in an age-dependent branching process. This has applications in justifying the interchange of expectation and derivative operators in simulation-based derivative estimation for generalized semi-Markov processes. Next, using the result of Heyde (1964), we show that, in a stable GI/GI/1 queue, the length of a busy period and the number of customers served in a busy period have finite exponential moments if and only if the service time does.

The main result of the paper is a refinement of Xia's (1997) bound on the Kantorovich distance between distributions of a Bernoulli point process and an approximating Poisson process. In particular, we show that the distance between distributions of a Bernoulli point process and the Poisson process with the same mean measure has the order of the total variation distance between the laws of the total masses of these processes.

In this paper we consider a system with two carousels operated by one picker. The items to be picked are randomly located on the carousels and the pick times follow a phase-type distribution. The picker alternates between the two carousels, picking one item at a time. Important performance characteristics are the waiting time of the picker and the throughput of the two carousels. The waiting time of the picker satisfies an equation very similar to Lindley's equation for the waiting time in the PH/U/1 queue. Although the latter equation has no simple solution, we show that the one for the waiting time of the picker can be solved explicitly. Furthermore, it is well known that the mean waiting time in the PH/U/1 queue depends on the complete interarrival time distribution, but numerical results show that, for the carousel system, the mean waiting time and throughput are rather insensitive to the pick-time distribution.

Let F be a probability distribution function with density f. We assume that (a) F has finite moments of any integer positive order and (b) the classical problem of moments for F has a nonunique solution (F is M-indeterminate). Our goal is to describe a , where h is a ‘small' perturbation function. Such a class S consists of different distributions Fε (fε is the density of Fε) all sharing the same moments as those of F, thus illustrating the nonuniqueness of F, and of any Fε, in terms of the moments. Power transformations of distributions such as the normal, log-normal and exponential are considered and for them Stieltjes classes written explicitly. We define a characteristic of S called an index of dissimilarity and calculate its value in some cases. A new Stieltjes class involving a power of the normal distribution is presented. An open question about the inverse Gaussian distribution is formulated. Related topics are briefly discussed.

We show that the advantage that can accrue to the server in tennis does not necessarily imply that serving first changes the probability of winning the match. We demonstrate that the outcome of tie-breaks, sets and matches can be independent of who serves first. These are corollaries of a more general invariance result that we prove for n-point win-by-2 games. Our proofs are non-algebraic and self-contained.

We examine the joint finite structure of extremes of the ARCH process and find an unexpected phenomenon: when assessing probabilities of failure during some finite time interval in the future, the extremal index seems not to be the object to look at. Two possible ramifications of this phenomenon are put forward.

Mi (2002) recently considered a two-dimensional optimization problem for the optimal age-replacement policy and the optimal work size. In order to find (y ∗,T ∗), Mi (2002) found the optimal age-replacement policy T ∗(y) for each fixed work size y, and then searched for the optimal work size y ∗. When applying this approach, for each fixed work size y, Mi (2002) obtained the bounds for T ∗(y). However, no bound for the optimal work size y ∗ was derived. In this note, the results on the upper bound for the optimal work size y ∗ are given.

We drive a car along a street towards our destination and look for an available parking place without turning around. Each parking place is associated with a loss which decreases with the distance of the parking place from our destination. Assume that the states (empty or filled) of the parking places form a Markov chain. We want to find an optimal parking strategy to minimize the expected loss. A curious example is constructed and two sufficient conditions for the existence of the threshold-type optimal parking strategy are given.

The entropy score of an observed outcome that has been given a probability forecast p is defined to be –log p. If p is derived from a probability model and there is a background model for which the same outcome has probability π, then the log ratio log(p/π) is the probability gain, and its expected value the information gain, for that outcome. Such concepts are closely related to the likelihood of the model and its entropy rate. The relationships between these concepts are explored in the case that the outcomes in question are the occurrence or nonoccurrence of events in a stochastic point process. It is shown that, in such a context, the mean information gain per unit time, based on forecasts made at arbitrary discrete time intervals, is bounded above by the entropy rate of the point process. Two examples illustrate how the information gain may be related to realizations with a range of values of ‘predictability'.

A gambler, with an initial fortune less than 1, wants to buy a house which sells today for 1. Due to inflation, the price of the house tomorrow will be 1 + α, where α is a nonnegative constant, and will continue to go up at this rate, becoming (1 + α) n on the nth day. Once each day, he can stake any amount of fortune in his possession, but no more than he possesses, on a primitive casino. It is well known that, in a subfair primitive casino without the presence of inflation, the gambler should play boldly. The presence of inflation would motivate the gambler to recognize the time value of his fortune and to try to reach his goal as quickly as possible; intuitively, we would conjecture that the gambler should again play boldly. However, in this note we will show that, unexpectedly, bold play is not necessarily optimal.

Classes of life distributions based on the moment-generating-function order are investigated in this paper. It is shown firstly that the class ℳ is closed under both convex linear combination and geometric compounding. Secondly, the class NBUmg (new better than used in the moment-generating-function order) is proved to be closed under increasing star-shaped transformations. Finally, the interplay between the stochastic comparison of the excess lifetime of a renewal process and the NBUmg interarrivals is studied.

The notion of minimal repair is generalized to the case when the lifetime distribution function is a continuous or a discrete mixture of distributions (heterogeneous population). The statistical (black box) minimal repair and the minimal repair based on information just before the failure of an object are considered. The corresponding stochastic intensities are defined and analyzed for the point processes generated by both types of minimal repair. Some generalizations are discussed. Several simple examples are considered.

Let {X n , n = 0, 1,…} be the sequence of the lower records for an arbitrary underlying distribution μ on [0, ∞). We show that is equal in distribution to where {τ i , i = 1, 2,…} is a Poisson flow of unit intensity and g is a right-continuous and nonincreasing function defined by μ. This observation allows us to extend results of Bose et al. and simplify their proofs.

For the M[X]/G/1 queueing model with a general exhaustive-service vacation policy, it has been proved that the Laplace-Stieltjes transform (LST) of the steady-state distribution function of the waiting time of a customer arriving while the server is active is the product of the corresponding LST in the bulk arrival model with unremovable server and another LST. The expression given for the latter, however, is valid only under the assumption that the number of groups arriving in an inactive phase is independent of the sizes of the groups. We here give an expression which holds in the general case. For the N-policy case, we also give an expression for the LST of the steady-state distribution function of the waiting time of a customer arriving while the server is inactive.

We consider a two-sided exit problem for a Lévy process with no positive jumps. The Laplace transform of the time when the process first exits an interval from above is obtained. It is expressed in terms of another Laplace transform for the one-sided exit problem. Applications of this result are discussed. In particular, a new expression for the solution to the two-sided exit problem is obtained. The joint distribution of the minimum and the maximum values of such a Lévy process is also studied.

It is shown that the method of deriving bounds on the rate of convergence for birth–death processes developed by Zeifman can be effectively applied to stochastic models of chemical reactions.

We review some urn and random-allocation models, mostly using probability generating function (PGF) methods. We begin by formulating a basic problem which can be thought of as either an urn or a random-allocation model; a PGF solution to it is outlined. When the compartments in the latter model are no longer homogeneous, the multivariate PGF can still be derived, though the algebra becomes cumbersome. Some results are given for the case where there are two types of compartment and for the case where there are two types of ball. Some comments are offered on the Frobenius–Harper property of PGFs.