Namespaces
Variants
Actions

Difference between revisions of "User:Boris Tsirelson/sandbox"

From Encyclopedia of Mathematics
Jump to: navigation, search
 
(32 intermediate revisions by the same user not shown)
Line 1: Line 1:
  
−
=Strong Mixing Conditions=
 
  
−
:Richard C. Bradley
 
−
:Department of Mathematics, Indiana University, Bloomington, Indiana, USA
 
  
−
There has been much research on stochastic models
 
−
that have a well defined, specific structure — for
 
−
example, Markov chains, Gaussian processes, or
 
−
linear models, including ARMA
 
−
(autoregressive – moving average) models.
 
−
However, it became clear in the middle of the last century
 
−
that there was a need for
 
−
a theory of statistical inference (e.g. central limit
 
−
theory) that could be used in the analysis of time series
 
−
that did not seem to "fit" any such specific structure
 
−
but which did seem to have some "asymptotic
 
−
independence" properties.
 
−
That motivated the development of a broad theory of
 
−
"strong mixing conditions" to handle such situations.
 
−
This note is a brief description of that theory.
 
  
−
The field of strong mixing conditions is a vast area,
+
{{MSC|62E}}
−
and a short note such as this cannot even begin to do
+
{{TEX|done}}
−
justice to it.
 
−
Journal articles (with one exception) will not be cited;
 
−
and many researchers who made important contributions to
 
−
this field will not be mentioned here.
 
−
All that can be done here is to give a narrow snapshot
 
−
of part of the field.
 
  
−
'''The strong mixing ($\alpha$-mixing) condition.'''
+
A
−
Suppose
+
[[Probability distribution|probability distribution]] of a random variable $X$ which takes non-negative integer values, defined by the formula
−
$X := (X_k, k \in {\bf Z})$ is a sequence of
+
\begin{equation}\label{*}
−
random variables on a given probability space
+
P(X=k)=\frac{ {k+m-1 \choose k}{N-m-k \choose M-m} } { {N \choose M} } \tag{*}
−
$(\Omega, {\cal F}, P)$.
 
−
For $-\infty \leq j \leq \ell \leq \infty$, let
 
−
${\cal F}_j^\ell$ denote the $\sigma$-field of events
 
−
generated by the random variables
 
−
$X_k,\ j \le k \leq \ell\ (k \in {\bf Z})$.
 
−
For any two $\sigma$-fields ${\cal A}$ and
 
−
${\cal B} \subset {\cal F}$, define the "measure of
 
−
dependence"
 
−
\begin{equation} \alpha({\cal A}, {\cal B}) :=
 
−
\sup_{A \in {\cal A}, B \in {\cal B}}
 
−
|P(A \cap B) - P(A)P(B)|.
 
 
\end{equation}
 
\end{equation}
−
For the given random sequence $X$, for any positive
+
where the parameters <math>N,M,m</math> are non-negative integers which satisfy the condition <math>m\leq M\leq N</math>. A negative hypergeometric distribution often arises in a scheme of sampling without replacement. If in the total population of size <math>N</math>, there are <math>M</math>  "marked"  and <math>N-M</math>  "unmarked"  elements, and if the sampling (without replacement) is performed until the number of  "marked"  elements reaches a fixed number <math>m</math>, then the random variable <math>X</math> — the number of  "unmarked"  elements in the sample — has a negative hypergeometric distribution \eqref{*}. The random variable <math>X+m</math> — the size of the sample — also has a negative hypergeometric distribution. The distribution \eqref{*} is called a negative hypergeometric distribution by analogy with the
−
integer $n$, define the dependence coefficient
+
[[Negative binomial distribution|negative binomial distribution]], which arises in the same way for sampling with replacement.
−
\begin{equation}\alpha(n) = \alpha(X,n) :=
+
 
−
\sup_{j \in {\bf Z}}
+
The mathematical expectation and variance of a negative hypergeometric distribution are, respectively, equal to
−
\alpha({\cal F}_{-\infty}^j, {\cal F}_{j + n}^{\infty}).
+
 
 +
\begin{equation}
 +
m\frac{N-M} {M+1}
 
\end{equation}
 
\end{equation}
−
By a trivial argument, the sequence of numbers
 
−
$(\alpha(n), n \in {\bf N})$ is nonincreasing.
 
−
The random sequence $X$ is said to be "strongly mixing",
 
−
or "$\alpha$-mixing", if $\alpha(n) \to 0$ as
 
−
$n \to \infty$.
 
−
This condition was introduced in 1956 by Rosenblatt [Ro1],
 
−
and was used in that paper in the proof of a central limit
 
−
theorem.
 
−
(The phrase "central limit theorem" will henceforth
 
−
be abbreviated CLT.)
 
  
 +
and
  
−
In the case where the given sequence $X$ is strictly
+
\begin{equation}
−
stationary (i.e. its distribution is invariant under a
+
m\frac{(N+1)(N-M)} {(M+1)(M+2)}\Big(1-\frac{m}{M+1}\Big) \, .
−
shift of the indices), eq. (2) also has the simpler form
 
−
\begin{equation}\alpha(n) = \alpha(X,n) :=
 
−
\alpha({\cal F}_{-\infty}^0, {\cal F}_n^{\infty}).
 
 
\end{equation}
 
\end{equation}
−
For simplicity, ''in the rest of this note,
 
−
we shall restrict to strictly stationary sequences.''
 
−
(Some comments below will have obvious adaptations to
 
−
nonstationary processes.)
 
  
 +
When <math>N, M, N-M \to \infty</math> such that <math>M/N\to p</math>, the negative hypergeometric distribution tends to the
 +
[[negative binomial distribution]] with parameters <math>m</math> and <math>p</math>.
 +
 +
The distribution function <math>F(n)</math> of the negative hypergeometric function with parameters <math>N,M,m</math> is related to the
 +
[[Hypergeometric distribution|hypergeometric distribution]] <math>G(m)</math> with parameters <math>N,M,n</math> by the relation
 +
\begin{equation}
 +
F(n) = 1-G(m-1) \, .
 +
\end{equation}
 +
This means that in solving problems in mathematical statistics related to negative hypergeometric distributions, tables of hypergeometric distributions can be used. The negative hypergeometric distribution is used, for example, in
 +
[[Statistical quality control|statistical quality control]].
  
−
In particular, for strictly stationary sequences,
+
====References====
−
the strong mixing ($\alpha$-mixing) condition implies Kolmogorov regularity
+
{|
−
(a trivial "past tail" $\sigma$-field),
+
|-
−
which in turn implies "mixing" (in the ergodic-theoretic
+
|valign="top"|{{Ref|Be}}||valign="top"|  Y.K. Belyaev,   "Probability methods of sampling control", Moscow  (1975)  (In Russian) {{MR|0428663}} 
−
sense), which in turn implies ergodicity.
+
|-
−
(None of the converse implications holds.)
+
|valign="top"|{{Ref|BoSm}}||valign="top"|  L.N. Bol'shev,  N.V. Smirnov,   "Tables of mathematical statistics", ''Libr. math. tables'', '''46''', Nauka  (1983)  (In Russian)  (Processed by L.S. Bark and E.S. Kedrova) {{MR|0243650}} {{ZBL|0529.62099}}
−
For further related information, see
+
|-
−
e.g. [Br, v1, Chapter 2].
+
|valign="top"|{{Ref|JoKo}}||valign="top"|  N.L. Johnson,  S. Kotz,   "Distributions in statistics, discrete distributions", Wiley  (1969) {{MR|0268996}} {{ZBL|0292.62009}}
 +
|-
 +
|valign="top"|{{Ref|PaJo}}||valign="top"|  G.P. Patil,   S.W. Joshi,   "A dictionary and bibliography of discrete distributions", Hafner  (1968) {{MR|0282770}}
 +
|-
 +
|}

Latest revision as of 14:46, 5 June 2017



2020 Mathematics Subject Classification: Primary: 62E [MSN][ZBL]


A probability distribution of a random variable $X$ which takes non-negative integer values, defined by the formula \begin{equation}\label{*} P(X=k)=\frac{ {k+m-1 \choose k}{N-m-k \choose M-m} } { {N \choose M} } \tag{*} \end{equation} where the parameters \(N,M,m\) are non-negative integers which satisfy the condition \(m\leq M\leq N\). A negative hypergeometric distribution often arises in a scheme of sampling without replacement. If in the total population of size \(N\), there are \(M\) "marked" and \(N-M\) "unmarked" elements, and if the sampling (without replacement) is performed until the number of "marked" elements reaches a fixed number \(m\), then the random variable \(X\) — the number of "unmarked" elements in the sample — has a negative hypergeometric distribution \eqref{*}. The random variable \(X+m\) — the size of the sample — also has a negative hypergeometric distribution. The distribution \eqref{*} is called a negative hypergeometric distribution by analogy with the negative binomial distribution, which arises in the same way for sampling with replacement.

The mathematical expectation and variance of a negative hypergeometric distribution are, respectively, equal to

\begin{equation} m\frac{N-M} {M+1} \end{equation}

and

\begin{equation} m\frac{(N+1)(N-M)} {(M+1)(M+2)}\Big(1-\frac{m}{M+1}\Big) \, . \end{equation}

When \(N, M, N-M \to \infty\) such that \(M/N\to p\), the negative hypergeometric distribution tends to the negative binomial distribution with parameters \(m\) and \(p\).

The distribution function \(F(n)\) of the negative hypergeometric function with parameters \(N,M,m\) is related to the hypergeometric distribution \(G(m)\) with parameters \(N,M,n\) by the relation \begin{equation} F(n) = 1-G(m-1) \, . \end{equation} This means that in solving problems in mathematical statistics related to negative hypergeometric distributions, tables of hypergeometric distributions can be used. The negative hypergeometric distribution is used, for example, in statistical quality control.

References

[Be] Y.K. Belyaev, "Probability methods of sampling control", Moscow (1975) (In Russian) MR0428663
[BoSm] L.N. Bol'shev, N.V. Smirnov, "Tables of mathematical statistics", Libr. math. tables, 46, Nauka (1983) (In Russian) (Processed by L.S. Bark and E.S. Kedrova) MR0243650 Zbl 0529.62099
[JoKo] N.L. Johnson, S. Kotz, "Distributions in statistics, discrete distributions", Wiley (1969) MR0268996 Zbl 0292.62009
[PaJo] G.P. Patil, S.W. Joshi, "A dictionary and bibliography of discrete distributions", Hafner (1968) MR0282770
How to Cite This Entry:
Boris Tsirelson/sandbox. Encyclopedia of Mathematics. URL: http://encyclopediaofmath.org/index.php?title=Boris_Tsirelson/sandbox&oldid=30034
Retrieved from "https://encyclopediaofmath.org/index.php?title=User:Boris_Tsirelson/sandbox&oldid=41611"