In this paper we introduce conditionally independent increment point processes, that is, processes that are conditionally independent inside and outside a bounded set A given N(A), the number of points in A. We show that these point processes can be characterized by means of the avoidance function of a multinomial ‘support process’, the solution of a suitably defined linear system of equations, and, finally, the infinitesimal matrix of a continuous-time Markov chain.

An ergodic Markov chain is proved to be the realization of a random walk in a directed graph subject to a synchronizing road coloring. The result ensures the existence of appropriate random mappings in Propp-Wilson's coupling from the past. The proof is based on the road coloring theorem. A necessary and sufficient condition for approximate preservation of entropies is also given.

We consider a generalized form of the coupon collection problem in which a random number, S, of balls is drawn at each stage from an urn initially containing n white balls (coupons). Each white ball drawn is colored red and returned to the urn; red balls drawn are simply returned to the urn. The question considered is then: how many white balls (uncollected coupons) remain in the urn after the kn draws? Our analysis is asymptotic as n → ∞. We concentrate on the case when kn draws are made, where kn / n → ∞ (the superlinear case), although we sketch known results for other ranges of kn. A Gaussian limit is obtained via a martingale representation for the lower superlinear range, and a Poisson limit is derived for the upper boundary of this range via the Chen-Stein approximation.

We prove large deviation results for Minkowski sums Sn of independent and identically distributed random compact sets where we assume that the summands have a regularly varying distribution and finite expectation. The main focus is on random convex compact sets. The results confirm the heavy-tailed large deviation heuristics: ‘large’ values of the sum are essentially due to the ‘largest’ summand. These results extend those in Mikosch, Pawlas and Samorodnitsky (2011) for generally nonconvex sets, where we assumed that the normalization of Sn grows faster than n.

This paper presents an analysis of a generalized version of the coupon collector problem, in which the collector receives d coupons each run and chooses the least-collected coupon so far. In the asymptotic case when the number of coupons n goes to infinity, we show that, on average, (nlogn) / d + (n / d)(m − 1)log logn + O(mn) runs are needed to collect m sets of coupons. An exact algorithm is also developed for any finite case to compute the exact mean number of runs. Numerical examples are provided to verify our theoretical predictions.

This paper is motivated by relations between association and independence of random variables. It is well known that, for real random variables, independence implies association in the sense of Esary, Proschan and Walkup (1967), while, for random vectors, this simple relationship breaks. We modify the notion of association in such a way that any vector-valued process with independent increments also has associated increments in the new sense - association between blocks. The new notion is quite natural and admits nice characterization for some classes of processes. In particular, using the covariance interpolation formula due to Houdré, Pérez-Abreu and Surgailis (1998), we show that within the class of multidimensional Gaussian processes, block association of increments is equivalent to supermodularity (in time) of the covariance functions. We also define corresponding versions of weak association, positive association, and negative association. It turns out that the central limit theorem for weakly associated random vectors due to Burton, Dabrowski and Dehling (1986) remains valid, if the weak association is relaxed to the weak association between blocks.

We study a family of Markov processes on P (k), the space of partitions of the natural numbers with at most k blocks. The process can be constructed from a Poisson point process on R + x ∏ i=1 k P (k) with intensity dt ⊗ ϱν (k), where ϱν is the distribution of the paintbox based on the probability measure ν on P m, the set of ranked-mass partitions of 1, and ϱν (k) is the product measure on ∏ i=1 k P (k). We show that these processes possess a unique stationary measure, and we discuss a particular set of reversible processes for which transition probabilities can be written down explicitly.

We study asymptotically optimal simulation algorithms for approximating the tail probability of P(eX1+⋯+ eXd>u) as u→∞. The first algorithm proposed is based on conditional Monte Carlo and assumes that (X1,…,Xd) has an elliptical distribution with very mild assumptions on the radial component. This algorithm is applicable to a large class of models in finance, as we demonstrate with examples. In addition, we propose an importance sampling algorithm for an arbitrary dependence structure that is shown to be asymptotically optimal under mild assumptions on the marginal distributions and, basically, that we can simulate efficiently (X1,…,Xd|Xj >b) for large b. Extensions that allow us to handle portfolios of financial options are also discussed.

Following Baurdoux and Kyprianou (2008) we consider the McKean stochastic game, a game version of the McKean optimal stopping problem (American put), driven by a spectrally negative Lévy process. We improve their characterisation of a saddle point for this game when the driving process has a Gaussian component and negative jumps. In particular, we show that the exercise region of the minimiser consists of a singleton when the penalty parameter is larger than some threshold and ‘thickens’ to a full interval when the penalty parameter drops below this threshold. Expressions in terms of scale functions for the general case and in terms of polynomials for a specific jump diffusion case are provided.

Let x denote a vector of length q consisting of 0s and 1s. It can be interpreted as an ‘opinion’ comprised of a particular set of responses to a questionnaire consisting of q questions, each having {0, 1}-valued answers. Suppose that the questionnaire is answered by n individuals, thus providing n ‘opinions’. Probabilities of the answer 1 to each question can be, basically, arbitrary and different for different questions. Out of the 2 q different opinions, what number, μ n , would one expect to see in the sample? How many of these opinions, μ n (k), will occur exactly k times? In this paper we give an asymptotic expression for μ n / 2 q and the limit for the ratios μ n (k)/μ n , when the number of questions q increases along with the sample size n so that n = λ2 q , where λ is a constant. Let p( x ) denote the probability of opinion x . The key step in proving the asymptotic results as indicated is the asymptotic analysis of the joint behaviour of the intensities np( x ). For example, one of our results states that, under certain natural conditions, for any z > 0, ∑1 {np( x ) > z} = d n z −u , d n = o(2 q ).

We consider sequential selection of an alternating subsequence from a sequence of independent, identically distributed, continuous random variables, and we determine the exact asymptotic behavior of an optimal sequentially selected subsequence. Moreover, we find (in a sense we make precise) that a person who is constrained to make sequential selections does only about 12 percent worse than a person who can make selections with full knowledge of the random sequence.

We present a method for computing the probability density function (PDF) and the cumulative distribution function (CDF) of a nonnegative infinitely divisible random variable X. Our method uses the Lévy-Khintchine representation of the Laplace transform Ee-λX = e-ϕ(λ), where ϕ is the Laplace exponent. We apply the Post-Widder method for Laplace transform inversion combined with a sequence convergence accelerator to obtain accurate results. We demonstrate this technique on several examples, including the stable distribution, mixtures thereof, and integrals with respect to nonnegative Lévy processes.

In this paper we study sums of micropulses that generate different kinds of processes. Fractional Brownian motion and bifractional Brownian motion are obtained as limit processes. Moreover, we not only prove the convergence of finite-dimensional laws but also, in some cases, convergence in distribution in the space of right-continuous functions with left limits. Finally, we obtain generalizations with multidimensional indices.

A stochastic perpetuity takes the form D∞=∑n=0∞ exp(Y1+⋯+Yn)Bn, where Yn:n≥0) and (Bn:n≥0) are two independent sequences of independent and identically distributed random variables (RVs). This is an expression for the stationary distribution of the Markov chain defined recursively by Dn+1=AnDn+Bn, n≥0, where An=eYn; D∞ then satisfies the stochastic fixed-point equation D∞D̳AD∞+B, where A and B are independent copies of the An and Bn (and independent of D∞ on the right-hand side). In our framework, the quantity Bn, which represents a random reward at time n, is assumed to be positive, unbounded with EBnp <∞ for some p>0, and have a suitably regular continuous positive density. The quantity Yn is assumed to be light tailed and represents a discount rate from time n to n-1. The RV D∞ then represents the net present value, in a stochastic economic environment, of an infinite stream of stochastic rewards. We provide an exact simulation algorithm for generating samples of D∞. Our method is a variation of dominated coupling from the past and it involves constructing a sequence of dominating processes.

Let Xn be a sequence of integrable real random variables, adapted to a filtration (Gn). Define Cn = √{(1 / n)∑k=1nXk − E(Xn+1 | Gn)} and Dn = √n{E(Xn+1 | Gn) − Z}, where Z is the almost-sure limit of E(Xn+1 | Gn) (assumed to exist). Conditions for (Cn, Dn) → N(0, U) x N(0, V) stably are given, where U and V are certain random variables. In particular, under such conditions, we obtain √n{(1 / n)∑k=1nX_k - Z} = Cn + Dn → N(0, U + V) stably. This central limit theorem has natural applications to Bayesian statistics and urn problems. The latter are investigated, by paying special attention to multicolor randomly reinforced urns.

We consider the sample paths of the order statistics of independent and identically distributed random variables with common distribution function F. If F is strictly increasing but possibly having discontinuities, we prove that the sample paths of the order statistics satisfy the large deviation principle in the Skorokhod M1 topology. Sanov's theorem is deduced in the Skorokhod M'1 topology as a corollary to this result. A number of illustrative examples are presented, including applications to the sample paths of trimmed means and Hill plots.

We consider the Λ-coalescent processes with a positive frequency of singleton clusters. The class in focus covers, for instance, the beta(a, b)-coalescents with a > 1. We show that some large-sample properties of these processes can be derived by coupling the coalescent with an increasing Lévy process (subordinator), and by exploiting parallels with the theory of regenerative composition structures. In particular, we discuss the limit distributions of the absorption time and the number of collisions.

In this note we re-examine the analysis of the paper ‘On the martingale property of stochastic exponentials’ by Wong and Heyde (2004). Some counterexamples are presented and alternative formulations are discussed.

The variance minimization (VM) and cross-entropy (CE) methods are two versatile adaptive importance sampling procedures that have been successfully applied to a wide variety of difficult rare-event estimation problems. We compare these two methods via various examples where the optimal VM and CE importance densities can be obtained analytically. We find that in the cases studied both VM and CE methods prescribe the same importance sampling parameters, suggesting that the criterion of minimizing the CE distance is very close, if not asymptotically identical, to minimizing the variance of the associated importance sampling estimator.

Exact lower bounds on the exponential moments of min(y, X) and X1{X < y} are provided given the first two moments of a random variable X. These bounds are useful in work on large deviation probabilities and nonuniform Berry-Esseen bounds, when the Cramér tilt transform may be employed. Asymptotic properties of these lower bounds are presented. Comparative advantages of the so-called Winsorization min(y, X) over the truncation X1{X < y} are demonstrated. An application to option pricing is given.