This work is concerned with the existence of an optimal control strategy for the long-run average continuous control problem of piecewise-deterministic Markov processes (PDMPs). In Costa and Dufour (2008), sufficient conditions were derived to ensure the existence of an optimal control by using the vanishing discount approach. These conditions were mainly expressed in terms of the relative difference of the α-discount value functions. The main goal of this paper is to derive tractable conditions directly related to the primitive data of the PDMP to ensure the existence of an optimal control. The present work can be seen as a continuation of the results derived in Costa and Dufour (2008). Our main assumptions are written in terms of some integro-differential inequalities related to the so-called expected growth condition, and geometric convergence of the post-jump location kernel associated to the PDMP. An example based on the capacity expansion problem is presented, illustrating the possible applications of the results developed in the paper.

Let X1, X2,… and Y1, Y2,… be two sequences of absolutely continuous, independent and identically distributed (i.i.d.) random variables with equal means E(Xi)=E(Yi), i=1,2,… In this work we provide upper bounds for the total variation and Kolmogorov distances between the distributions of the partial sums ∑i=1nXi and ∑i=1nYi. In the case where the distributions of the Xis and the Yis are compared with respect to the convex order, the proposed upper bounds are further refined. Finally, in order to illustrate the applicability of the results presented, we consider specific examples concerning gamma and normal approximations.

We consider coherent and mixed reliability systems composed of elements with independent and identically distributed lifetimes. We present upper bounds on variances of system lifetimes, expressed in terms of variances of single components. We also discuss attainability conditions and some special cases and examples.

In the context of a dividend barrier strategy (see, e.g. Lin, Willmot and Drekic (2003)) we analyze the moments of the discounted dividend payments and the expected discounted penalty function for surplus processes with claims arriving according to a Markovian arrival process (MAP). We show that a relationship similar to the dividend-penalty identity of Gerber, Lin and Yang (2006) can be established for the class of perturbed MAP surplus processes, extending in the process some results of Li and Lu (2008) for the Markov-modulated risk model. Also, we revisit the same ruin-related quantities in an identical MAP risk model with the only exception that the barrier level effective at time t depends on the state of the underlying environment at this time. Similar relationships are investigated and derived. Numerical examples are also considered.

We study the convolution of compound negative binomial distributions with arbitrary parameters. The exact expression and also a random parameter representation are obtained. These results generalize some recent results in the literature. An application of these results to insurance mathematics is discussed. The sums of certain dependent compound Poisson variables are also studied. Using the connection between negative binomial and gamma distributions, we obtain a simple random parameter representation for the convolution of independent and weighted gamma variables with arbitrary parameters. Applications to the reliability of m-out-of-n:G systems and to the shortest path problem in graph theory are also discussed.

Chiu and Yin (2005) found the Laplace transform of the last time a spectrally negative Lévy process, which drifts to ∞, is below some level. The main motivation for the study of this random time stems from risk theory: what is the last time the risk process, modeled by a spectrally negative Lévy process drifting to ∞, is 0? In this paper we extend the result of Chiu and Yin, and we derive the Laplace transform of the last time, before an independent, exponentially distributed time, that a spectrally negative Lévy process (without any further conditions) exceeds (upwards or downwards) or hits a certain level. As an application, we extend a result found in Doney (1991).

We study the class of logarithmic skew-normal (LSN) distributions. They have heavy tails; however, all their moments of positive integer orders are finite. We are interested in the problem of moments for such distributions. We show that the LSN distributions are all nonunique (moment-indeterminate). Moreover, we explicitly describe Stieltjes classes for some LSN distributions; they are families of infinitely many distributions, which are different but have the same moment sequence as a fixed LSN distribution.

We consider the two-dimensional version of a drainage network model introduced in Gangopadhyay, Roy and Sarkar (2004), and show that the appropriately rescaled family of its paths converges in distribution to the Brownian web. We do so by verifying the convergence criteria proposed in Fontes, Isopi, Newman and Ravishankar (2002).

In this paper we study the tail behavior of the maximum exceedance of a sequence of independent and identically distributed random variables over a random walk. For both light-tailed and heavy-tailed cases, we derive a precise asymptotic formula, which extends and unifies some existing results in the recent literature of applied probability.

Gaweł and Kimmel (1996) introduced and studied iterated Galton–Watson processes, (Xn)n≥0, possibly with thinning, as models of the number of repeats of DNA triplets during some genetic disorders. Our main results are the following. If the process indeed involves some thinning then extinction, {Xn→0}, and explosion, {Xn→∞}, can have positive probability simultaneously. If the underlying (simple) Galton–Watson process is nondecreasing with mean m then, conditionally on explosion, the ratios (log Xn+1)/Xn converge to logm almost surely. This simplifies the arguments of Gaweł and Kimmel, and confirms and extends a conjecture of Pakes (2003).

Mallows and Shepp (2008) developed the following necklace processes. Start with a necklace consisting of one white bead and one black bead, and insert, one at a time, under a deterministic rule, a white bead or a black bead between a randomly chosen adjacent pair. They studied the statistical properties of the number of white beads by investigating the nature of the moments and the expected number of gaps of given length between white beads. In this note we study the number of white beads via Pólya urns and give a classification of necklace processes for some general rules. Additionally, we discuss the number of runs, i.e. the number of consecutive same color beads, instead of the number of gaps.

We will propose an alternative condition for stochastic domination. This condition differs in an essential way from the strong likelihood ratio property. We also show an example which satisfies the new condition, but does not satisfy the strong likelihood ratio property.

In this paper, a distributional approximation to the time to extinction in a subcritical continuous-time Markov branching process is derived. A limit theorem for this distribution is established and the error in the approximation is quantified. The accuracy of the approximation is illustrated in an epidemiological example. Since Markov branching processes serve as approximations to nonlinear epidemic processes in the initial and final stages, our results can also be used to describe the time to extinction for such processes.

In an infinite sequence of independent Bernoulli trials with success probabilities pk=a/(a+b +k-1) for k=1,2,3,…, let Nr be the number of r≥2 consecutive successes. Expressions for the first two moments of Nr are derived. Asymptotics of the probability of no occurrence of r consecutive successes for large r are obtained. Using an embedding in a marked Poisson process, it is indicated how the distribution of Nr can be calculated for small r.

Consider an urn model whose replacement matrix is triangular, has all nonnegative entries, and the row sums are all equal to 1. We obtain strong laws for the counts of balls corresponding to each color. The scalings for these laws depend on the diagonal elements of a rearranged replacement matrix. We use these strong laws to study further behavior of certain three-color urn models.

We consider the following two definitions of discounting: (i) multiplicative coefficient in front of the rewards, and (ii) probability that the process has not been stopped if the stopping time has an exponential distribution independent of the process. It is well known that the expected total discounted rewards corresponding to these definitions are the same. In this note we show that, the variance of the total discounted rewards is smaller for the first definition than for the second definition.

In this paper we refine a Poisson limit theorem of Gnedenko and Kolmogorov (1954): we determine the error order of a Poisson approximation for sums of asymptotically negligible integer-valued random variables that converge in distribution to the Poisson law. As an application of our results, we investigate the case of the coupon collector's problem when the distribution of the collector's waiting time is asymptotically Poisson.