A counting process in the max-scheme

DOI10.1090/TPMS/971MaRDI QIDQ2786951zbMATH OpenOpenAlexFDO

Authors I. K. Matsak

Publication date 24 February 2016

Published in Theory of Probability and Mathematical Statistics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1090/tpms/971

zbMATH Keywords

almost sure asymptotic behaviorcounting processindependent random variablesmax-scheme

Mathematics Subject Classification ID

Strong limit theorems (60F15) Extreme value theory; extremal stochastic processes (60G70)

Cites work

• An iterated logarithm law for the maximum in a stationary gaussian sequence
• Asymptotic behavior of a counting process in the maximum scheme
• Extreme value theory. An introduction.
• Extremes and related properties of random sequences and processes
• scientific article; zbMATH DE number 3592801 (Why is no real title available?)
• scientific article; zbMATH DE number 3373676 (Why is no real title available?)
• On the Limit Behaviour of Extreme Order Statistics
• One improvement of the law of the iterated logarithm for the maximum scheme
• Pseudo-regularly varying functions and generalized renewal processes
• Regularly varying functions
• The asymptotic behavior of a counting process in the max-scheme. A discrete case
• The Rate of Growth of Sample Maxima
• The Robbins-Siegmund series criterion for partial maxima

Cited in

(2)

• The asymptotic behavior of a counting process in the max-scheme. A discrete case
• scientific article; zbMATH DE number 3901751 (Why is no real title available?)

This page was built for publication: A counting process in the max-scheme

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2786951)