This work introduces and compares approaches for estimating rare-event probabilities related to the number of edges in the random geometric graph on a Poisson point process. In the one-dimensional setting, we derive closed-form expressions for a variety of conditional probabilities related to the number of edges in the random geometric graph and develop conditional Monte Carlo algorithms for estimating rare-event probabilities on this basis. We prove rigorously a reduction in variance when compared to the crude Monte Carlo estimators and illustrate the magnitude of the improvements in a simulation study. In higher dimensions, we leverage conditional Monte Carlo to remove the fluctuations in the estimator coming from the randomness in the Poisson number of nodes. Finally, building on conceptual insights from large-deviations theory, we illustrate that importance sampling using a Gibbsian point process can further substantially reduce the estimation variance.
Necessary and sufficient conditions for convergence in distribution of first-rare-event times and convergence in Skorokhod J-topology of first-rare-event-time processes for perturbed semi-Markov processes with finite phase space are obtained.
Rare events play a key role in many applications and numerous algorithms have been proposed for estimating the probability of a rare event. However, relatively little is known on how to quantify the sensitivity of the probability with respect to model parameters. In this paper, instead of the direct statistical estimation of rare event sensitivities, we develop novel and general uncertainty quantification and sensitivity bounds which are not tied to specific rare event simulation methods and which apply to families of rare events. Our method is based on a recently derived variational represent…
We develop rare-event simulation methodology for the analysis of loss events in a many-server loss system under quality-driven regime, focusing on the steady-state loss probability (i.e. fraction of lost customers over arrivals) and the behavior of the whole system leading to loss events. The analysis of these events requires working with the full measure-valued process describing the system. This is the first algorithm that is shown to be asymptotically optimal, in the rare-event simulation context, under the setting of many-server queues involving a full measure-valued descriptor.
We study rare event simulations of semimartingale reflecting Brownian motions (SRBMs) in an orthant. The rare event of interest is that a $d$-dimensional positive recurrent SRBM enters the set $B_n = \{z\in\mathbb{R}^d: \sum_{k=1}^d z_k = n\}$ before reaching a small neighborhood of the origin as $n\to\infty$. We show that under a proper scaling and some regularity conditions, the probability of interest satisfies a large deviation principle. We then construct a subsolution to the variational problem for our rare event, and based on this subsolution construct particle based simulation algorith…
In this paper we address the problem of rare-event simulation for heavy-tailed Lévy processes with infinite activities. We propose a strongly efficient importance sampling algorithm that builds upon the sample path large deviations for heavy-tailed Lévy processes, stick-breaking approximation of extrema of Lévy processes, and the randomized debiasing Monte Carlo scheme. The proposed importance sampling algorithm can be applied to a broad class of Lévy processes and exhibits significant improvements in efficiency when compared to crude Monte-Carlo method in our numerical experiments.
We study the large deviation estimates for the short time asymptotic behavior of a strongly degenerate diffusion process. Assuming a nilpotent structure of the Lie algebra generated by the driving vector fields, we obtain a graded large deviation principle and prove the existence of those "very rare events". In particular the first grade coincides with the classical Large Deviation Principle.
We propose a class of strongly efficient rare event simulation estimators for random walks and compound Poisson processes with a regularly varying increment/jump-size distribution in a general large deviations regime. Our estimator is based on an importance sampling strategy that hinges on the heavy-tailed sample path large deviations result recently established in Rhee, Blanchet, and Zwart (2016). The new estimators are straightforward to implement and can be used to systematically evaluate the probability of a wide range of rare events with bounded relative error. They are "universal" in the…
In this paper we use splitting technique to estimate the probability of hitting a rare but critical set by the continuous component of a switching diffusion. Instead of following classical approach we use Wonham filter to achieve multiple goals including reduction of asymptotic variance and exemption from sampling the discrete components.
We consider the general problem of estimating probabilities which arise as a union of dependent events. We propose a flexible series of estimators for such probabilities, and describe variance reduction schemes applied to the proposed estimators. We derive efficiency results of the estimators in rare-event settings, in particular those associated with extremes. Finally, we examine the performance of our estimators in a numerical example.
Improving Importance Sampling estimators for rare event probabilities requires sharp approximations of conditional densities. This is achieved for events E_{n}:=(f(X_{1})+...+f(X_{n}))\inA_{n} where the summands are i.i.d. and E_{n} is a large or moderate deviation event. The approximation of the conditional density of the real r.v's X_{i} 's, for 1\leqi\leqk_{n} with repect to E_{n} on long runs, when k_{n}/n\to1, is handled. The maximal value of k compatible with a given accuracy is discussed; algorithms and simulated results are presented.
The aim of the present work is to show that the results obtained earlier on the approximation of distributions of sums of independent terms by the accompanying compound Poisson laws may be interpreted as rather sharp quantitative estimates for the closeness between the sample containing independent observations of rare events and the Poisson point process which is obtained after a Poissonization of the initial sample.
We consider the superposition of symmetric simple exclusion dynamics speeded-up in time, with spin-flip dynamics in a one-dimensional interval with periodic boundary conditions. We show that the mixing time has an exponential lower bound in the system size if the potential of the hydrodynamic equation has more than two local minima. We also apply our estimates to show that the normalized hitting times of rare events converge to a mean one exponential random variable if the potential has a unique minimum.
We study the rare event behavior of the workload process in a transitory queue, where the arrival epochs (or points) of a finite number of jobs are assumed to be the ordered statistics of independent and identically distributed (i.i.d.) random variables. The service times (or marks) of the jobs are assumed to be i.i.d. random variables with a general distribution, that are jointly independent of the arrival epochs. Under the assumption that the service times are strictly positive, we derive the large deviations principle (LDP) satisfied by the workload process. The analysis leverages the conne…
We analyse the splitting algorithm performance in the estimation of rare event probabilities and this in a discrete multidimensional framework. For this we assume that each threshold is partitioned into disjoint subsets and the probability for a particle to reach the next threshold will depend on the starting subset. A straightforward estimator of the rare event probability is given by the proportion of simulated particles for which the rare event occurs. The variance of this estimator we get is the sum of two parts: one part resuming the variability due to each threshold and a second part res…
In this work, we propose an algorithm to simulate rare events for electronic circuit design. Our approach heavily relies on a smart use of importance sampling, which enables us to tackle probabilities of the magnitude 10 --10. Not only can we compute very rare default probability, but we can also compute the quantile associated to a given default probability and its expected shortfall. We show the impressive efficiency of method on real circuits.
The object of this paper is twofold. From one side we study the dichotomy, in terms of the Extremal Index of the possible Extreme Value Laws, when the rare events are centred around periodic or non periodic points. Then we build a general theory of Extreme Value Laws for randomly perturbed dynamical systems. We also address, in both situations, the convergence of Rare Events Point Processes. Decay of correlations against $L^1$ observables will play a central role in our investigations.
We present a common framework to study decay and exchanges rates in a wide class of dynamical systems. Several applications, ranging form the metric theory of continuons fractions and the Shannon capacity of contrained systems to the decay rate of metastable states, are given.
In this paper a method based on a Markov chain Monte Carlo (MCMC) algorithm is proposed to compute the probability of a rare event. The conditional distribution of the underlying process given that the rare event occurs has the probability of the rare event as its normalizing constant. Using the MCMC methodology a Markov chain is simulated, with that conditional distribution as its invariant distribution, and information about the normalizing constant is extracted from its trajectory. The algorithm is described in full generality and applied to the problem of computing the probability that a h…
In the boundary driven symmetric simple exclusion process consider an open set $\ms O$ of density profiles which does not contain the stationary density profile. We prove that the first time the empirical measure visits the set $\ms O$ converges to an exponential distribution.
We establish the general equivalence between rare event process for arbitrary continuous functions whose maximal values are achieved on non-trivial sets, and the entry times distribution for arbitrary measure zero sets. We then use it to show that the for differentiable maps on a compact Riemannian manifold that can be modeled by Young's towers, the rare event process and the limiting entry times distribution both converge to compound Poisson distributions. A similar result is also obtained on Gibbs-Markov systems, for both cylinders and open sets. We also give explicit expressions for the par…
In the hypothesis of rare loss events, the general expression of the policy value has been determined as a functional of the "expected frequency / loss severity" function and of the retention function. Exponential disutility has been chosen after mathematical characterization of some of its economical aspects, where functional properties of quasiarithmetic averages have been used. By means of variational techniques, in the case of a risk neutral Insurer the Pareto-optimal retention function has been finally determined.
We propose an adaptive importance sampling scheme for the simulation of rare events when the underlying dynamics is given by a diffusion. The scheme is based on a Gibbs variational principle that is used to determine the optimal (i.e. zero-variance) change of measure and exploits the fact that the latter can be rephrased as a stochastic optimal control problem. The control problem can be solved by a stochastic approximation algorithm, using the Feynman-Kac representation of the associated dynamic programming equations, and we discuss numerical aspects for high-dimensional problems along with s…
For rare events described in terms of Markov processes, truly unbiased estimation of the rare event probability generally requires the avoidance of numerical approximations of the Markov process. Recent work in the exact and $\varepsilon$-strong simulation of diffusions, which can be used to almost surely constrain sample paths to a given tolerance, suggests one way to do this. We specify how such algorithms can be combined with the classical multilevel splitting method for rare event simulation. This provides unbiased estimations of the probability in question. We discuss the practical feasib…
We consider systems of stochastic differential equations with multiple scales and small noise and assume that the coefficients of the equations are ergodic and stationary random fields. Our goal is to construct provably-efficient importance sampling Monte Carlo methods that allow efficient computation of rare event probabilities or expectations of functionals that can be associated with rare events. Standard Monte Carlo algorithms perform poorly in the small noise limit and hence fast simulations algorithms become relevant. The presence of multiple scales complicates the design and the analysi…
We study probabilities of various rare events for the limiting point process that appears at the random matrix hard edge. We also show a transition from hard edge to bulk behavior. Asymptotic events studied include a central limit theorem and large deviation result for the number of points in a growing interval $[0,λ]$ as $λ\to \infty$. We study these results for the square root of the hard edge process. In this setting many of these behaviors mimic those of the Sine$_β$ process.
The goal of this paper is to develop provably efficient importance sampling Monte Carlo methods for the estimation of rare events within the class of linear stochastic partial differential equations (SPDEs). We find that if a spectral gap of appropriate size exists, then one can identify a lower dimensional manifold where the rare event takes place. This allows one to build importance sampling changes of measures that perform provably well even pre-asymptotically (i.e. for small but non-zero size of the noise) without degrading in performance due to infinite dimensionality or due to long simul…
New Vapnik and Chervonenkis type concentration inequalities are derived for the empirical distribution of an independent random sample. Focus is on the maximal deviation over classes of Borel sets within a low probability region. The constants are explicit, enabling numerical comparisons.
We show that a uniformly continuous random perturbation of a transitive map defines an aperiodic Harris chain which also satisfies Doeblin's condition. As a result, we get exponential decay of correlations for suitable random perturbations of such systems. We also prove that, for transitive maps, the limiting distribution for Extreme Value Laws (EVLs) and Hitting/Return Time Statistics (HTS/RTS) is standard exponential. Moreover, we show that the Rare Event Point Process (REPP) converges in distribution to a standard Poisson process.
Using recent mathematical advances, a geometric approach to rare noise-driven transition events in nonequilibrium systems is given, and an algorithm for computing the maximum likelihood transition curve is generalized to the case of state-dependent noise. It is applied to a model of electronic transport in semiconductor superlattices to investigate transitions between metastable electric field distributions. When the applied voltage $V$ is varied near a saddle-node bifurcation at $V_th$, the mean life time $<T>$ of the initial metastable state is shown to scale like $log<T> \propto |V_th - V|^…
This paper introduces a new Importance Sampling scheme, called Adaptive Twisted Importance Sampling, which is adequate for the improved estimation of rare event probabilities in he range of moderate deviations pertaining to the empirical mean of real i.i.d. summands. It is based on a sharp approximation of the density of long runs extracted from a random walk conditioned on its end value.
Atypical, rare trajectories of dynamical systems are important: they are often the paths for chemical reactions, the haven of (relative) stability of planetary systems, the rogue waves that are detected in oil platforms, the structures that are responsible for intermittency in a turbulent liquid, the active regions that allow a supercooled liquid to flow... Simulating them in an efficient, accelerated way, is in fact quite simple. In this paper we review a computational technique to study such rare events in both stochastic and Hamiltonian systems. The method is based on the evolution of a fam…
