Skip to main content

Part of the book series: Graduate Texts in Mathematics ((GTM,volume 293))

  • 1219 Accesses

Abstract

In the context of stochastic processes, ergodic theory relates the long-run “time-averages” such as the sample mean of an evolving strictly stationary process X 0, X 1, … to a “phase-average” computed as an expected value with respect to a probability distribution on the state space. This is the perspective developed in this chapter.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

eBook
USD 19.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 29.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

Notes

  1. 1.

    This result, which was motivated by considerations of the relationship between “time-averages” and “phase-averages” in statistical physics and dynamical systems, is due to Birkhoff (1931).

  2. 2.

    See BCPT, p. 87.

  3. 3.

    The derivation presented here follows Garcia (1965).

  4. 4.

    See BCPT, p. 17 for this L 1-convergence criteria.

  5. 5.

    Bhattacharya and Waymire (2021), p. 162.

  6. 6.

    An extension of de Finetti’s theorem to exchangeable Markov processes was initiated in Diaconis and Freedman (1980) that is worthy of mention here. Especially see James et al. (2008) for inspiring connections to transient random walk.

  7. 7.

    See BCPT p.4.

  8. 8.

    See BCPT p.168.

  9. 9.

    See Spitzer (1964), p. 38., where the result is attributed to Kesten, H., F. Spitzer, and W. Whitman. This result had been obtained for the k-dimensional simple symmetric random walk in an earlier paper by Dvoretzky and Erdos (1951).

  10. 10.

    See BCPT, p.237.

References

  • Billingsley P (1968) Convergence of probability measures. Wiley, New York

    MATH  Google Scholar 

  • Birkhoff GD (1931) Proof of the ergodic theorem. Proc Natl Acad Sci USA 17(12):656–660

    Article  MATH  Google Scholar 

  • Bradley RC (2003) Introduction to strong mixing conditions, vols 1–3. Indiana University, Bloomington

    Google Scholar 

  • Cogburn R (1960) Asymptotic properties of stationary sequences. Univ Calif Publ Statist 3:99–146

    MathSciNet  MATH  Google Scholar 

  • Denker M (1986) Uniform integrability and uniform integrability for strongly mixing processes. In: Eberlein E, Taqqu MS (eds) Dependence in probability and statistics. Birkhäuser, Boston

    Google Scholar 

  • Diaconis P, Freedman D (1980) de Finetti’s theorem for Markov chains. Ann Probab 115–130

    Google Scholar 

  • Dvoretzky A, Erdos P (1951) Some problems on random walk in space. Proc. 2nd Berkeley Symp. on Math. Stat. and Probab. University of California Press, California, pp 353–367

    Google Scholar 

  • Garcia AM (1965) A Simple Proof of E. Hopf’s Maximal Ergodic Theorem. J Math Mech 14:381–382

    Google Scholar 

  • Rosenblatt M (1956) A central limit theorem and a strong mixing condition. Proc Natl Acad Sci USA 42:43–47

    Article  MathSciNet  MATH  Google Scholar 

  • Ibragimov IA, Linnik Yu V (1971) Independent and stationary sequences of random variables. Wolters-Noordhoff, Groningen

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2022 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Bhattacharya, R., Waymire, E. (2022). Birkhoff’s Ergodic Theorem. In: Stationary Processes and Discrete Parameter Markov Processes. Graduate Texts in Mathematics, vol 293. Springer, Cham. https://doi.org/10.1007/978-3-031-00943-3_4

Download citation

Publish with us

Policies and ethics