We consider decay properties including the decay parameter, invariant measures, invariant vectors, and quasistationary distributions of a Markovian bulk-arriving queue that stops immediately after hitting the zero state. Investigating such behavior is crucial in realizing the busy period and some other related properties of Markovian bulk-arriving queues. The exact value of the decay parameter λC is obtained and expressed explicitly. The invariant measures, invariant vectors, and quasistationary distributions are then presented. We show that there exists a family of invariant measures indexed by λ ∈ [0, λC]. We then show that, under some conditions, there exists a family of quasistationary distributions, also indexed by λ ∈ [0, λC]. The generating functions of these invariant measures and quasistationary distributions are presented. We further show that a stopped Markovian bulk-arriving queue is always λC-transient and some deep properties are revealed. The clear geometric interpretation of the decay parameter is explained. A few examples are then provided to illustrate the results obtained in this paper.

We present a method to obtain both exact values and sharp estimates for the total variation distance between binomial and Poisson distributions with the same mean λ. We give a simple efficient algorithm, whose complexity order is to compute exact values. Such an algorithm can be further simplified for moderate sample sizes n, provided that λ is neither close to from the left nor close to from the right. Sharp estimates, better than other known estimates in the literature, are also provided. The 0s of the second Krawtchouk and Charlier polynomials play a fundamental role.

This paper is concerned with the finiteness and large-time behaviour of moments of the overshoot and undershoot of a high level, and of their moment generating functions (MGFs), for a Lévy process which drifts to -∞ almost surely. This provides information relevant to quantities associated with the ruin of an insurance risk process. Results of Klüppelberg, Kyprianou, and Maller (2004) and Doney and Kyprianou (2006) for asymptotic overshoot and undershoot distributions in the class of Lévy processes with convolution equivalent canonical measures are shown to have moment and MGF convergence extensions.

We study the exponential utility indifference valuation of a contingent claim B in an incomplete market driven by two Brownian motions. The claim depends on a nontradable asset stochastically correlated with the traded asset available for hedging. We use martingale arguments to provide upper and lower bounds, in terms of bounds on the correlation, for the value VB of the exponential utility maximization problem with the claim B as random endowment. This yields an explicit formula for the indifference value b of B at any time, even with a fairly general stochastic correlation. Earlier results with constant correlation are recovered and extended. The reason why all this works is that, after a transformation to the minimal martingale measure, the value VB enjoys a monotonicity property in the correlation between tradable and nontradable assets.

We study sample covariance matrices of the form W = (1 / n)CCT, where C is a k x n matrix with independent and identically distributed (i.i.d.) mean 0 entries. This is a generalization of the so-called Wishart matrices, where the entries of C are i.i.d. standard normal random variables. Such matrices arise in statistics as sample covariance matrices, and the high-dimensional case, when k is large, arises in the analysis of DNA experiments. We investigate the large deviation properties of the largest and smallest eigenvalues of W when either k is fixed and n → ∞ or kn → ∞ with kn = o(n / log log n), in the case where the squares of the i.i.d. entries have finite exponential moments. Previous results, proving almost sure limits of the eigenvalues, require only finite fourth moments. Our most explicit results for large k are for the case where the entries of C are ∓ 1 with equal probability. We relate the large deviation rate functions of the smallest and largest eigenvalues to the rate functions for i.i.d. standard normal entries of C. This case is of particular interest since it is related to the problem of decoding of a signal in a code-division multiple-access (CDMA) system arising in mobile communication systems. In this example, k is the number of users in the system and n is the length of the coding sequence of each of the users. Each user transmits at the same time and uses the same frequency; the codes are used to distinguish the signals of the separate users. The results imply large deviation bounds for the probability of a bit error due to the interference of the various users.

The paper deals with the asymptotic behavior of the bridge of a Gaussian process conditioned to stay in n fixed points at n fixed past instants. In particular, functional large deviation results are stated for small time. Several examples are considered: integrated or not fractional Brownian motions and m-fold integrated Brownian motion. As an application, the asymptotic behavior of the exit probability is studied and used for the practical purpose of the numerical computation, via Monte Carlo methods, of the hitting probability up to a given time of the unpinned process.

This paper presents new Gaussian approximations for the cumulative distribution function P(Aλ ≤ s) of a Poisson random variable Aλ with mean λ. Using an integral transformation, we first bring the Poisson distribution into quasi-Gaussian form, which permits evaluation in terms of the normal distribution function Φ. The quasi-Gaussian form contains an implicitly defined function y, which is closely related to the Lambert W-function. A detailed analysis of y leads to a powerful asymptotic expansion and sharp bounds on P(Aλ ≤ s). The results for P(Aλ ≤ s) differ from most classical results related to the central limit theorem in that the leading term Φ(β), with is replaced by Φ(α), where α is a simple function of s that converges to β as s tends to ∞. Changing β into α turns out to increase precision for small and moderately large values of s. The results for P(Aλ ≤ s) lead to similar results related to the Erlang B formula. The asymptotic expansion for Erlang's B is shown to give rise to accurate approximations; the obtained bounds seem to be the sharpest in the literature thus far.

We study the evolution in time of the joint distribution of a pair of Feller processes, related by the fact that some random time ago they were identical, evolving as a single Feller process; from that time on, they began to evolve independently, conditional on a state at the time of split, according to the same Feller transition probabilities. Such processes are involved in the Fisher-Wright model: the distribution of the time counted backwards from the present to the time of split in the past is a function of deterministic but time-varying effective size 2N of the population from which the two processes are sampled. In terms of a corresponding family of Feller operators, assuming asymptotic stability or ergodicity of the process of mutation, we find the limit form of the distribution of such pairs of processes sampled from decaying, asymptotically constant, and growing populations. In the case where mutation is not asymptotically stable or ergodic, limit distributions are found for the distribution of relative differences.

We give a functional central limit theorem for spatial birth and death processes based on the representation of such processes as solutions of stochastic equations. For any bounded and integrable function in Euclidean space, we define a family of processes which is obtained by integrals of this function with respect to the centered and scaled spatial birth and death process with constant death rate. We prove that this family converges weakly to a Gaussian process as the scale parameter goes to infinity. We do not need the birth rates to have a finite range of interaction. Instead, we require that the birth rates have a range of interaction that decays polynomially. In order to show the convergence of the finite-dimensional distributions of the above processes, we extend Penrose's multivariate spatial central limit theorem. An example of the asymptotic normalities of the time-invariance estimators for the birth rates of spatial point processes is given.

While the convergence properties of many sampling selection methods can be proven, there is one particular sampling selection method introduced in Baker (1987), closely related to ‘systematic sampling’ in statistics, that has been exclusively treated on an empirical basis. The main motivation of the paper is to start to study formally its convergence properties, since in practice it is by far the fastest selection method available. We will show that convergence results for the systematic sampling selection method are related to properties of peculiar Markov chains.

We prove that the Heston volatility is Malliavin differentiable under the classical Novikov condition and give an explicit expression for the derivative. This result guarantees the applicability of Malliavin calculus in the framework of the Heston stochastic volatility model. Furthermore, we derive conditions on the parameters which assure the existence of the second Malliavin derivative of the Heston volatility. This allows us to apply recent results of Alòs (2006) in order to derive approximate option pricing formulae in the context of the Heston model. Numerical results are given.

We consider a stochastic fluid queue served by a constant rate server and driven by a process which is the local time of a reflected Lévy process. Such a stochastic system can be used as a model in a priority service system, especially when the time scales involved are fast. The input (local time) in our model is typically (but not necessarily) singular with respect to the Lebesgue measure, a situation which, in view of the nonsmooth or bursty nature of several types of Internet traffic, is nowadays quite realistic. We first discuss how to rigorously construct the (necessarily) unique stationary version of the system under some natural stability conditions. We then consider the distribution of performance steady-state characteristics, namely, the buffer content, the idle period, and the busy period. These derivations are much based on the fact that the inverse of the local time of a Markov process is a Lévy process (a subordinator), hence making the theory of Lévy processes applicable. Another important ingredient in our approach is the use of Palm calculus for stationary random point processes and measures.

This paper revisits a general optimal stopping problem that often appears as a special case in some finance applications. The problem is essentially of the same form as the investment-timing problem of McDonald and Siegel (1986) in which the underlying processes are two correlated geometric Brownian motions (GBMs) with drifts less than the discount rate. By contrast, we attempt to analyze the underlying optimal stopping problem to its full generality without imposing any restriction on the drifts of the GBMs. By extending the first passage time approach of Xia and Zhou (2007) to the current context, we manage to obtain a complete and explicit characterization of the solution to the problem on all possible drift domains. Our analysis leads to a new and interesting observation that the underlying optimal stopping problem admits a two-sided optimal continuation region on some certain parameter domains.

The diffusion-generator approximation technique developed by De Iorio and Griffiths (2004a) is a very useful method of constructing importance-sampling proposal distributions. Being based on general mathematical principles, the method can be applied to various models in population genetics. In this paper we extend the technique to the neutral coalescent model with recombination, thus obtaining novel sampling distributions for the two-locus model. We consider the case with subdivided population structure, as well as the classic case with only a single population. In the latter case we also consider the importance-sampling proposal distributions suggested by Fearnhead and Donnelly (2001), and show that their two-locus distributions generally differ from ours. In the case of the infinitely-many-alleles model, our approximate sampling distributions are shown to be generally closer to the true distributions than are Fearnhead and Donnelly's.

We study the survival properties of inhomogeneous Galton-Watson processes. We determine the so-called branching number (which is the reciprocal of the critical value for percolation) for these random trees (conditioned on being infinite), which turns out to be an almost sure constant. We also shed some light on the way in which the survival probability varies between the generations. When we perform independent percolation on the family tree of an inhomogeneous Galton-Watson process, the result is essentially a family of inhomogeneous Galton-Watson processes, parameterized by the retention probability p. We provide growth rates, uniformly in p, of the percolation clusters, and also show uniform convergence of the survival probability from the nth level along subsequences. These results also establish, as a corollary, the supercritical continuity of the percolation function. Some of our results are generalizations of results in Lyons (1992).

Consider a sequence (Xk: k ≥ 0) of regularly varying independent and identically distributed random variables with mean 0 and finite variance. We develop efficient rare-event simulation methodology associated with large deviation probabilities for the random walk (Sn: n ≥ 0). Our techniques are illustrated by examples, including large deviations for the empirical mean and path-dependent events. In particular, we describe two efficient state-dependent importance sampling algorithms for estimating the tail of Sn in a large deviation regime as n ↗ ∞. The first algorithm takes advantage of large deviation approximations that are used to mimic the zero-variance change of measure. The second algorithm uses a parametric family of changes of measure based on mixtures. Lyapunov-type inequalities are used to appropriately select the mixture parameters in order to guarantee bounded relative error (or efficiency) of the estimator. The second example involves a path-dependent event related to a so-called knock-in financial option under heavy-tailed log returns. Again, the importance sampling algorithm is based on a parametric family of mixtures which is selected using Lyapunov bounds. In addition to the theoretical analysis of the algorithms, numerical experiments are provided in order to test their empirical performance.

We investigate the properties of multifractal products of geometric Ornstein-Uhlenbeck (OU) processes driven by Lévy motion. The conditions on the mean, variance, and covariance functions of the resulting cumulative processes are interpreted in terms of the moment generating functions. We consider five cases of infinitely divisible distributions for the background driving Lévy processes, namely, the gamma and variance gamma distributions, the inverse Gaussian and normal inverse Gaussian distributions, and the z-distributions. We establish the corresponding scenarios for the limiting processes, including their Rényi functions and dependence structure.

We consider a piecewise-deterministic Markov process (Xt) governed by a jump intensity function, a rate function that determines the behaviour between jumps, and a stochastic kernel describing the conditional distribution of jump sizes. The paper deals with the point process of upcrossings of some level b by (Xt). We prove a version of Rice's formula relating the stationary density of (Xt) to level crossing intensities and show that, for a wide class of processes (Xt), as b → ∞, the scaled point process where ν+(b) denotes the intensity of upcrossings of b, converges weakly to a geometrically compound Poisson process.

In this paper we investigate the ‘local’ properties of a random mapping model, TnD̂, which maps the set {1, 2, …, n} into itself. The random mapping TnD̂, which was introduced in a companion paper (Hansen and Jaworski (2008)), is constructed using a collection of exchangeable random variables D̂1, …, D̂n which satisfy In the random digraph, GnD̂, which represents the mapping TnD̂, the in-degree sequence for the vertices is given by the variables D̂1, D̂2, …, D̂n, and, in some sense, GnD̂ can be viewed as an analogue of the general independent degree models from random graph theory. By local properties we mean the distributions of random mapping characteristics related to a given vertex v of GnD̂ - for example, the numbers of predecessors and successors of v in GnD̂. We show that the distribution of several variables associated with the local structure of GnD̂ can be expressed in terms of expectations of simple functions of D̂1, D̂2, …, D̂n. We also consider two special examples of TnD̂ which correspond to random mappings with preferential and anti-preferential attachment, and determine, for these examples, exact and asymptotic distributions for the local structure variables considered in this paper. These distributions are also of independent interest.

The problem of finding the probability distribution of the first hitting time of a double integral process (DIP) such as the integrated Wiener process (IWP) has been an important and difficult endeavor in stochastic calculus. It has applications in many fields of physics (first exit time of a particle in a noisy force field) or in biology and neuroscience (spike time distribution of an integrate-and-fire neuron with exponentially decaying synaptic current). The only results available are an approximation of the stationary mean crossing time and the distribution of the first hitting time of the IWP to a constant boundary. We generalize these results and find an analytical formula for the first hitting time of the IWP to a continuous piecewise-cubic boundary. We use this formula to approximate the law of the first hitting time of a general DIP to a smooth curved boundary, and we provide an estimation of the convergence of this method. The accuracy of the approximation is computed in the general case for the IWP and the effective calculation of the crossing probability can be carried out through a Monte Carlo method.