Bootstrap Central Limit Theorem for Chains of Infinite Order via Markov Approximations

Simple item page
dc.creatorCollet, P.
dc.creatorDuarte, D.
dc.creatorGalves, A.
dc.date2005-05-11
dc.date.accessioned2026-07-07T05:19:49Z
dc.date.available2026-07-07T05:19:49Z
dc.descriptionWe present a new approach to the bootstrap for chains of infinite order taking values on a finite alphabet. It is based on a sequential Bootstrap Central Limit Theorem for the sequence of canonical Markov approximations of the chain of infinite order. Combined with previous results on the rate of approximation this leads to a Central Limit Theorem for the bootstrapped estimator of the sample mean which is the main result of this paper.
dc.description26 pages, TeX file
dc.identifierhttps://arxiv.org/abs/math/0505232
dc.identifierhttp://arxiv.org/abs/math/0505232
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/75158
dc.subjectProbability
dc.subject60F05
dc.titleBootstrap Central Limit Theorem for Chains of Infinite Order via Markov Approximations
dc.typetext

Files

Collections

arXiv