Efficient importance sampling for Monte Carlo evaluation of exceedance probabilities (Q2455052): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: math/0703910 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Approach to the Limit Theory of Recurrent Markov Chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monte Carlo simulation and large deviations theory for uniformly recurrent Markov chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal Simulation Distributions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic approximations for error probabilities of sequential or fixed sample size tests in exponential families. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Saddlepoint approximations and nonlinear boundary crossing probabilities of Markov random walks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Importance Sampling for Generalized Likelihood Ratio Procedures in Sequential Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Importance sampling techniques for the multidimensional ruin problem for general Markov additive sequences of random vectors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic importance sampling for uniformly recurrent Markov chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5624436 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counterexamples in importance sampling for large deviations probabilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large deviations of uniformly recurrent Markov additive processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulating level-crossing probabilities by importance sampling / rank
 
Normal rank
Property / cites work
 
Property / cites work: On asymptotically efficient simulation of ruin probabilities in a Markovian environment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Markov chains and stochastic stability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Markov additive processes. I: Eigenvalue properties and limit theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Markov additive processes. II: Large deviations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On large deviations theory and asymptotically efficient Monte Carlo estimation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Importance sampling in the Monte Carlo study of sequential tests / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Local Limit Theorem for Nonlattice Multi-Dimensional Distribution Functions / rank
 
Normal rank

Latest revision as of 10:30, 27 June 2024

scientific article
Language Label Description Also known as
English
Efficient importance sampling for Monte Carlo evaluation of exceedance probabilities
scientific article

    Statements

    Efficient importance sampling for Monte Carlo evaluation of exceedance probabilities (English)
    0 references
    0 references
    0 references
    22 October 2007
    0 references
    The importance sampling is a powerful technique to compute the probabilities of rare events by Monte Carlo simulation. In the introduction of the paper some important notions of the theory of large deviations as a rare functions, exceedance probabilities, a consistence with large deviations, an asymptotically optimal choice and others are reminded. In section 2 asymptotically optimal importance sampling measures for the Monte Carlo evaluation of the boundary crossing probability \(Q_{c}\) and the tail probability \(Q_{n}\) are derived. A more precise definition of the asymptotic optimality of the choices of the importance sampling measures is given. A much more general way for constructing the asymptotically efficient importance sampling distribution is presented. Theorems 1 and 2, respectively, give the form of the asymptotically importance sampling measure \(Q_{c}\) and the asymptotically optimal importance sampling measure \(Q_{n}\) for evaluating the tail probability. Section 3 generalizes the methods and results of section 2 to the case of a Markov random walk. Section 3.1 is a modification of the usual likelihood ratio martingale to circumvent difficulties with an analysis of eigenfunctions for likelihood ratios. In section 3.2 a new renewal-theoretic approach to an extension of \textit{D. Siegmund}'s result [Ann. Stat. 4, 673--684 (1976; Zbl 0353.62044)] on exponential tilting to the Markov random walks is developed. In section 3.3 an extension of Theorem 1 to Markov setting is given. In section 3.4 an extension of Theorem 2 to Markov additive processes is proposed. A comparison with the dynamic importance sampling method is given. In section 4 numerical methods to address certain implementation issues are described. Numerical examples are provided to illustrate the effectiveness of the considered methods. Results obtained by applying the direct Monte Carlo method and the importance sampling are compared.
    0 references
    boundary crossing probability
    0 references
    importance sampling
    0 references
    Markov setting
    0 references
    Markov additive process
    0 references
    regeneration
    0 references
    asymptotically optimal importance sampling measure
    0 references
    Monte Carlo evaluation
    0 references
    tail probabilities
    0 references
    rare events
    0 references
    large deviations
    0 references
    Markov random walk
    0 references
    numerical examples
    0 references
    0 references

    Identifiers

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