Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 364

The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.

Limit Theorems for the Maximum Term in Stationary Sequences

Open access
Berman, Simeon M.·1964·The Annals of Mathematical Statistics

Abstract

Let $\{X_n, n = 0, \pm 1, \cdots\}$ be a real valued discrete parameter stationary stochastic process on a probability space $(\Omega, \mathscr{F}, P);$ for each $n = 1, 2, \cdots$, let $Z_n = \max (X_1, \cdots, X_n)$. We shall find general conditions under which the random variable $Z_n$ has a limiting distribution function (d.f.) as $n \rightarrow \infty$; that is, there exist sequences $\{a_n\}$ and $\{b_n\}, a_n > 0$, and a proper nondegenerate d.f. $\Phi(x)$ such that \begin{equation*}\tag{1.1}\lim_{n \rightarrow \infty} P\{Z_n \leqq a_nx + b_n\} = \Phi(x)\end{equation*} for each $x$ in the continuity set of $\Phi(x)$. The simplest type of stationary sequence $\{X_n\}$ is one in which the random variables are mutually independent with some common d.f. $F(x)$. In this case, $Z_n$ has the d.f. $F^n(x)$ and (1.1) becomes \begin{equation*}\tag{1.2}\lim_{n \rightarrow \infty} F^n(a_nx + b_n) = \Phi(x).\end{equation*} It is well known that in (1.2) $\Phi(x)$ is of one of exactly three types; necessary and sufficient conditions on $F$ for the validity of (1.2) are also known [9]. The three types are usually called extreme value d.f.'s [10]. Theorem 2.1 gives the limiting d.f. of $Z_n$ in a stationary sequence satisfying a certain condition on the upper tail of the conditional d.f. of $X_1$, given the "past" of sequence: the limiting d.f. is a simple mixture of extreme value d.f.'s of a single type. These are the same kind of d.f.'s found by us [3] to be the limiting d.f.'s of maxima in sequences of exchangeable random variables. The conditions of Theorem 2.1 are specialized to exchangeable and Markov sequences, and Theorem 2.2 extends the methods of Theorem 2.1 to general (not necessarily stationary) Markov sequences. It is shown that stationary Gaussian sequences, except for the trivial case of independent, identically distributed Gaussian random variables, do not obey the requirements of the hypothesis of Theorem 2.1: hence, Sections 3, 4, and 5 are devoted to a detailed study of the maximum in a stationary Gaussian sequence. Theorem 3.1 provides conditions on the rate of convergence of the covariance sequence to 0 which are sufficient for $Z_n$ to have the same extreme value limiting d.f. as in the case of independence, namely, $\exp (-e^{-x})$. The relation of these conditions to the spectral d.f. of the process is also discussed. A weaker condition on the covariance sequence ensures the "relative stability in probability" of $Z_n$ (Theorem 4.1). Theorem 5.1 describes the behavior of $Z_n$ when the spectrum has a discrete component with "not too many large jumps" and a "smooth" continuous component: when properly normalized, $Z_n$ converges in probability to a random variable representing the maximum of the process corresponding to the discrete spectral component. A special case was given by us in [2]. We now summarize some known results used in the sequel. The extreme value d.f.'s are continuous, so that (1.2) holds for all $x$; furthermore, this holds if and only if it holds for all $x$ satisfying $0 < \Phi(x) < 1.$ (1.2) implies that for all such $x$ $0 < F^n (a_nx + b_n) < 1,\quad\text{for all large} n,$ and \begin{equation*}\tag{1.3}\lim_{n \rightarrow \infty} F(a_nx + b_n) = 1.\end{equation*} Let $x_\infty$ be the supremum of all real numbers $x'$ for which $F(x') < 1$; then, for all $x$ satisfying $0 < \Phi(x) < 1$, we have \begin{equation*}\tag{1.4}\lim_{n \rightarrow \infty} a_nx + b_n = x_\infty.\end{equation*} From (1.3), and the asymptotic relation $-\log F \sim (1 - F), F \rightarrow 1$, we see that (1.2) holds if and only if \begin{equation*}\tag{1.5}\lim_{n \rightarrow \infty} n\lbrack 1 - F (a_nx + b_n)\rbrack = -\log \Phi(x).\end{equation*}

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1214/aoms/1177703551

Cites

5 of 5 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 5 references

Cited by

See all 364

Metadata

Authors
Berman, S. M.
Venue
The Annals of Mathematical Statistics
Published
1964-06
Volume
35
Issue
2
Pages
502-516
ISSN
0003-4851 (ISSN-L)
OpenAlex
W1975001483
Cited by
364
References
5
FWCI
6.64
Type
journal article
Language
en
Open access
diamond

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Limit Theorems for the Maximum Term in Stationary Sequences. https://app.cochat.ai/papers/10.1214/aoms/1177703551
The paper
Berman, S. M. (1964). Limit Theorems for the Maximum Term in Stationary Sequences. The Annals of Mathematical Statistics. https://doi.org/10.1214/aoms/1177703551

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.