Skip to main content
  • 2257 Accesses

Abstract

The basic ergodic theorems are proved showing that asymptotic mean stationarity is a sufficient as well as necessary condition for a random process or dynamical system to have convergent sample averages for all bounded measurements. Conditions are found for the convergence of unbounded sample averages in both the almost everywhere and mean sense. The proof follows the coding-flavored proofs developed in the ergodic theory literature in the 1970s rather than the classical route of the maximal ergodic theorem.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 139.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 179.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 179.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Robert M. Gray .

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag US

About this chapter

Cite this chapter

Gray, R.M. (2009). Ergodic Theorems. In: Probability, Random Processes, and Ergodic Properties. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-1090-5_8

Download citation

  • DOI: https://doi.org/10.1007/978-1-4419-1090-5_8

  • Published:

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4419-1089-9

  • Online ISBN: 978-1-4419-1090-5

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics