Math 2.0

Probability theory and stochastic processes Theorem

Wald's equation

Builds on Independent and identically distributed random variablesStopping timeExpected valueRandom walkSequential analysisOptional stopping theorem

Statement

Let X1,X2,…X_1, X_2, \dots be independent and identically distributed real random variables with E∣X1∣<∞E\abs{X_1} < \infty. Let Sn=X1+⋯+XnS_n = X_1 + \cdots + X_n. Let NN be a stopping time with values in {1,2,… }\set{1, 2, \dots} with respect to the filtration ℱn=σ(X1,…,Xn)\mathcal{F}_n = \sigma(X_1, \dots, X_n), and assume E[N]<∞E[N] < \infty. Then E[SN]=E[N] E[X1],E[S_N] = E[N] \, E[X_1], where EE is the expectation.

Remarks

Write SN=∑i≥1Xi𝟏{N≥i}S_N = \sum_{i \ge 1} X_i \mathbf{1}_{\set{N \ge i}}. The event {N≥i}\set{N \ge i} is the complement of {N≤i−1}\set{N \le i - 1}, so it depends only on X1,…,Xi−1X_1, \dots, X_{i-1} and is independent of XiX_i. Hence E[Xi𝟏{N≥i}]=E[X1] P(N≥i)E[X_i \mathbf{1}_{\set{N \ge i}}] = E[X_1] \, P(N \ge i), and summing over ii gives E[X1]∑iP(N≥i)=E[X1] E[N]E[X_1] \sum_i P(N \ge i) = E[X_1] \, E[N]. The same computation with ∣Xi∣\abs{X_i} shows that the series converges absolutely, which justifies exchanging sum and expectation.

The hypothesis E[N]<∞E[N] < \infty is necessary. For the simple symmetric random walk, with P(Xi=1)=P(Xi=−1)=1/2P(X_i = 1) = P(X_i = -1) = 1/2, let NN be the first nn with Sn=1S_n = 1. Then NN is finite with probability one and SN=1S_N = 1, so E[SN]=1E[S_N] = 1, while E[X1]=0E[X_1] = 0; here E[N]=∞E[N] = \infty.

Going deeper

For a student

Wald's equation is a key tool in sequential analysis, where it gives the expected sample size of the sequential probability ratio test from the drift of the log-likelihood ratio. It is also used in renewal theory and queueing theory. It can also be derived from the optional stopping theorem applied to the martingale Sn−nE[X1]S_n - n E[X_1].

Reading path

To understand this page from the ground up, read these 60 pages in order. The foundations come first.

  1. Adapted process concept
  2. Construction of the reals from Cauchy sequences concept
  3. Convex function definition
  4. Element definition
  5. Expected value concept
  6. Filtration concept
  7. Independent and identically distributed random variables concept
  8. Integers object
  9. Ordered field definition
  10. Proposition concept
  11. Random experiment concept
  12. Random walk concept
  13. Rational numbers object
  14. Real numbers object
  15. Sequential analysis concept
  16. Stopped process concept
  17. Stopping time concept
  18. Jensen's inequality statement
  19. Set definition
  20. Ring of integers statement
  21. Disjunction definition
  22. Implication definition
  23. Predicate definition
  24. Ordered pair definition
  25. Union definition
  26. Existential quantifier definition
  27. Universal quantifier definition
  28. Sample space definition
  29. The rationals form a field statement
  30. Cartesian product definition
  31. Uniqueness quantifier definition
  32. Subset definition
  33. The rationals form an ordered field statement
  34. Binary relation definition
  35. Universal set definition
  36. Order on the reals definition
  37. Power set definition
  38. Function definition
  39. Complement definition
  40. Interval definition
  41. Injective function definition
  42. Preimage of a set definition
  43. Sigma-algebra definition
  44. Countable set definition
  45. Event definition
  46. Borel sigma-algebra definition
  47. Probability axioms concept
  48. Probability measure definition
  49. Probability space definition
  50. Conditional probability definition
  51. Random variable definition
  52. Discrete random variable definition
  53. Stochastic process concept
  54. Random variable with a density definition
  55. Expected value definition
  56. Conditional expectation definition
  57. Martingale definition
  58. Submartingale definition
  59. Optional stopping theorem statement
  60. Wald's equation statement

Further reading

  1. Web https://en.wikipedia.org/wiki/Wald%27s_equation
About this page
TagCTDG4MZC8D
URIm2://CTDG4MZC8D
Kindstatement, theorem
WritingW0 stub
MSC60G50, 62L10, 60G40
StatusThis copy of the site has no build data. Run m2 status CTDG4MZC8D.
AboutStopping time
UsesIndependent and identically distributed random variables, Stopping time, Expected value, Random walk, Sequential analysis, Optional stopping theorem
Same as

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.