Splitting algorithms for rare event simulation over long time intervals (Q2240483)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 7420077
Language Label Description Also known as
default for all languages
No label defined
    English
    Splitting algorithms for rare event simulation over long time intervals
    scientific article; zbMATH DE number 7420077

      Statements

      Splitting algorithms for rare event simulation over long time intervals (English)
      0 references
      0 references
      0 references
      0 references
      4 November 2021
      0 references
      The problem of interest is to estimate exit probabilities of a discrete time process \(\{X_i^n\}\) from a bounded open set \(D \subset \mathbb R^d\) over a time interval \([0,T (n)]\). The main focus of this paper is a Monte Carlo estimation of the probability, and in particular on the use of splitting methods in the estimation of exit probabilities. Within the setting of splitting schemes, there are those of interest which allow killing to improve efficiency without introducing bias, with one of the most well known of such schemes being the RESTART method. The authors focus mainly on them. They show that, in contrast to alternatives such as importance sampling, the decay rate of the second moment does not degrade as \(T \rightarrow \infty \). In the course of the analysis, they develop some related large deviation estimates that apply when the time interval of interest depends on the large deviation parameter.
      0 references
      large deviations
      0 references
      metastable points
      0 references
      Monte Carlo methods
      0 references
      restart
      0 references
      splitting algorithms
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references