Skip to main content

Ergodic Theory: Basic Results

  • Chapter
Stochastic Networks and Queues

Part of the book series: Applications of Mathematics ((SMAP,volume 52))

  • 855 Accesses

Abstract

In this chapter definitions and basic results of ergodic theory are presented in a probabilistic setting. It must be stressed that this is a fundamental topic in probability theory. Results proved in this chapter are classical in a Markovian framework (ergodic theorems, representations of the invariant probability,...). It is nevertheless very helpful to realize that the Markov property does not really play a role to get these results: They also hold in a much more general (and natural) setting. As it will be seen in Chapter 11, the study of stationary point processes is quite elementary if a basic construction of ergodic theory is used (the “special flow” defined page 295). Since this subject is not standard in graduate courses on stochastic processes, most of the results are proved. The reference book Cornfeld et al. [13] gives a broader point of view of this domain. In the following (Ω,.ℱ, ℙ) is the probability space of reference.

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

References

  1. J. Neveu, Construction de files d’attente stationnaires, Lecture notes in Control and Information Sciences, 60, Springer Verlag, 1983, pp. 31–41.

    Google Scholar 

  2. A.M. Garsia, A simple proof of E. Hopf’s maximal ergodictheorem,Journal of Mathematics and Mechanics 14 (1965), 381382.

    Google Scholar 

  3. W. Ambrose and S. Kakutani, Structure and continuity of measurable flows, Duke Mathematical Journal 9 (1942), 25–42.

    Article  MathSciNet  MATH  Google Scholar 

  4. H. Totoki, Time changes of flows, Memoirs of the Faculty of Sciences 20 (1966), no. 1, 27–55.

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Robert, P. (2003). Ergodic Theory: Basic Results. In: Stochastic Networks and Queues. Applications of Mathematics, vol 52. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-13052-0_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-13052-0_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-05625-3

  • Online ISBN: 978-3-662-13052-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics