Multilevel branching splitting algorithm for estimating rare event probabilities

Abstract : We analyze the splitting algorithm performance in the estimation of rare event probabilities 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 is the sum of two parts: with one part resuming the variability due to each threshold, and the second part resuming the variability due to the number of thresholds. This decomposition is analogous to that of the continuous case. The optimal algorithm is then derived by cancelling the first term leading to optimal thresholds. Then we compare this variance with that of the algorithm in which one of the threshold has been deleted. Finally, we investigate the sensitivity of the variance of the estimator with respect to a shape deformation of an optimal threshold. As an example, we consider a two-dimensional Ornstein–Uhlenbeck process with conformal maps for shape deformation.
Document type :
Journal articles
Liste complète des métadonnées
Contributor : Laurence Porte <>
Submitted on : Monday, January 23, 2017 - 10:16:00 AM
Last modification on : Friday, April 12, 2019 - 4:22:51 PM
Document(s) archivé(s) le : Monday, April 24, 2017 - 12:52:33 PM


Files produced by the author(s)



Agnès Lagnoux, Pascal Lezaud. Multilevel branching splitting algorithm for estimating rare event probabilities. Simulation Modelling Practice and Theory, Elsevier, 2017, 72 (March 2017), pp 150-167. ⟨10.1016/j.simpat.2016.12.009⟩. ⟨hal-01269766v3⟩



Record views


Files downloads