Consider a family of Boolean models, indexed by integers n≥1. The nth model features a Poisson point process in ℝn of intensity e{nρn}, and balls of independent and identically distributed radii distributed like X̅n√n. Assume that ρn→ρ as n→∞, and that X̅n satisfies a large deviations principle. We show that there then exist the three deterministic thresholds τd, the degree threshold, τp, the percolation probability threshold, and τv, the volume fraction threshold, such that, asymptotically as n tends to ∞, we have the following features. (i) For ρ<τd, almost every point is isolated, namely its ball intersects no other ball; (ii) for τd<ρ<τp, the mean number of balls intersected by a typical ball converges to ∞ and nevertheless there is no percolation; (iii) for τp<ρ<τv, the volume fraction is 0 and nevertheless percolation occurs; (iv) for τd<ρ<τv, the mean number of balls intersected by a typical ball converges to ∞ and nevertheless the volume fraction is 0; (v) for ρ>τv, the whole space is covered. The analysis of this asymptotic regime is motivated by problems in information theory, but it could be of independent interest in stochastic geometry. The relations between these three thresholds and the Shannon‒Poltyrev threshold are discussed.

Consider a real-valued discrete-time stationary and ergodic stochastic process, called the noise process. For each dimension n, we can choose a stationary point process in ℝn and a translation invariant tessellation of ℝn. Each point is randomly displaced, with a displacement vector being a section of length n of the noise process, independent from point to point. The aim is to find a point process and a tessellation that minimizes the probability of decoding error, defined as the probability that the displaced version of the typical point does not belong to the cell of this point. We consider the Shannon regime, in which the dimension n tends to ∞, while the logarithm of the intensity of the point processes, normalized by dimension, tends to a constant. We first show that this problem exhibits a sharp threshold: if the sum of the asymptotic normalized logarithmic intensity and of the differential entropy rate of the noise process is positive, then the probability of error tends to 1 with n for all point processes and all tessellations. If it is negative then there exist point processes and tessellations for which this probability tends to 0. The error exponent function, which denotes how quickly the probability of error goes to 0 in n, is then derived using large deviations theory. If the entropy spectrum of the noise satisfies a large deviations principle, then, below the threshold, the error probability goes exponentially fast to 0 with an exponent that is given in closed form in terms of the rate function of the noise entropy spectrum. This is obtained for two classes of point processes: the Poisson process and a Matérn hard-core point process. New lower bounds on error exponents are derived from this for Shannon's additive noise channel in the high signal-to-noise ratio limit that hold for all stationary and ergodic noises with the above properties and that match the best known bounds in the white Gaussian noise case.

Let {Yn | n = 1, 2,…} be a stochastic process and M a positive real number. Define the time of ruin by T = inf{n | Yn > M} (T = +∞ if Yn ≤ M for n = 1, 2,…). Using the techniques of large deviations theory we obtain rough exponential estimates for ruin probabilities for a general class of processes. Special attention is given to the probability that ruin occurs up to a certain time point. We also generalize the concept of the safety loading and consider its importance to ruin probabilities.

Let Y1, Y2, · ·· be a stochastic process and M a positive real number. Define TM = inf{n | Yn > M} (TM = + ∞ if for n = 1, 2, ···)· We are interested in the probabilities P(TM <∞) and in particular in the case when these tend to zero exponentially fast when M tends to infinity. The techniques of large deviations theory are used to obtain conditions for this and to find out the rate of convergence. The main hypotheses required are given in terms of the generating functions associated with the process (Yn).

Let X1, X2, · ·· be independent and identically distributed random variables such that ΕΧ1 < 0 and P(X1 ≥ 0) ≥ 0. Fix M ≥ 0 and let T = inf {n: X1 + X2 + · ·· + Xn ≥ M} (T = +∞, if for every n = 1,2, ···). In this paper we consider the estimation of the level-crossing probabilities P(T <∞) and , by using Monte Carlo simulation and especially importance sampling techniques. When using importance sampling, precision and efficiency of the estimation depend crucially on the choice of the simulation distribution. For this choice we introduce a new criterion which is of the type of large deviations theory; consequently, the basic large deviations theory is the main mathematical tool of this paper. We allow a wide class of possible simulation distributions and, considering the case that M →∞, we prove asymptotic optimality results for the simulation of the probabilities P(T <∞) and . The paper ends with an example.