1998
DOI: 10.2307/3318719
|View full text |Cite
|
Sign up to set email alerts
|

Matched-Block Bootstrap for Dependent Data

Abstract: The block bootstrap for time series consists in randomly resampling blocks of consecutive v alues of the given data and aligning these blocks into a bootstrap sample. Here we suggest improving the performance of this method by aligning with higher likelihood those blocks which match at their ends. This is achieved by resampling the blocks according to a Markov c hain whose transitions depend on the data. The matching algorithms we propose take some of the dependence structure of the data into account. They are… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
71
0
1

Year Published

2001
2001
2015
2015

Publication Types

Select...
6
1
1

Relationship

0
8

Authors

Journals

citations
Cited by 90 publications
(73 citation statements)
references
References 17 publications
1
71
0
1
Order By: Relevance
“…This is a general problem for the block bootstrap and has been dealt with in a number of ways; either by trying to match blocks at their ends (Carlstein et al, 1998) or by down-weighting the block ends (Paparoditis and Politis, 2001). In this paper we propose an alternative based on transforming theˆ * i (t) to have the same covariance structure as was assumed for the original process.…”
Section: Bootstrap Proceduresmentioning
confidence: 99%
“…This is a general problem for the block bootstrap and has been dealt with in a number of ways; either by trying to match blocks at their ends (Carlstein et al, 1998) or by down-weighting the block ends (Paparoditis and Politis, 2001). In this paper we propose an alternative based on transforming theˆ * i (t) to have the same covariance structure as was assumed for the original process.…”
Section: Bootstrap Proceduresmentioning
confidence: 99%
“…The moving block bootstrap method samples time series 'blocks' or sets of fixed length l of consecutive data values and preserves much of the correlation structure in the blocks (Wilks, 1997). The matched block bootstrap technique is the same as the moving block method, except that the original dependence structure is maintained within the blocks as well as at block boundaries by applying a 'rank matching' procedure to join blocks that were a priori more likely to be close to one another (Carlstein et al, 1998;Srinivas and Srinivasan, 2005). The block lengths used here were estimated following Politis and White (2004), and from a publicly available Matlab computer code (http://fmg.lse.ac.uk/∼patton/code.html).…”
Section: Atmospheric Circulation and Sstmentioning
confidence: 99%
“…99-102;Davison and Hinkley, 1997, pp. 396-401), and 'matched block' bootstrap (Carlstein et al, 1998;Srinivas and Srinivasan, 2005) tests, the latter two of which can even be applied to weakly non-stationary time series (Carlstein et al, 1998).…”
Section: Atmospheric Circulation and Sstmentioning
confidence: 99%
“…However, the standard bootstrap assumes that the observations in the data are independent and identically distributed [7]. The moving block bootstrap method extends the standard bootstrap method in include correlated observations [15]. To maintain the temporal dependence in data, sequential observations are randomly sampled in blocks, rather than single observations.…”
Section: Moving Block Bootstrap Methodsmentioning
confidence: 99%