Skip to main content

Part of the book series: Applied Mathematical Sciences ((AMS,volume 77))

  • 691 Accesses

Abstract

Consider a stationary real-valued process (X n; n≥1) or (Xt; t≥0). Time may be discrete or continuous; the marginal distribution may be discrete or continuous; the process may or may not be Markov. Let

$$ {M_n} = \mathop {\max }\limits_{1 \leqslant j \leqslant n} {X_j};{M_t} = \mathop {\sup }\limits_{0 \leqslant s \leqslant t} {X_s} $$

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

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer Science+Business Media New York

About this chapter

Cite this chapter

Aldous, D. (1989). Extremes of Stationary Processes. In: Probability Approximations via the Poisson Clumping Heuristic. Applied Mathematical Sciences, vol 77. Springer, New York, NY. https://doi.org/10.1007/978-1-4757-6283-9_3

Download citation

  • DOI: https://doi.org/10.1007/978-1-4757-6283-9_3

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4419-3088-0

  • Online ISBN: 978-1-4757-6283-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics