Choose your reading route
eduKateSG · Why Mathematics? · Regeneration-Based Bootstrap: Markov Cycles and Renewal Rewards
Start with the question, audit the worked example, or jump to the assumptions and practice. Every chapter stays open for uninterrupted reading.
Understand the question
Define the quantity and follow the mechanism.Route 2 · Chapters 8–14
Reproduce the example
Audit the numbers one step at a time.Route 3 · Chapters 15–21
Check assumptions
See where design and calibration matter.Route 4 · Chapters 22–28
Explore applications
Connect the method to a concrete investigation.Route 5 · Chapters 29–34
Study and verify
Practise, inspect failure cases and read further.
Full chapter index · Practice and checking · Mathematics Learning Hub
Why is mathematics important when observations come from a Markov chain and independence appears only after special return points? Regeneration-based bootstrap divides the chain into cycles between visits to an atom, then resamples whole cycles. The cycle boundaries create renewal units that can be treated much like independent blocks.
Did You Know? Regeneration cycles have random lengths. Resampling a fixed number of cycles therefore produces a random total number of observations, and the stopping rule becomes part of the method.
Full chapter index
Chapters 1–7 · Understand the question
Chapters 8–14 · Reproduce the example
Chapters 15–21 · Check assumptions
Chapters 22–28 · Explore applications
Chapters 29–34 · Study and verify
A Markov chain carries its current state into the next transition. Row resampling destroys that dependence, while arbitrary fixed blocks may cut cycles at scientifically meaningful states.
Datta studied a bootstrap that breaks a Markov chain into cycles at an atom and resamples those cycles, proving accuracy for sums and means under conditions. Read the journal abstract.
An atom is a state or set from which the next-step law resets in the required sense. Successive returns define cycles whose interiors remain dependent but whose cycles can have renewal structure.
For states A,B,A,C,C,A,B,A, visits to A at positions 1,3,6,8 define complete cycles (A,B), (A,C,C) and (A,B), with endpoint convention stated.
| States | Complete cycles |
|---|---|
| A,B,A,C,C,A,B,A | (A,B); (A,C,C); (A,B) |
Drawing cycle labels (2,1,2) concatenates (A,C,C),(A,B),(A,C,C), producing lengths 3+2+3=8 observations.
| Labels | Lengths | Total |
|---|---|---|
| 2,1,2 | 3,2,3 | 8 |
Cycle durations vary with the chain. Long cycles can dominate sums and create heavy-tailed renewal rewards, so moment conditions matter.
The segment before the first regeneration and after the last may be incomplete. Common procedures discard or treat them separately; silently including them can break cycle exchangeability.
For estimating a mean, each cycle has a reward sum and duration. The long-run mean is related to expected reward divided by expected duration, not the unweighted average of cycle means.
If cycle sums are 4,9,5 and lengths 2,3,2, total mean is (4+9+5)/(2+3+2)=18/7≈2.571, not mean(2,3,2.5)=2.5.
One bootstrap can draw the observed number of cycles; another draws until the path reaches length n. Overshoot, truncation and exact-length handling change the law.
If the atom is rarely visited, few long cycles are available. The empirical cycle distribution is then too coarse for reliable tail inference.
Many chains lack an obvious atom. Split-chain or minorisation constructions can create pseudo-regeneration, but require verified conditions and extra randomness.
Regeneration helps handle dependence, yet starting far from stationarity can bias early cycles. Initialisation and burn-in remain relevant.
A queue becoming empty can act as a regenerative state under suitable arrival and service assumptions. Busy cycles then become natural resampling units.
A repaired system returning to an as-good-as-new state may define cycles. Imperfect repair violates the regeneration claim.
Fixed blocks use a chosen length unrelated to states. Regeneration cycles have random lengths defined by the process’s renewal structure.
Stationary bootstrap uses geometrically distributed block lengths by design. Regeneration uses observed return-cycle lengths arising from the chain.
Cycles behave like clusters for resampling, but their boundaries and lengths are stochastic consequences of a Markov process.
Count complete cycles, inspect length and reward tails, verify return states, compare transition behaviour and test sensitivity to initial and terminal fragments.
Simulate known chains, compare coverage across return probabilities, test stopping rules, include rare atoms and benchmark with analytic Markov-chain variance.
The method fails without genuine or justified pseudo-regeneration, enough cycles, required moments, stable transitions or correct treatment of incomplete fragments.
List cycle ID, start, end, length, reward and completeness. Keep a separate table for bootstrap cycle labels, cumulative length and any truncation.
Parse visits to the atom, unit-test the three cycles, resampled length 8 and reward mean 18/7. Save endpoint, stopping and fragment conventions.
Regeneration supports queueing, reliability, simulation output and MCMC theory. Careers require stochastic processes, renewal theory and careful systems modelling.
Simulate two-state chains with common and rare returns, compare cycle bootstrap and fixed blocks, and measure coverage as complete-cycle count changes.
Every recurring state is not automatically an atom, cycle means should not be averaged without duration logic, and exact-length truncation is not innocuous.
CHAPTER 27 OF 34 · Explore applications
27. Connection to recent mathematics articles
The stationary-bootstrap guide explains designed random blocks. The cluster-bootstrap guide explains whole-group units.
Students should mark cycles on a short state sequence and calculate a reward-per-time mean. Parents can ask what event truly resets the process and how many cycles were observed.
- Mark regeneration positions.
- List complete cycles.
- Build the resampled path.
- Calculate 18/7.
- Explain fragments.
### What is resampled? Complete regeneration cycles.
### Are cycle lengths fixed? No.
### Is any repeated state an atom? No.
### Why use rewards and durations? Long-run means weight time, not cycles equally.
Report chain, atom or minorisation, cycle convention, complete-cycle count, length and reward distributions, fragments, stopping rule, B, seed, moments and validation.
Long-run averages depend on total reward divided by total cycle duration. Resampling cycles preserves the paired reward-duration structure needed for this ratio.
Confirm a valid atom, complete-cycle extraction, adequate cycle count, paired rewards and durations, transparent stopping, fragment handling and comparison with known-chain simulations.
Continue through the Mathematics Learning Hub. Rebuild one block, taper, local-neighbour or regeneration calculation by hand before trusting automated output.
Extended practice laboratory
Practice case 1: Identify atom
Setup: Start from the article’s regeneration-bootstrap mechanism for case 1. Task: Change the named quantity, recompute the dependent result and compare with the original.
Check: Preserve the dependence unit, verify the weight, window or cycle identity, and state one diagnostic before interpretation. Record the units and compare with one defensible alternative. Show the arithmetic, name the response and predictor units, and separate the numerical result from the claim it supports. Then vary one defensible assumption, calculate again and explain whether the conclusion changed because of the data, the fitted model or the validation purpose. Finish with one compact table or graph that could reveal a failure hidden by the summary.
Practice case 2: Mark visits
Setup: Start from the article’s regeneration-bootstrap mechanism for case 2. Task: Change the named quantity, recompute the dependent result and compare with the original.
Check: Preserve the dependence unit, verify the weight, window or cycle identity, and state one diagnostic before interpretation. Record the units and compare with one defensible alternative. Show the arithmetic, name the response and predictor units, and separate the numerical result from the claim it supports. Then vary one defensible assumption, calculate again and explain whether the conclusion changed because of the data, the fitted model or the validation purpose. Finish with one compact table or graph that could reveal a failure hidden by the summary.
Practice case 3: Extract first cycle
Setup: Start from the article’s regeneration-bootstrap mechanism for case 3. Task: Change the named quantity, recompute the dependent result and compare with the original.
Check: Preserve the dependence unit, verify the weight, window or cycle identity, and state one diagnostic before interpretation. Record the units and compare with one defensible alternative. Show the arithmetic, name the response and predictor units, and separate the numerical result from the claim it supports. Then vary one defensible assumption, calculate again and explain whether the conclusion changed because of the data, the fitted model or the validation purpose. Finish with one compact table or graph that could reveal a failure hidden by the summary.
Practice case 4: Extract all cycles
Setup: Start from the article’s regeneration-bootstrap mechanism for case 4. Task: Change the named quantity, recompute the dependent result and compare with the original.
Check: Preserve the dependence unit, verify the weight, window or cycle identity, and state one diagnostic before interpretation. Record the units and compare with one defensible alternative. Show the arithmetic, name the response and predictor units, and separate the numerical result from the claim it supports. Then vary one defensible assumption, calculate again and explain whether the conclusion changed because of the data, the fitted model or the validation purpose. Finish with one compact table or graph that could reveal a failure hidden by the summary.
Practice case 5: Discard initial fragment
Setup: Start from the article’s regeneration-bootstrap mechanism for case 5. Task: Change the named quantity, recompute the dependent result and compare with the original.
Check: Preserve the dependence unit, verify the weight, window or cycle identity, and state one diagnostic before interpretation. Record the units and compare with one defensible alternative. Show the arithmetic, name the response and predictor units, and separate the numerical result from the claim it supports. Then vary one defensible assumption, calculate again and explain whether the conclusion changed because of the data, the fitted model or the validation purpose. Finish with one compact table or graph that could reveal a failure hidden by the summary.
Practice case 6: Handle terminal fragment
Setup: Start from the article’s regeneration-bootstrap mechanism for case 6. Task: Change the named quantity, recompute the dependent result and compare with the original.
Check: Preserve the dependence unit, verify the weight, window or cycle identity, and state one diagnostic before interpretation. Record the units and compare with one defensible alternative. Show the arithmetic, name the response and predictor units, and separate the numerical result from the claim it supports. Then vary one defensible assumption, calculate again and explain whether the conclusion changed because of the data, the fitted model or the validation purpose. Finish with one compact table or graph that could reveal a failure hidden by the summary.
Practice case 7: List lengths
Setup: Start from the article’s regeneration-bootstrap mechanism for case 7. Task: Change the named quantity, recompute the dependent result and compare with the original.
Check: Preserve the dependence unit, verify the weight, window or cycle identity, and state one diagnostic before interpretation. Record the units and compare with one defensible alternative. Show the arithmetic, name the response and predictor units, and separate the numerical result from the claim it supports. Then vary one defensible assumption, calculate again and explain whether the conclusion changed because of the data, the fitted model or the validation purpose. Finish with one compact table or graph that could reveal a failure hidden by the summary.
Practice case 8: List rewards
Setup: Start from the article’s regeneration-bootstrap mechanism for case 8. Task: Change the named quantity, recompute the dependent result and compare with the original.
Check: Preserve the dependence unit, verify the weight, window or cycle identity, and state one diagnostic before interpretation. Record the units and compare with one defensible alternative. Show the arithmetic, name the response and predictor units, and separate the numerical result from the claim it supports. Then vary one defensible assumption, calculate again and explain whether the conclusion changed because of the data, the fitted model or the validation purpose. Finish with one compact table or graph that could reveal a failure hidden by the summary.
Practice case 9: Draw cycle labels
Setup: Start from the article’s regeneration-bootstrap mechanism for case 9. Task: Change the named quantity, recompute the dependent result and compare with the original.
Check: Preserve the dependence unit, verify the weight, window or cycle identity, and state one diagnostic before interpretation. Record the units and compare with one defensible alternative. Show the arithmetic, name the response and predictor units, and separate the numerical result from the claim it supports. Then vary one defensible assumption, calculate again and explain whether the conclusion changed because of the data, the fitted model or the validation purpose. Finish with one compact table or graph that could reveal a failure hidden by the summary.
Practice case 10: Concatenate cycles
Setup: Start from the article’s regeneration-bootstrap mechanism for case 10. Task: Change the named quantity, recompute the dependent result and compare with the original.
Check: Preserve the dependence unit, verify the weight, window or cycle identity, and state one diagnostic before interpretation. Record the units and compare with one defensible alternative. Show the arithmetic, name the response and predictor units, and separate the numerical result from the claim it supports. Then vary one defensible assumption, calculate again and explain whether the conclusion changed because of the data, the fitted model or the validation purpose. Finish with one compact table or graph that could reveal a failure hidden by the summary.
Practice case 11: Calculate path length
Setup: Start from the article’s regeneration-bootstrap mechanism for case 11. Task: Change the named quantity, recompute the dependent result and compare with the original.
Check: Preserve the dependence unit, verify the weight, window or cycle identity, and state one diagnostic before interpretation. Record the units and compare with one defensible alternative. Show the arithmetic, name the response and predictor units, and separate the numerical result from the claim it supports. Then vary one defensible assumption, calculate again and explain whether the conclusion changed because of the data, the fitted model or the validation purpose. Finish with one compact table or graph that could reveal a failure hidden by the summary.
Practice case 12: Calculate reward mean
Setup: Start from the article’s regeneration-bootstrap mechanism for case 12. Task: Change the named quantity, recompute the dependent result and compare with the original.
Check: Preserve the dependence unit, verify the weight, window or cycle identity, and state one diagnostic before interpretation. Record the units and compare with one defensible alternative. Show the arithmetic, name the response and predictor units, and separate the numerical result from the claim it supports. Then vary one defensible assumption, calculate again and explain whether the conclusion changed because of the data, the fitted model or the validation purpose. Finish with one compact table or graph that could reveal a failure hidden by the summary.
Practice case 13: Change stopping rule
Setup: Start from the article’s regeneration-bootstrap mechanism for case 13. Task: Change the named quantity, recompute the dependent result and compare with the original.
Check: Preserve the dependence unit, verify the weight, window or cycle identity, and state one diagnostic before interpretation. Record the units and compare with one defensible alternative. Show the arithmetic, name the response and predictor units, and separate the numerical result from the claim it supports. Then vary one defensible assumption, calculate again and explain whether the conclusion changed because of the data, the fitted model or the validation purpose. Finish with one compact table or graph that could reveal a failure hidden by the summary.
Practice case 14: Use fixed cycle count
Setup: Start from the article’s regeneration-bootstrap mechanism for case 14. Task: Change the named quantity, recompute the dependent result and compare with the original.
Check: Preserve the dependence unit, verify the weight, window or cycle identity, and state one diagnostic before interpretation. Record the units and compare with one defensible alternative. Show the arithmetic, name the response and predictor units, and separate the numerical result from the claim it supports. Then vary one defensible assumption, calculate again and explain whether the conclusion changed because of the data, the fitted model or the validation purpose. Finish with one compact table or graph that could reveal a failure hidden by the summary.
Practice case 15: Use target length
Setup: Start from the article’s regeneration-bootstrap mechanism for case 15. Task: Change the named quantity, recompute the dependent result and compare with the original.
Check: Preserve the dependence unit, verify the weight, window or cycle identity, and state one diagnostic before interpretation. Record the units and compare with one defensible alternative. Show the arithmetic, name the response and predictor units, and separate the numerical result from the claim it supports. Then vary one defensible assumption, calculate again and explain whether the conclusion changed because of the data, the fitted model or the validation purpose. Finish with one compact table or graph that could reveal a failure hidden by the summary.
Practice case 16: Add rare atom
Setup: Start from the article’s regeneration-bootstrap mechanism for case 16. Task: Change the named quantity, recompute the dependent result and compare with the original.
Check: Preserve the dependence unit, verify the weight, window or cycle identity, and state one diagnostic before interpretation. Record the units and compare with one defensible alternative. Show the arithmetic, name the response and predictor units, and separate the numerical result from the claim it supports. Then vary one defensible assumption, calculate again and explain whether the conclusion changed because of the data, the fitted model or the validation purpose. Finish with one compact table or graph that could reveal a failure hidden by the summary.
Practice case 17: Use queue example
Setup: Start from the article’s regeneration-bootstrap mechanism for case 17. Task: Change the named quantity, recompute the dependent result and compare with the original.
Check: Preserve the dependence unit, verify the weight, window or cycle identity, and state one diagnostic before interpretation. Record the units and compare with one defensible alternative. Show the arithmetic, name the response and predictor units, and separate the numerical result from the claim it supports. Then vary one defensible assumption, calculate again and explain whether the conclusion changed because of the data, the fitted model or the validation purpose. Finish with one compact table or graph that could reveal a failure hidden by the summary.
Practice case 18: Use reliability example
Setup: Start from the article’s regeneration-bootstrap mechanism for case 18. Task: Change the named quantity, recompute the dependent result and compare with the original.
Check: Preserve the dependence unit, verify the weight, window or cycle identity, and state one diagnostic before interpretation. Record the units and compare with one defensible alternative. Show the arithmetic, name the response and predictor units, and separate the numerical result from the claim it supports. Then vary one defensible assumption, calculate again and explain whether the conclusion changed because of the data, the fitted model or the validation purpose. Finish with one compact table or graph that could reveal a failure hidden by the summary.
Practice case 19: Compare fixed blocks
Setup: Start from the article’s regeneration-bootstrap mechanism for case 19. Task: Change the named quantity, recompute the dependent result and compare with the original.
Check: Preserve the dependence unit, verify the weight, window or cycle identity, and state one diagnostic before interpretation. Record the units and compare with one defensible alternative. Show the arithmetic, name the response and predictor units, and separate the numerical result from the claim it supports. Then vary one defensible assumption, calculate again and explain whether the conclusion changed because of the data, the fitted model or the validation purpose. Finish with one compact table or graph that could reveal a failure hidden by the summary.
Practice case 20: Compare stationary bootstrap
Setup: Start from the article’s regeneration-bootstrap mechanism for case 20. Task: Change the named quantity, recompute the dependent result and compare with the original.
Check: Preserve the dependence unit, verify the weight, window or cycle identity, and state one diagnostic before interpretation. Record the units and compare with one defensible alternative. Show the arithmetic, name the response and predictor units, and separate the numerical result from the claim it supports. Then vary one defensible assumption, calculate again and explain whether the conclusion changed because of the data, the fitted model or the validation purpose. Finish with one compact table or graph that could reveal a failure hidden by the summary.
Practice case 21: Increase B
Setup: Start from the article’s regeneration-bootstrap mechanism for case 21. Task: Change the named quantity, recompute the dependent result and compare with the original.
Check: Preserve the dependence unit, verify the weight, window or cycle identity, and state one diagnostic before interpretation. Record the units and compare with one defensible alternative. Show the arithmetic, name the response and predictor units, and separate the numerical result from the claim it supports. Then vary one defensible assumption, calculate again and explain whether the conclusion changed because of the data, the fitted model or the validation purpose. Finish with one compact table or graph that could reveal a failure hidden by the summary.
Practice case 22: Change seed
Setup: Start from the article’s regeneration-bootstrap mechanism for case 22. Task: Change the named quantity, recompute the dependent result and compare with the original.
Check: Preserve the dependence unit, verify the weight, window or cycle identity, and state one diagnostic before interpretation. Record the units and compare with one defensible alternative. Show the arithmetic, name the response and predictor units, and separate the numerical result from the claim it supports. Then vary one defensible assumption, calculate again and explain whether the conclusion changed because of the data, the fitted model or the validation purpose. Finish with one compact table or graph that could reveal a failure hidden by the summary.
Practice case 23: Audit moments
Setup: Start from the article’s regeneration-bootstrap mechanism for case 23. Task: Change the named quantity, recompute the dependent result and compare with the original.
Check: Preserve the dependence unit, verify the weight, window or cycle identity, and state one diagnostic before interpretation. Record the units and compare with one defensible alternative. Show the arithmetic, name the response and predictor units, and separate the numerical result from the claim it supports. Then vary one defensible assumption, calculate again and explain whether the conclusion changed because of the data, the fitted model or the validation purpose. Finish with one compact table or graph that could reveal a failure hidden by the summary.
Practice case 24: Name limits
Setup: Start from the article’s regeneration-bootstrap mechanism for case 24. Task: Change the named quantity, recompute the dependent result and compare with the original.
Check: Preserve the dependence unit, verify the weight, window or cycle identity, and state one diagnostic before interpretation. Record the units and compare with one defensible alternative. Show the arithmetic, name the response and predictor units, and separate the numerical result from the claim it supports. Then vary one defensible assumption, calculate again and explain whether the conclusion changed because of the data, the fitted model or the validation purpose. Finish with one compact table or graph that could reveal a failure hidden by the summary.
Practice case 25: Write conclusion
Setup: Start from the article’s regeneration-bootstrap mechanism for case 25. Task: Change the named quantity, recompute the dependent result and compare with the original.
Check: Preserve the dependence unit, verify the weight, window or cycle identity, and state one diagnostic before interpretation. Record the units and compare with one defensible alternative. Show the arithmetic, name the response and predictor units, and separate the numerical result from the claim it supports. Then vary one defensible assumption, calculate again and explain whether the conclusion changed because of the data, the fitted model or the validation purpose. Finish with one compact table or graph that could reveal a failure hidden by the summary.