Tutorials › Exam SRM - Statistics for Risk Modeling › Block Bootstrap for Dependent Observations

Exam SRM · Resampling and Performance · Tutorial 823 of 926

Block Bootstrap for Dependent Observations

Construct block-bootstrap samples correctly and assess the tradeoff between preserving local dependence and having enough effectively distinct blocks.

Advanced 12 min read

What You'll Learn

  • Define moving-block and circular-block bootstrap sampling for an ordered sequence
  • Construct a resampled sequence and calculate its statistic
  • Distinguish original adjacencies from circular wrap-around and joins between blocks
  • Count retained transitions in a finite sample, including a truncated final block
  • Explain how block length affects dependence preservation and resampling variability
  • Recognize conditions and limitations when using a block bootstrap

Why Resampling Must Respect Order

An ordinary bootstrap draws individual observations independently with replacement. That is appropriate when the observations are independent and identically distributed, but it can be misleading for an ordered sequence whose neighboring values tend to be related. For example, a hypothetical insurer’s daily claim count may be elevated for several consecutive days after a particular event. Drawing days independently breaks those runs and can understate the uncertainty of a statistic that depends on the sequence.

The block bootstrap resamples consecutive groups of observations. It keeps the order within each selected group, so short stretches of the observed dependence can recur in a bootstrap sample. It does not reproduce every dependence pattern exactly: joins between separately sampled blocks, the choice of block length, and the finite sample all matter.

Definition: Let \(X_1,\ldots,X_n\) be an ordered observed sequence. A block of length \(\ell\) consists of \(\ell\) consecutive observations. A block-bootstrap sample is formed by drawing blocks with replacement, concatenating them, and retaining the first \(n\) observations of the concatenation. In a moving-block bootstrap, blocks must lie within the original linear sequence. In a circular-block bootstrap, the sequence is treated as circular, so a block can continue from \(X_n\) to \(X_1\).

The usual goal is to approximate the sampling distribution of a statistic, such as the sample mean, when observations are dependent. A block-bootstrap replicate is one resampled sequence of length \(n\); the statistic is recalculated on that sequence. Repeating this produces bootstrap replicates. The purpose is not to make the resampled values independent, but to preserve some of their local ordering.

Moving and Circular Blocks

For the moving-block bootstrap, the possible starting positions are \(1,\ldots,n-\ell+1\). Each block has the form \((X_s,\ldots,X_{s+\ell-1})\). Draw starting positions independently and uniformly from these possibilities, using replacement. Concatenate the selected blocks and truncate the result to length \(n\). The final block may therefore contribute fewer than \(\ell\) observations.

For the circular-block bootstrap, define indices cyclically: after \(n\) comes \(1\). A block starting at \(s\) is \((X_s,X_{s+1},\ldots)\), with indices wrapped around as needed. There are \(n\) possible starting positions. This removes the special restriction that a moving block cannot start near the end of the observed sequence, but it introduces a potential seam: \(X_n\) followed by \(X_1\) was not an observed linear-time transition.

Worked Example: Building a Moving-Block Replicate

A hypothetical sequence of daily service requests is \(2,3,5,4,6,7,5,8\). Use a moving-block bootstrap with block length \(\ell=3\). Suppose the sampled starting positions, in order, are 2, 5, and 1. Construct the bootstrap sample and calculate its mean.

Method. The moving blocks of length 3 at those starts are \((3,5,4)\), \((6,7,5)\), and \((2,3,5)\). Concatenate them to obtain \(3,5,4,6,7,5,2,3,5\). Since the required sample length is \(n=8\), truncate the last observation. The bootstrap sample is therefore \((3,5,4,6,7,5,2,3)\).

Its sum is \(3+5+4+6+7+5+2+3=35\). Thus its mean is \(35/8=4.375\). As a check, the sample contains exactly eight observations, and every pair inside a selected moving block is an adjacent pair from the original linear sequence.

Common mistake avoided. Keeping all nine concatenated observations would calculate a statistic for the wrong sample size. Truncation is part of the stated procedure.

Worked Example: A Circular Block That Crosses the Seam

Consider the ordered values \(1,2,4,3,5,6\), with \(n=6\). A circular-block bootstrap uses length \(\ell=3\) and selects starts 5 and 2. Construct the replicate, identify any seam transition, and calculate the sample mean.

Method. The block starting at 5 wraps around the end of the sequence: \((5,6,1)\). The block starting at 2 is \((2,4,3)\). Concatenating gives the six-value replicate \((5,6,1,2,4,3)\), so no truncation is needed.

The sum is \(5+6+1+2+4+3=21\), and the mean is \(21/6=3.5\). Within the first block, \(5\to6\) is an original linear adjacency, whereas \(6\to1\) is a circular seam transition, not an adjacency in the observed linear sequence. Within the second block, \(2\to4\) and \(4\to3\) are original linear adjacencies. The transition \(1\to2\) is a join between sampled blocks.

Common mistake avoided. A circular block has \(\ell-1\) within-block transitions, but not all of them must be original linear adjacencies. The seam transition must be distinguished from transitions that were observed next to each other in the original sequence.

Counting Transitions in a Finite Sample

A transition is a pair of consecutive values in the resampled sequence. Within a moving block, each transition is an original linear adjacency. A join between blocks is not guaranteed to be one. In a circular block, a within-block transition that crosses from \(X_n\) to \(X_1\) is also not an original linear adjacency.

For a moving-block replicate with \(K=\lceil n/\ell\rceil\) selected blocks, write the block lengths after truncation as \(b_1,\ldots,b_K\), where each \(b_j\) is at most \(\ell\) and \(\sum_{j=1}^K b_j=n\). The number of within-block transitions is \(\sum_{j=1}^K(b_j-1)=n-K\). The resampled sequence has \(n-1\) adjacent pairs in total, so the fraction that are within-block transitions is \((n-K)/(n-1)\). This counts within-block positions; it does not imply that block joins retain dependence.

Finite-sample count: For a moving-block replicate made from \(K=\lceil n/\ell\rceil\) blocks, with the last block truncated if needed, the within-block transition fraction is \((n-K)/(n-1)\). When \(n\) is divisible by \(\ell\), this is \(((n/\ell)(\ell-1))/(n-1)\). The ratio \((\ell-1)/\ell\) is instead an idealized long-sequence fraction for complete blocks; it is not generally the exact finite-sample fraction.

For example, if \(n=4\) and \(\ell=2\), then \(K=2\). There are \(4-2=2\) within-block transitions among the \(4-1=3\) adjacent pairs, giving a fraction of \(2/3\), not \(1/2\). In the circular-block bootstrap, the same count \(n-K\) gives the number of within-block positions, but some may be seam transitions rather than observed linear adjacencies.

Why Blocks Can Preserve Information About Dependence

For a stationary sequence with mean \(\mu\), let \(\gamma_h=\operatorname{Cov}(X_t,X_{t+h})\) be the autocovariance at lag \(h\). The variance of the sample mean \(\bar X=n^{-1}\sum_{t=1}^n X_t\) is

$$ \operatorname{Var}(\bar X) =\frac{1}{n^2}\left(n\gamma_0+2\sum_{h=1}^{n-1}(n-h)\gamma_h\right) =\frac{1}{n}\left(\gamma_0+2\sum_{h=1}^{n-1}\left(1-\frac{h}{n}\right)\gamma_h\right). $$

The first equality follows by expanding the variance of a sum: the \(n\) individual variances contribute \(n\gamma_0\), and each lag-\(h\) covariance occurs in \(n-h\) pairs in each order. This explains why dependence matters. The variance of the mean is affected by covariances at nonzero lags, not just by the marginal variance \(\gamma_0\).

An independent resampling of individual values discards their observed consecutive pairings. Block resampling retains consecutive pairings inside selected blocks, allowing the bootstrap replicates to reflect some short-lag dependence. A block of length \(\ell\) cannot retain an observed lag-\(h\) pair when \(h\geq\ell\), and joins between blocks may add transitions that were not observed together. Thus blocks provide an approximation, not an exact reconstruction of the sequence’s dependence structure.

Worked Example: Comparing Finite Transition Fractions

A risk analyst has an ordered sequence of \(n=6\) daily observations and is comparing moving-block lengths \(\ell=2\) and \(\ell=3\). For each choice, find the number of sampled blocks and the fraction of the five resampled adjacent pairs that fall within blocks.

Method. With \(\ell=2\), the number of blocks is \(K=\lceil6/2\rceil=3\). The number of within-block transitions is \(n-K=6-3=3\), so the fraction is \(3/5=0.6\). In fact, three complete blocks contribute one transition each.

With \(\ell=3\), \(K=\lceil6/3\rceil=2\). There are \(6-2=4\) within-block transitions, giving \(4/5=0.8\). Both choices produce six observations and five adjacent pairs; the longer blocks yield more within-block positions in this finite replicate.

Common mistake avoided. Applying the idealized ratio \((\ell-1)/\ell\) would give \(1/2\) and \(2/3\), respectively. Those are not the exact finite-sample fractions here. The exact values account for the total of five adjacent pairs in the resampled sequence.

Choosing a Block Length

The block length \(\ell\) controls a bias-variance tradeoff in the bootstrap approximation. If \(\ell\) is too short, important local patterns may be broken frequently. At \(\ell=1\), every block contains a single observation, so the procedure reduces to the ordinary individual-observation bootstrap and preserves no within-block transitions. If \(\ell\) is longer, more observed local structure can remain intact, but fewer blocks contribute to each resample. That can make the bootstrap replicates less varied and can leave fewer distinct blocks available.

In standard large-sample arguments for block bootstrap methods, conditions typically require the block length to increase with \(n\) while remaining small relative to \(n\): \(\ell\to\infty\) and \(\ell/n\to0\). These conditions express competing needs: blocks must eventually be long enough to retain increasingly extended local dependence, yet many blocks must still fit into a sample. Formal validity also requires assumptions on the sequence’s dependence and moment behavior; the block-length conditions alone do not establish validity for every process or statistic.

For a finite data set, the analyst must balance the observed dependence scale against the number of blocks and the purpose of the statistic. A sequence with persistent dependence may need longer blocks than one whose dependence fades quickly. Sensitivity checks across plausible block lengths can reveal whether an uncertainty estimate depends heavily on this choice. Circular blocks reduce the restriction on starting positions, but their seam transitions can be questionable when the beginning and end of the observed sequence are not naturally connected.

  • Too short: the resamples may break dependence at scales relevant to the statistic.
  • Too long: fewer sampled blocks can make resampling variability harder to represent.
  • Boundary awareness: moving-block joins are new joins; circular blocks can also contain a seam transition.
  • Interpretation: block bootstrap uncertainty is an approximation conditional on the observed sequence and the assumptions supporting resampling.
Key takeaway: Use blocks because the sequence is dependent, count finite-sample transitions rather than substituting an idealized ratio, and choose \(\ell\) with both dependence preservation and the number of available blocks in mind. This tutorial is aligned with the SOA Exam SRM (Statistics for Risk Modeling) syllabus.

Check Your Understanding

For each problem, distinguish within-block transitions from joins and, where relevant, circular seam transitions.

  1. A moving-block bootstrap has \(n=9\) and \(\ell=3\). How many blocks are concatenated, and what fraction of the eight resampled adjacent pairs are within blocks? (Answer: \(K=3\); \(6/8=0.75\).)
  2. A moving-block bootstrap has \(n=7\) and \(\ell=3\), so the final block is truncated. How many within-block transitions are there, and what fraction of the six resampled adjacent pairs is this? (Answer: \(K=3\); \(7-3=4\) transitions; \(4/6=2/3\).)
  3. For the sequence \((2,5,4,7,3)\), a circular block of length 3 starts at position 4. Write the block and identify its seam transition, if any. (Answer: \((7,3,2)\); \(3\to2\) crosses the circular seam and is not an original linear adjacency.)
  4. A circular-block replicate has \(n=6\), \(\ell=2\), and three sampled blocks. How many within-block transition positions are present? Can all of them be assumed to be observed linear adjacencies? (Answer: \(6-3=3\); no, any block crossing \(X_n\to X_1\) contains a seam transition.)
  5. An analyst uses \(\ell=1\) for a strongly correlated sequence and claims the bootstrap preserves consecutive dependence because each resample has length \(n\). What is the error, and how many within-block transitions does this choice retain? (Answer: length \(n\) alone does not preserve order; \(\ell=1\) retains zero within-block transitions and reduces to individual-observation resampling.)
Clinical Biostats