We provide a characterization of realisable set covariograms, bringing a rigorous yet abstract solution to the S2 problem in materials science. Our method is based on the covariogram functional for random measurable sets (RAMS) and on a result about the representation of positive operators on a noncompact space. RAMS are an alternative to the classical random closed sets in stochastic geometry and geostatistics, and they provide a weaker framework that allows the manipulation of more irregular functionals, such as the perimeter. We therefore use the illustration provided by the S2 problem to advocate the use of RAMS for solving theoretical problems of a geometric nature. Along the way, we extend the theory of random measurable sets, and in particular the local approximation of the perimeter by local covariograms.

For a class of cell division processes in the Euclidean space ℝd, spatial consistency is investigated. This addresses the problem whether the distribution of the generated structures, restricted to a bounded set V, depends on the choice of a larger region W ⊃ V where the construction of the cell division process is performed. This can also be understood as the problem of boundary effects in the cell division procedure. It is known that the STIT tessellations are spatially consistent. In the present paper it is shown that, within a reasonable wide class of cell division processes, the STIT tessellations are the only ones that are consistent.

The class of restless bandits as proposed by Whittle (1988) have long been known to be intractable. This paper presents an optimality result which extends that of Weber and Weiss (1990) for restless bandits to a more general setting in which individual bandits have multiple levels of activation but are subject to an overall resource constraint. The contribution is motivated by the recent works of Glazebrook et al. (2011a), (2011b) who discussed the performance of index heuristics for resource allocation in such systems. Hitherto, index heuristics have been shown, under a condition of full indexability, to be optimal for a natural Lagrangian relaxation of such problems in which a resource is purchased rather than constrained. We find that under key assumptions about the nature of solutions to a deterministic differential equation that the index heuristics above are asymptotically optimal in a sense described by Whittle. We then demonstrate that these assumptions always hold for three-state bandits.

This paper is concerned with the bottom-up hierarchical system and public debate model proposed by Galam (2008), as well as a spatial version of the public debate model. In all three models, there is a population of individuals who are characterized by one of two competing opinions, say opinion −1 and opinion +1. This population is further divided into groups of common size s. In the bottom-up hierarchical system, each group elects a representative candidate, whereas in the other two models, all the members of each group discuss at random times until they reach a consensus. At each election/discussion, the winning opinion is chosen according to Galam's majority rule: the opinion with the majority of representatives wins when there is a strict majority, while one opinion, say opinion −1, is chosen by default in the case of a tie. For the public debate models we also consider the following natural updating rule that we call proportional rule: the winning opinion is chosen at random with a probability equal to the fraction of its supporters in the group. The three models differ in term of their population structure: in the bottom-up hierarchical system, individuals are located on a finite regular tree, in the nonspatial public debate model, they are located on a complete graph, and in the spatial public debate model, they are located on the d-dimensional regular lattice. For the bottom-up hierarchical system and nonspatial public debate model, Galam studied the probability that a given opinion wins under the majority rule and, assuming that individuals' opinions are initially independent, making the initial number of supporters of a given opinion a binomial random variable. The first objective of this paper is to revisit Galam's result, assuming that the initial number of individuals in favor of a given opinion is a fixed deterministic number. Our analysis reveals phase transitions that are sharper under our assumption than under Galam's assumption, particularly with small population size. The second objective is to determine whether both opinions can coexist at equilibrium for the spatial public debate model under the proportional rule, which depends on the spatial dimension.

In this paper we consider the beta(2 − α, α)-coalescents with 1 < α < 2 and study the moments of external branches, in particular, the total external branch length of an initial sample of n individuals. For this class of coalescents, it has been proved that nα-1T(n) →DT, where T(n) is the length of an external branch chosen at random and T is a known nonnegative random variable. For beta(2 − α, α)-coalescents with 1 < α < 2, we obtain limn→+∞n3α-5 𝔼(Lext(n) − n2-α𝔼T)2 = ((α − 1)Γ(α + 1))2Γ(4 − α) / ((3 − α)Γ(4 − 2α)).

We study a multistage epidemic model which generalizes the SIR model and where infected individuals go through K ≥ 1 stages of the epidemic before being removed. An infected individual in stage k ∈ {1, …, K} may infect a susceptible individual, who directly goes to stage k of the epidemic; or it may go to the next stage k + 1 of the epidemic. For this model, we identify the critical regime in which we establish diffusion approximations. Surprisingly, the limiting diffusion exhibits an unusual form of state space collapse which we analyze in detail.

We consider a branching random walk. Biggins and Kyprianou (2004) proved that, in the boundary case, the associated derivative martingale converges almost surely to a finite nonnegative limit, whose law serves as a fixed point of a smoothing transformation (Mandelbrot's cascade). In this paper, we give a necessary and sufficient condition for the nontriviality of the limit in this boundary case.

We present the first class of perfect sampling (also known as exact simulation) algorithms for the steady-state distribution of non-Markovian loss systems. We use a variation of dominated coupling from the past. We first simulate a stationary infinite server system backwards in time and analyze the running time in heavy traffic. In particular, we are able to simulate stationary renewal marked point processes in unbounded regions. We then use the infinite server system as an upper bound process to simulate the loss system. The running time analysis of our perfect sampling algorithm for loss systems is performed in the quality-driven (QD) and the quality-and-efficiency-driven regimes. In both cases, we show that our algorithm achieves subexponential complexity as both the number of servers and the arrival rate increase. Moreover, in the QD regime, our algorithm achieves a nearly optimal rate of complexity.

In this paper we consider a classic problem concerning the high excursion probabilities of a Gaussian random field f living on a compact set T. We develop efficient computational methods for the tail probabilities ℙ{supTf(t) > b}. For each positive ε, we present Monte Carlo algorithms that run in constant time and compute the probabilities with relative error ε for arbitrarily large b. The efficiency results are applicable to a large class of Hölder continuous Gaussian random fields. Besides computations, the change of measure and its analysis techniques have several theoretical and practical indications in the asymptotic analysis of Gaussian random fields.

The calculation of multivariate normal probabilities is of great importance in many statistical and economic applications. In this paper we propose a spherical Monte Carlo method with both theoretical analysis and numerical simulation. We start by writing the multivariate normal probability via an inner radial integral and an outer spherical integral using the spherical transformation. For the outer spherical integral, we apply an integration rule by randomly rotating a predetermined set of well-located points. To find the desired set, we derive an upper bound for the variance of the Monte Carlo estimator and propose a set which is related to the kissing number problem in sphere packings. For the inner radial integral, we employ the idea of antithetic variates and identify certain conditions so that variance reduction is guaranteed. Extensive Monte Carlo simulations on some probabilities confirm these claims.

For any strictly positive martingale S = eX for which X has a characteristic function, we provide an expansion for the implied volatility. This expansion is explicit in the sense that it involves no integrals, but only polynomials in the log-strike. We illustrate the versatility of our expansion by computing the approximate implied volatility smile in three well-known martingale models: one finite activity exponential Lévy model, Merton (1976), one infinite activity exponential Lévy model (variance gamma), and one stochastic volatility model, Heston (1993). Finally, we illustrate how our expansion can be used to perform a model-free calibration of the empirically observed implied volatility surface.

A random k-out mapping (digraph) on [n] is generated by choosing k random images of each vertex one at a time, subject to a 'preferential attachment' rule: the current vertex selects an image i with probability proportional to a given parameter α = α(n) plus the number of times i has already been selected. Intuitively, the larger α becomes, the closer the resulting k-out mapping is to the uniformly random k-out mapping. We prove that α = Θ(n1/2) is the threshold for α growing 'fast enough' to make the random digraph approach the uniformly random digraph in terms of the total variation distance. We also determine an exact limit for this distance for the α = βn1/2 case.

We investigate the large deviation properties of the maximum likelihood estimators for the Ornstein-Uhlenbeck process with shift. We propose a new approach to establish large deviation principles which allows us, via a suitable transformation, to circumvent the classical nonsteepness problem. We estimate simultaneously the drift and shift parameters. On the one hand, we prove a large deviation principle for the maximum likelihood estimates of the drift and shift parameters. Surprisingly, we find that the drift estimator shares the same large deviation principle as the estimator previously established for the Ornstein-Uhlenbeck process without shift. Sharp large deviation principles are also provided. On the other hand, we show that the maximum likelihood estimator of the shift parameter satisfies a large deviation principle with a very unusual implicit rate function.

Nonlinear filtering is investigated in a system where both the signal system and the observation system are under non-Gaussian Lévy fluctuations. Firstly, the Zakai equation is derived, and it is further used to derive the Kushner-Stratonovich equation. Secondly, by a filtered martingale problem, uniqueness for strong solutions of the Kushner-Stratonovich equation and the Zakai equation is proved. Thirdly, under some extra regularity conditions, the Zakai equation for the unnormalized density is also derived in the case of α-stable Lévy noise.