Skip to main content

Part of the book series: Springer Series in Statistics ((SSS))

Abstract

Our main concern in the previous chapter has been the numbers and locations of upcrossings of high levels, and the relations between the upcrossings of several adjacent levels.For instance, we know from Theorem 9.3.2 and relation (9.2.3) that for a standard normal process each upcrossing of the high level u = uτ; with a probability p = τ*/τ is accompanied by an upcrossing also of the level

$$u_{\tau * } = u - \frac{{\log p}} {u},$$

asymptotically independently of all other upcrossings of u τ, and uτ*.

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

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

© 1983 Springer-Verlag New York Inc.

About this chapter

Cite this chapter

Leadbetter, M.R., Lindgren, G., Rootzén, H. (1983). Sample Path Properties at Upcrossings. In: Extremes and Related Properties of Random Sequences and Processes. Springer Series in Statistics. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-5449-2_10

Download citation

  • DOI: https://doi.org/10.1007/978-1-4612-5449-2_10

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4612-5451-5

  • Online ISBN: 978-1-4612-5449-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics