scispace - formally typeset
Search or ask a question
Author

Pascal Lezaud

Bio: Pascal Lezaud is an academic researcher from École nationale de l'aviation civile. The author has contributed to research in topics: Rare events & Markov process. The author has an hindex of 7, co-authored 15 publications receiving 273 citations.

Papers
More filters
Journal Article
TL;DR: In this article, a genetic type interacting particle system algorithm and a genealogical model for estimating a class of rare events arising in physics and network analysis is presented. But the authors do not consider how to estimate the probability of the corresponding rare events as well as the distribution of the process.
Abstract: We present in this article a genetic type interacting particle systems algorithm and a genealogical model for estimating a class of rare events arising in physics and network analysis. We represent the distribution of a Markov process hitting a rare target in terms of a Feynman-Kac model in path space. We show how these branching particle models described in previous works can be used to estimate the probability of the corresponding rare events as well as the distribution of the process in this regime.

92 citations

Proceedings ArticleDOI
04 Dec 2005
TL;DR: A genetic-type algorithm based on interacting particle systems is presented, together with a genealogical model, for estimating a class of rare events arising for instance in telecommunication networks, nuclear engineering, etc.
Abstract: In this article, a genetic-type algorithm based on interacting particle systems is presented, together with a genealogical model, for estimating a class of rare events arising for instance in telecommunication networks, nuclear engineering, etc. The distribution of a Markov process hitting a rare but critical set is represented in terms of a Feynman-Kac model in path space. Approximation results obtained previously for these models are applied here to estimate the probability of the rare events as well as the probability distribution of the critical trajectories.

47 citations

16 Sep 2013
TL;DR: In this paper, the authors provide an overview of the probability and statistical tools underlying the extreme value theory, which aims to predict occurrence of rare events, and explain that the asymptotic distribution of extreme values belongs, in some sense, to the family of the generalised extreme value distributions which depend on a real parameter, called the Extreme value index.
Abstract: We provide an overview of the probability and statistical tools underlying the extreme value theory, which aims to predict occurrence of rare events. Firstly, we explain that the asymptotic distribution of extreme values belongs, in some sense, to the family of the generalised extreme value distributions which depend on a real parameter, called the extreme value index. Secondly, we discuss statistical tail estimation methods based on estimators of the extreme value index.

41 citations

Book ChapterDOI
31 Jan 2006
TL;DR: In this article, the authors connect importance sampling techniques with interacting particle algorithms, and multi-splitting branching models, and provide a rather detailed presentation of the asymptotic theory of these particle algorithms including exponential extinction probabilities, Lp-mean error bounds, central limit theorem and fluctuation variance comparaisons.
Abstract: This article focuses on branching particle interpretations of rare events. We connect importance sampling techniques with interacting particle algorithms, and multi-splitting branching models. These Monte Carlo methods are illustrated with a variety of examples arising in particle trapping analysis, as well as in ruin type estimation problems. We also provide a rather detailed presentation of the asymptotic theory of these particle algorithms, including exponential extinction probabilities, Lp-mean error bounds, central limit theorem, and fluctuation variance comparaisons.

31 citations


Cited by
More filters
Book
01 Jan 2009

8,216 citations

Journal ArticleDOI
02 Jul 2007
TL;DR: This paper is intended to serve both as an introduction to SMC algorithms for nonspecialists and as a reference to recent contributions in domains where the techniques are still under significant development, including smoothing, estimation of fixed parameters and use of SMC methods beyond the standard filtering contexts.
Abstract: It is now over a decade since the pioneering contribution of Gordon (1993), which is commonly regarded as the first instance of modern sequential Monte Carlo (SMC) approaches. Initially focussed on applications to tracking and vision, these techniques are now very widespread and have had a significant impact in virtually all areas of signal and image processing concerned with Bayesian dynamical models. This paper is intended to serve both as an introduction to SMC algorithms for nonspecialists and as a reference to recent contributions in domains where the techniques are still under significant development, including smoothing, estimation of fixed parameters and use of SMC methods beyond the standard filtering contexts.

1,023 citations

Posted Content
TL;DR: In this article, the authors generalise l'estimateur bien connu de Hill de lindice d a fonction de reparatition avec queue de variation reguliere a une estimation de l'indice of a loi de valeurs extremes.
Abstract: On generalise l'estimateur bien connu de Hill de l'indice d'une fonction de reparatition avec queue de variation reguliere a une estimation de l'indice d'une loi de valeurs extremes. On demontre la convergence et la normalite asymptotique. On utilise l'estimateur pour certaines estimations comme celle d'une quantile elevee et d'un point d'extremite

655 citations

Journal ArticleDOI
TL;DR: A novel strategy for simulating rare events and an associated Monte Carlo estimation of tail probabilities using a system of interacting particles and exploits a Feynman-Kac representation of that system to analyze their fluctuations.
Abstract: This paper discusses a novel strategy for simulating rare events and an associated Monte Carlo estimation of tail probabilities. Our method uses a system of interacting particles and exploits a Feynman-Kac representation of that system to analyze their fluctuations. Our precise analysis of the variance of a standard multilevel splitting algorithm reveals an opportunity for improvement. This leads to a novel method that relies on adaptive levels and produces, in the limit of an idealized version of the algorithm, estimates with optimal variance. The motivation for this theoretical work comes from problems occurring in watermarking and fingerprinting of digital contents, which represents a new field of applications of rare event simulation techniques. Some numerical results show performance close to the idealized version of our technique for these practical applications.

216 citations

Book ChapterDOI
01 Jan 1996
TL;DR: In this paper, the authors considered a C0-semigroup of continuous linear operators acting on a Banach space with norm σ, and (Σ, e) is a measurable space.
Abstract: Throughout this chapter, we suppose that E is a Banach space with norm ‖ • ‖, and (Σ, e) is a measurable space. Further, we suppose that S is a C0-semigroup of continuous linear operators acting on E and that Q: e → ℒ(E) is a spectral measure, so that $$ X = \left( {\Omega ,{{\left\langle {{S_t}} \right\rangle }_{t \geqslant 0}},{{\left\langle {{M_t}} \right\rangle }_{t \geqslant 0}};{{\left\langle {{X_t}} \right\rangle }_{t \geqslant 0}}} \right)$$ is a σ-additive (S, Q)-process. Recall that this means that for each t ≥ 0, M t : S t → ℒ(E) is a σ-additive set function defined on a σ-algebra S t of subsets of Ω containing the collection e t {X} of all basic events before time t. To ensure that St is not too large, we suppose that it is contained in the completion with respect to the measure M t of the σ-algebra σ(e t {X}) generated by e t {X}, that is, the σ-algebra produced by augmenting σ(e t {X}) with all subsets of M t -null sets belonging to σ(e t {X}).

172 citations