Long runs under a conditional limit distribution (Q473155): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / review text
 
The authors provide a sharp approximation of the density of long runs of a random walk conditioned on its end value or by an average of a function of its summands as their number tends to \(\infty\). In the large deviation range of the conditioning event, it extends the Gibbs conditional principle, in the sense that it provides a description of the distribution of the random walk on long subsequences. The authors also obtain an approximation of the density of the runs in the case in which the conditioning event states that the end value of the random walk belongs to a thin or a thick set with a nonempty interior. Such approximations hold either in probability under the conditional distribution of the random walk, or in total variation norm between measures. The authors provide an application of the described approximation scheme to the evaluation of rare event probabilities through importance sampling. In the case in which the conditioning event is in the range of the central limit theorem, it provides a tool for statistical inference, in the sense that it provides an efficient way to implement the Rao-Blackwell-Kolmogorov theorem for the improvement of estimators, and it also leads to conditional inference procedures in models with nuisance parameters. The paper is concluded by an algorithm for the simulation of such long runs, together with an algorithm determining the maximal length for which the approximation is valid up to a prescribed accuracy.
Property / review text: The authors provide a sharp approximation of the density of long runs of a random walk conditioned on its end value or by an average of a function of its summands as their number tends to \(\infty\). In the large deviation range of the conditioning event, it extends the Gibbs conditional principle, in the sense that it provides a description of the distribution of the random walk on long subsequences. The authors also obtain an approximation of the density of the runs in the case in which the conditioning event states that the end value of the random walk belongs to a thin or a thick set with a nonempty interior. Such approximations hold either in probability under the conditional distribution of the random walk, or in total variation norm between measures. The authors provide an application of the described approximation scheme to the evaluation of rare event probabilities through importance sampling. In the case in which the conditioning event is in the range of the central limit theorem, it provides a tool for statistical inference, in the sense that it provides an efficient way to implement the Rao-Blackwell-Kolmogorov theorem for the improvement of estimators, and it also leads to conditional inference procedures in models with nuisance parameters. The paper is concluded by an algorithm for the simulation of such long runs, together with an algorithm determining the maximal length for which the approximation is valid up to a prescribed accuracy. / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Pavel V. Gapeev / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 60B10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 65C50 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 60F10 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6371850 / rank
 
Normal rank
Property / zbMATH Keywords
 
Gibbs principle
Property / zbMATH Keywords: Gibbs principle / rank
 
Normal rank
Property / zbMATH Keywords
 
conditioned random walk
Property / zbMATH Keywords: conditioned random walk / rank
 
Normal rank
Property / zbMATH Keywords
 
large deviation
Property / zbMATH Keywords: large deviation / rank
 
Normal rank
Property / zbMATH Keywords
 
moderate deviation
Property / zbMATH Keywords: moderate deviation / rank
 
Normal rank
Property / zbMATH Keywords
 
simulation
Property / zbMATH Keywords: simulation / rank
 
Normal rank
Property / zbMATH Keywords
 
importance sampling
Property / zbMATH Keywords: importance sampling / rank
 
Normal rank
Property / zbMATH Keywords
 
Rao-Blackwell-Kolmogorov theorem
Property / zbMATH Keywords: Rao-Blackwell-Kolmogorov theorem / rank
 
Normal rank

Revision as of 17:14, 30 June 2023

scientific article
Language Label Description Also known as
English
Long runs under a conditional limit distribution
scientific article

    Statements

    Long runs under a conditional limit distribution (English)
    0 references
    0 references
    0 references
    21 November 2014
    0 references
    The authors provide a sharp approximation of the density of long runs of a random walk conditioned on its end value or by an average of a function of its summands as their number tends to \(\infty\). In the large deviation range of the conditioning event, it extends the Gibbs conditional principle, in the sense that it provides a description of the distribution of the random walk on long subsequences. The authors also obtain an approximation of the density of the runs in the case in which the conditioning event states that the end value of the random walk belongs to a thin or a thick set with a nonempty interior. Such approximations hold either in probability under the conditional distribution of the random walk, or in total variation norm between measures. The authors provide an application of the described approximation scheme to the evaluation of rare event probabilities through importance sampling. In the case in which the conditioning event is in the range of the central limit theorem, it provides a tool for statistical inference, in the sense that it provides an efficient way to implement the Rao-Blackwell-Kolmogorov theorem for the improvement of estimators, and it also leads to conditional inference procedures in models with nuisance parameters. The paper is concluded by an algorithm for the simulation of such long runs, together with an algorithm determining the maximal length for which the approximation is valid up to a prescribed accuracy.
    0 references
    Gibbs principle
    0 references
    conditioned random walk
    0 references
    large deviation
    0 references
    moderate deviation
    0 references
    simulation
    0 references
    importance sampling
    0 references
    Rao-Blackwell-Kolmogorov theorem
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references