Adaptive multilevel splitting techniques
Tony Lelievre  1@  
1 : Centre d'Enseignement et de Recherche en Mathématiques et Calcul Scientifique  (CERMICS)  -  Website
Université Paris Est (UPE), École des Ponts ParisTech (ENPC), L'Institut National de Recherche en Informatique et e n Automatique (INRIA)
6 et 8 avenue Blaise Pascal Cité Descartes - Champs sur Marne 77455 Marne la Vallée Cedex 2 -  France

We will discuss algorithms to sample rare events and which are based on interacting replicas. More precisely, we will discuss the Adaptive Multilevel Splitting algorithm which has been proposed by F. Cérou and A. Guyader in 2007. We will discuss the efficiency of the algorithm and present some results concerning the unbiasedness of the estimator, whatever the choice of the importance function and the number of replicas. This has practical consequences on the use of this algorithm, which will be illustrated on various numerical experiments.

References:
D. Aristoff, T. Lelièvre, C.G. Mayne and I. Teo, Adaptive multilevel splitting in molecular dynamics simulations, ESAIM Proceedings and Surveys, 48, 215-225, (2015).
C.-E. Bréhier, T. Lelièvre and M. Rousset, Analysis of Adaptive Multilevel Splitting algorithms in an idealized case, to appear in ESAIM P&S.
C.-E. Bréhier, M. Gazeau, L. Goudenège, T. Lelièvre and M. Rousset, Unbiasedness of some generalized Adaptive Multilevel Splitting algorithms, http://arxiv.org/abs/1505.02674


Online user: 1