Recursive Monte Carlo filters: Algorithms and theoretical analysis

dc.creatorKünsch, Hans R.
dc.date2006-02-10
dc.date.accessioned2026-07-07T08:07:30Z
dc.date.available2026-07-07T08:07:30Z
dc.descriptionRecursive Monte Carlo filters, also called particle filters, are a powerful tool to perform computations in general state space models. We discuss and compare the accept--reject version with the more common sampling importance resampling version of the algorithm. In particular, we show how auxiliary variable methods and stratification can be used in the accept--reject version, and we compare different resampling techniques. In a second part, we show laws of large numbers and a central limit theorem for these Monte Carlo filters by simple induction arguments that need only weak conditions. We also show that, under stronger conditions, the required sample size is independent of the length of the observed series.
dc.descriptionPublished at http://dx.doi.org/10.1214/009053605000000426 in the Annals of Statistics (http://www.imstat.org/aos/) by the Institute of Mathematical Statistics (http://www.imstat.org)
dc.identifierhttps://arxiv.org/abs/math/0602211
dc.identifierhttp://arxiv.org/abs/math/0602211
dc.identifierAnnals of Statistics 2005, Vol. 33, No. 5, 1983-2021
dc.identifierdoi:10.1214/009053605000000426
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/130959
dc.subjectStatistics Theory
dc.subject62M09 (Primary) 60G35, 60J22, 65C05 (Secondary)
dc.titleRecursive Monte Carlo filters: Algorithms and theoretical analysis
dc.typetext

Files

Collections