In this paper, we propose a new comparison tool for spatial homogeneity of point processes, based on the joint examination of void probabilities and factorial moment measures. We prove that determinantal and permanental processes, as well as, more generally, negatively and positively associated point processes are comparable in this sense to the Poisson point process of the same mean measure. We provide some motivating results on percolation and coverage processes, and preview further ones on other stochastic geometric models, such as minimal spanning forests, Lilypond growth models, and random simplicial complexes, showing that the new tool is relevant for a systemic approach to the study of macroscopic properties of non-Poisson point processes. This new comparison is also implied by the directionally convex ordering of point processes, which has already been shown to be relevant to the comparison of the spatial homogeneity of point processes. For this latter ordering, using a notion of lattice perturbation, we provide a large monotone spectrum of comparable point processes, ranging from periodic grids to Cox processes, and encompassing Poisson point processes as well. They are intended to serve as a platform for further theoretical and numerical studies of clustering, as well as simple models of random point patterns to be used in applications where neither complete regularity nor the total independence property are realistic assumptions.

In this paper we discuss a nondecreasing lower bound for the Poisson cumulative distribution function (CDF) at z standard deviations above the mean λ, where z and λ are parameters. This is important because the normal distribution as an approximation for the Poisson CDF may overestimate or underestimate its value. A sharp nondecreasing lower bound in the form of a step function is constructed. As a corollary of the bound's properties, for a given percent α and parameter λ, the minimal z is obtained such that, for any Poisson random variable with the mean greater or equal to λ, its αth percentile is at most z standard deviations above its mean. For Poisson distributed control parameters, the corollary allows simple policies measuring performance in terms of standard deviations from a benchmark.

The signature of a system is defined as the vector whose ith element is the probability that the system fails concurrently with the ith component failure. The signature vector is known to be a distribution-free measure and a representation of the system's survival function has been developed in terms of the system's signature. The present work is devoted to the study of the joint distribution of lifetimes of pairs of systems with shared components. Here, a new distribution-free measure, the ‘joint bivariate signature’, of a pair of systems with shared components is defined, and a new representation theorem for the joint survival function of the system lifetimes is established. The theorem is shown to facilitate the study of the dependence between systems and the comparative performance of two pairs of such systems.

The distributions of discrete, continuous and conditional multiple window scan statistics are studied. The finite Markov chain imbedding technique has been applied to obtain the distributions of fixed window scan statistics defined from a sequence of Bernoulli trials. In this manuscript the technique is extended to compute the distributions of multiple window scan statistics and the exact powers for multiple pulse and Markov dependent alternatives. An application in blood component quality monitoring is provided. Numerical results are also given to illustrate our theoretical results.

This paper is concerned with the class of distributions, continuous or discrete, whose shape is monotone of finite integer order t. A characterization is presented as a mixture of a minimum of tindependent uniform distributions. Then, a comparison of t-monotone distributions is made using the s-convex stochastic orders. A link is also pointed out with an alternative approach to monotonicity based on a stationary-excess operator. Finally, the monotonicity property is exploited to reinforce the classical Markov and Lyapunov inequalities. The results are illustrated by several applications to insurance.

We consider the problem of efficient simulation estimation of the density function at the tails, and the probability of large deviations for a sum of independent, identically distributed (i.i.d.), light-tailed, and nonlattice random vectors. The latter problem besides being of independent interest, also forms a building block for more complex rare event problems that arise, for instance, in queueing and financial credit risk modeling. It has been extensively studied in the literature where state-independent, exponential-twisting-based importance sampling has been shown to be asymptotically efficient and a more nuanced state-dependent exponential twisting has been shown to have a stronger bounded relative error property. We exploit the saddle-point-based representations that exist for these rare quantities, which rely on inverting the characteristic functions of the underlying random vectors. These representations reduce the rare event estimation problem to evaluating certain integrals, which may via importance sampling be represented as expectations. Furthermore, it is easy to identify and approximate the zero-variance importance sampling distribution to estimate these integrals. We identify such importance sampling measures and show that they possess the asymptotically vanishing relative error property that is stronger than the bounded relative error property. To illustrate the broader applicability of the proposed methodology, we extend it to develop an asymptotically vanishing relative error estimator for the practically important expected overshoot of sums of i.i.d. random variables.

Under the assumption of independent and identically distributed (i.i.d.) components, the problem of the stochastic comparison of a coherent system having used components and a used coherent system has been considered. Necessary and sufficient conditions on structure functions have been provided for the stochastic comparison of a coherent system having used/inactive i.i.d. components and a used/inactive coherent system. As a consequence, for r-out-of-n systems, it has been shown that systems having used i.i.d. components stochastically dominate used systems in the likelihood ratio ordering.

Consider random vectors formed by a finite number of independent groups of independent and identically distributed random variables, where those of the last group are stochastically smaller than those of the other groups. Conditions are given such that certain functions, defined as suitable means of supermodular functions of the random variables of the vectors, are supermodular or increasing directionally convex. Comparisons based on the increasing convex order of supermodular functions of such random vectors are also investigated. Applications of the above results are then provided in risk theory, queueing theory, and reliability theory, with reference to (i) net stop-loss reinsurance premiums of portfolios from different groups of insureds, (ii) closed cyclic multiclass Gordon-Newell queueing networks, and (iii) reliability of series systems formed by units selected from different batches.

Sharp tail bounds for the sum of d random variables with given marginal distributions and arbitrary dependence structure have been known since Makarov (1981) and Rüschendorf (1982) for d=2 and, in some examples, for d≥3. Based on a duality result, dual bounds have been introduced in Embrechts and Puccetti (2006b). In the homogeneous case, F 1=···=F n , with monotone density, sharp tail bounds were recently found in Wang and Wang (2011). In this paper we establish the sharpness of the dual bounds in the homogeneous case under general conditions which include, in particular, the case of monotone densities and concave densities. We derive the corresponding optimal couplings and also give an effective method to calculate the sharp bounds.

In this note we compute the Laplace transform of hitting times, to fixed levels, of integrated geometric Brownian motion. The transform is expressed in terms of the gamma and confluent hypergeometric functions. Using a simple Itô transformation and standard results on hitting times of diffusion processes, the transform is characterized as the solution to a linear second-order ordinary differential equation which, modulo a change of variables, is equivalent to Kummer's equation.

We extend the class of tempered stable distributions, which were first introduced in Rosiński (2007). Our new class allows for more structure and more variety of the tail behaviors. We discuss various subclasses and the relations between them. To characterize the possible tails, we give detailed results about finiteness of various moments. We also give necessary and sufficient conditions for the tails to be regularly varying. This last part allows us to characterize the domain of attraction to which a particular tempered stable distribution belongs.

Tankov (2011) improved the Fréchet bounds for a bivariate copula when its values on a compact subset of [0, 1]2 are given. He showed that the best possible bounds are quasi-copulas and gave a sufficient condition for these bounds to be copulas. In this note we give weaker sufficient conditions to ensure that the bounds are copulas. We also show how this can be useful in portfolio selection. It turns out that finding a copula as a lower bound plays a key role in determining optimal investment strategies explicitly for investors with some type of state-dependent constraints.

Nonnegative infinitely divisible (i.d.) random variables form an important class of random variables. However, when this type of random variable is specified via Lévy densities that have infinite integrals on (0, ∞), except for some special cases, exact sampling is unknown. We present a method that can sample a rather wide range of such i.d. random variables. A basic result is that, for any nonnegative i.d. random variable X with its Lévy density explicitly specified, if its distribution conditional on X ≤ r can be sampled exactly, where r > 0 is any fixed number, then X can be sampled exactly using rejection sampling, without knowing the explicit expression of the density of X. We show that variations of the result can be used to sample various nonnegative i.d. random variables.

In this paper we consider three-dimensional random tessellations that are stable under iteration (STIT tessellations). STIT tessellations arise as a result of subsequent cell division, which implies that their cells are not face-to-face. The edges of the cell-dividing polygons are the so-called I-segments of the tessellation. The main result is an explicit formula for the distribution of the number of vertices in the relative interior of the typical I-segment. In preparation for its proof, we obtain other distributional identities for the typical I-segment and the length-weighted typical I-segment, which provide new insight into the spatiotemporal construction process.

Given a probability density, we estimate the rate of decay of the measure of the level sets of its evolutes by the Ornstein–Uhlenbeck semigroup. The rate is faster than what follows from the preservation of mass and Markov’s inequality.

Almost all populations existing in the real world are finite populations. Specifically, in the areas relevant to lifetime modeling and analysis, finite populations are frequently encountered. However, descriptions of failure/survival patterns of elements in the finite population have not yet been properly established. In particular, it is questionable whether the ordinary failure rate can be defined for finite populations in the same way and whether the corresponding interpretations are still valid. In this paper we consider two kinds of finite mixed population and provide new definitions for their failure rates. Then we clarify the notion of failure rate in finite populations.

We consider a multivariate distributional recursion of sum type, as arises in the probabilistic analysis of algorithms and random trees. We prove an upper tail bound for the solution using Chernoff's bounding technique by estimating the Laplace transform. The problem is traced back to the corresponding problem for binary search trees by stochastic domination. The result obtained is applied to the internal path length and Wiener index of random b-ary recursive trees with weighted edges and random linear recursive trees. Finally, lower tail bounds for the Wiener index of these trees are given.

We study a family of distributions that satisfy the stability-under-addition property, provided that the number ν of random variables in a sum is also a random variable. We call the corresponding property ν-stability and investigate the situation when the semigroup generated by the generating function of ν is commutative. Using results from the theory of iterations of analytic functions, we describe ν-stable distributions generated by summations with rational generating functions. A new case in this class of distributions arises when generating functions are linked with Chebyshev polynomials. The analogue of normal distribution corresponds to the hyperbolic secant distribution.

In the study of the reliability of technical systems in reliability engineering, coherent systems play a key role. In this paper we consider a coherent system consisting of n components with independent and identically distributed components and propose two time-dependent criteria. The first criterion is a measure of the residual lifetime of live components of a coherent system having some of the components alive when the system fails at time t. The second criterion is a time-dependent measure which enables us to investigate the inactivity times of the failed components of a coherent system still functioning though some of its components have failed. Several ageing and stochastic properties of the proposed measures are then established.

The concept of complete mixability is relevant to some problems of optimal couplings with important applications in quantitative risk management. In this paper we prove new properties of the set of completely mixable distributions, including a completeness and a decomposition theorem. We also show that distributions with a concave density and radially symmetric distributions are completely mixable.