Namespaces
Variants
Actions

User:Boris Tsirelson/sandbox

From Encyclopedia of Mathematics
Jump to: navigation, search


Monty Hall problem

Introduction

Imagine you are a guest in a TV game show. The host, a certain Mr. Monty Hall, shows you three large doors and tells you that behind one of the doors there is a car while behind the other two there are goats. You want to win the car. He asks you to choose a door. After you have made your choice, he opens another door, revealing a goat. He then asks you whether you want to stay with your initial choice, or switch to the remaining closed door. Would you switch or stay?

The host, naturally, knows in advance which of the three doors hides the car. This means that whatever door you initially choose, he can indeed open a different door and reveal a goat. Stronger still: not only can he do this; you also know he certainly will do this.

The instinctive, but incorrect, answer of almost all newcomers to the problem is: “Stay, since it is equally likely that the car is behind either of the two closed doors”.

However, under very natural assumptions, the good answer is “Switch, since this doubles my chance of winning the car: it goes from one third to two thirds”.

Because of this conflict the Monty Hall problem is often called the Monty Hall paradox.

The key to accepting and understanding the paradox is to realize that the (subjective) probabilities relevant for the decision are not determined by the situation (two doors closed) alone, but also by what is known about the development that led to this situation. In statistical terminology, the data is not an unordered set of two closed doors, but an ordered set, where the ordering corresponds to the roles of the closed doors: the one chosen by you, and the one left un-chosen by the host. We have to model the data-generating mechanism as well as the data.

There are several intuitive arguments why switching is a good stategy. One is the following. The chances are 1 in 3 that the door initially chosen hides the car. When that happens staying is good, it gives the car. Both of the other two doors hide goats; one is revealed by the host, but switching to the other door just gives the other goat. Complementarily to this, the chances are 2 in 3 that the door initially chosen hides a goat. When that happens, staying is not good: it gives a goat. On the other hand, switching certainly does give the car: the host is forced to open the other door hiding a goat, and the remaining closed door is the door hiding the car.

In many repetitions, one third of the times the stayer will win and the switcher will lose; two thirds of the time the stayer will lose and the switcher will win.

The (wrong) intuitive answer “50–50” is often supported by saying that the host has not provided any new information by opening a door and revealing a goat since the contestant knows in advance that at least one of the other two doors hides a goat, and that the host will open that this door or one of those doors as the case may be. The contestant merely gets to know the identity of one of those two. How can this “non-information” change the fact the remaining doors are equally likely to hide the car?

However, precisely the same reasoning can be used against this answer: if indeed the host's action does not give away information about what is behind the closed doors, how can his action increase the winning chances for the door first chosen from 1 in 3 to 1 in 2? The paradox is that while initially doors 1 and 2 were equally likely to hide the car, after the player has chosen door 1 and the host has opened door 3, door 2 is twice as likely as door 1 to hide the car. The paradox (apparent, but not actual, contradiction) holds because it is equally true that initially door 1 had chance 1/3 to hide the car, while after the player has chosen door 1 and the host has opened door 3, door 1 still has chance 1/3 to hide the car.

The Monty Hall problem became internationally famous after its publication vos Savant (1990) in a popular weekly magazine led to a huge controversy in the media. It has been causing endless disputes and arguments since then.

The origins of the problem

The Monty Hall problem, also known as the as the Monty Hall paradox, the three doors problem, the quizmaster problem, and the problem of the car and the goats, was introduced by biostatistician Steve Selvin (1975a) in a letter to the journal The American Statistician. Depending on what assumptions are made, it can be seen as mathematically identical to the Three Prisoners Problem of Martin Gardner (1959a,b). It is named after the stage-name of the actual quizmaster, Monty Halperin (or Halparin) of the long-running 1960's TV show “Let's make a Deal”. Selvin's letter provoked a number of people to write to the author, and he published a second letter in response, Selvin (1975b). One of his correspondents was Monty Hall himself, who pointed out that the formulation of the Monty Hall problem did not correspond with reality: in reality, Monty only occasionally offered a player the option to switch to another door, and he did this depending on whether or not the player had made a good or bad initial choice.

The problem, true to reality or not, became world famous in 1990 with its presentation in the popular weekly column “Ask Marilyn” in Parade magazine. The author Marilyn Vos Savant, was, according to the Guiness Book of Records at the time, the person with the highest IQ in the world. Rewriting in her own words a problem posed to her by a correspondent, Craig Whitaker, vos Savant asked the following:

Suppose you're on a game show, and you're given the choice of three doors: behind one door is a car; behind the others, goats. You pick a door, say No. 1, and the host, who knows what's behind the doors, opens another door, say No. 3, which has a goat. He then says to you, “Do you want to pick door No. 2?” Is it to your advantage to switch your choice?”.

Vos Savant proceded to give a number of simple arguments for the good answer: switch, it doubles your chance of winning the car. One of them was the previously mentioned argument that a stayer wins if and only if a switcher loses. A stayer only wins one third of the time. Hence a switcher only loses one third of the time, and wins two thirds of the time.

Another intuitive reasoning is the following: one could say that when the contestant initially chooses door 1, the host is offering the contestant a choice between his initial choice door 1, or doors 2 and 3 together, and kindly opens one of doors 2 and 3 in advance.

By changing one aspect of the problem, this way of understanding why the contestant indeed should switch may become even more compelling to the reader. Consider the 100-door problem: 99 goats and one car. The player chooses one of the 100 doors. Let's say that he chooses door number 1. The host, who knows the location of the car, one by one opens all 99 of the other doors but one – let's say that he skips door number 38. Would you switch?

The simple solutions often implicitly used a frequentist picture of probability: probability refers to relative frequency in many repetitions. They also do not address the issue of whether the specific door opened by the host is relevant: if the player has initially chosen door 1, could it be that the decision to switch should depend on whether the host opens door 2 or door 3? Intuition says no, but we already saw that naive intuition can be misleading.

These topics are taken up in the next section.

A more refined analysis

Marilyn vos Savant was taken to task by Morgan, Chaganty, Dahiya and Doviak (1991a), in another paper in The American Statistician, for not computing the conditional probability that switching will give the car, given the choice of the player and which door was opened by the host. Possibly with a frequentist view of probability in mind, Morgan et al. took it for granted that the car is hidden uniformly at random behind one of the three doors, but did not assume that the probability that the host would open door 3, rather than door 2, given that player has chosen door 1 and the car is behind door 1, is one half. Vos Savant (1991) responded angrily in a letter to the editor. Further comments were given by Seymann (1991), Bell (1992) and Bhaskara Rao (1992), then (after a long pause) Hogbin and Nijdam (2010), followed by a final response Morgan et al. (2010). This last note incidentally finally revealed Craig Whitaker's original wording of the problem in his letter to vos Savant: “I've worked out two different situations based on whether or not Monty knows what's behind the doors. In one situation it is to your advantage to switch, in the other there is no advantage to switch. What do you think?” (spelling and grammatical errors corrected by RDG).

The solution to be given in this section takes explicit account of which door was opened by the host: door 2 or door 3 – and does so in order to argue that this does not change the answer. This is probably the reason why lay persons on hearing the simple solutions of the previous section, do not see any need whatsoever for further analysis. Having seen that the strategy of “always switching” gives a success rate of 2/3, while “always staying” gives a success rate of 1/3, there seems little point in pondering whether or not the success rate of 2/3 could be improved.

This is mathematically a true fact, given the only probabilistic assumption which we have made (and used) so far: initially all doors are equally likely to hide the car. However, a really short rigorous and intuitive proof of this fact does not seem to exist.

Let's make a more careful analysis, in which a further (natural) assumption will indeed be used. In this section, probability is used its daily-life Bayesian or subjective sense: that is to say, probability statements are supposed to reflect the state of knowledge of one person. That person will be a contestant on the show who initially knows no more than the following: he'll choose a door; the quizmaster (who knows where the car is hidden) will thereupon open a different door revealing a goat and make the offer that the contestant switches to the remaining closed door. The argument will be kept intuitive or informal, however the student of probability theory will be able to convert every step into formal mathematics, if the need is felt to do so.

For our tabula rasa contestant, initially all doors are equally likely to hide the car. Moreover, if he chooses any particular door, and if the car happens to be behind that particular door, then as far as this contestant is concerned, the host is equally likely to open either of the other two doors.

The contestant initially chooses door number 1. Initially, his odds that the car is behind this door are 2 to 1 against: it is two times as likely for him that his choice is wrong as that it is right.

The host opens one of the other two doors, revealing a goat. Let's suppose that for the moment, the contestant doesn't take any notice of which door was opened. Since the host is certain to open a door revealing a goat whether or not the car is behind door 1, the information that an unspecified door is opened revealing a goat cannot change the contestant's odds that the car is indeed behind door 1; they are still 2 to 1 against.

Now here comes the further detail which we will take account of in this solution: the contestant also gets informed which specific door was opened by the host – let's say it was door 3. Does this piece of information influence his odds that the car is behind door 1? No: from the contestant's point of view, the chance that the car is behind door 1 obviously can't depend on whether the host opens door 2 or door 3 – the door numbers are arbitrary, exchangeable.

Therefore, also knowing that the host opened specifically door 3 to reveal a goat, the contestant's odds on the car being behind his initially chosen door 1 still remain 2 to 1 against. He had better switch to door 2.

Explicit computations

Students of probability theory might feel uneasy about the informality (the intuitive nature) of the last argument. Ordinary people's intuition about probability is well known to be often wrong – after all, it is ordinary intuition which makes most people believe there is no point in switching doors! To feel more secure, students of probability theory might consider the mathematical concept of symmetry and use the law of total probability to show how symmetry leads to statistical independence between the events “Car is behind door 1” and “Host opens door 3” when it is given that the contestant chose door 1. Alternatively, they might like to explicitly use Bayes' theorem, in the form known as Bayes' rule: posterior odds equals prior odds times likelihood ratio (aka Bayes factor). They just have to check that under the two competing hypotheses (whether or not the car is behind the door chosen by the contestant, door 1), the fact that it is door 3 (rather than door 2) which gets opened by the host has the same probability 1/2.

Either of these routes can be used to convert the last step of the argument in the previous section into a formal mathematical proof.

An alternative approach is to use symmetry in advance to dispose of the door-numbers. Suppose without loss of generality (since later we will condition on its value anyway) that the contestant's initial choice of door number $X$ is uniformly distributed over the three door numbers $\{1,2,3\}$. Independently of this, the car is hidden behind door $C$, also uniformly at random. Given $X$ and $C$, the host opens door number $H$ uniformly at random from the door numbers different from both $X$ and $C$ (in number, either one or two). Let $Y$ be the remaining closed door, so $(X,H,Y)$ is a random permutation of $(1,2,3)$. By symmetry it is uniformly distributed over the set of six permutations. We know that either $C=X$ or $C=Y$ with probabilities 1/3 and 2/3 respectively. By symmetry, the conditional probability that $C=X$ given the value of $(X,H,Y)$ – one of the six permutations of $(1,2,3)$ – cannot depend on that value and hence the event $\{C=X\}$ is statistically independent of $(X,H,Y)$.

The actual numbers of door chosen and door opened are irrelevant to deciding whether to switch or stay.

Note the use of the trick of symmetrization – randomization over the door initially chosen – in order to simplify the mathematical analysis.

Almost all introductory statistical texts solve the Monty Hall problem by computing the conditional probability that switching will give the car, from first principles. Arguments for the chosen assumptions, and for the chosen approach to solution, are usually lacking. Gill (2011) argues that Monty Hall can be seen as an exercise in the art of statistical model building, and actually allows many different solutions: as one makes more assumptions, the conclusions are stronger but the scope of application becomes smaller; moreover, the meaning and the meaningfulness of the assumptions and of the result are tied to the user's interpretation of probability. The task of the statistician is to present a menu of solutions; the user is the one who should choose according to his resources and wishes. Rosenthal (2005, 2008) is one of the few who at least uses Bayes' rule to make the solution more insightful.

Variations

Many, many variations of the Monty Hall problem have been studied in the enormous literature which has grown up about the problem. The book Rosenhouse (2010) is a good resource, as are also the wikipedia pages on the topic. We just consider two variations here.

The biased host

Morgan et al. (1981)'s main innovation was to allow the host to have a bias to one door or the other. Suppose that when he has a choice between doors 2 and 3, he opens door 3 with probability $q$. The Bayes factor for the hypotheses that the car is or is not behind door 1 therefore becomes $q:1/2$. The prior odds were $1:2$ so the posterior odds become $q:1$. This can be anything between $0:1$ and $1:1$, but whatever it is, it is not unfavourable to switching. A frequentist player who knows that the car has been hidden by a true uniform randomization, but does not know anything about the probabilistic nature of Monty's brain processes with regards to choosing a door to open, should switch anyway. He does not actually know the conditional probability that switching gives him the car, but he does know the unconditional probability is 2/3.

Game theory

In the literature of game theory and mathematical economics, starting with Nalebuff (1987), the Monty Hall problem is treated as a finite two stage two person zero sum game. The car is hidden by the host (in advance), the contestant independently chooses a door. The host opens a door revealing a goat. The contestant is allowed to choose again. The contestant wants to win the car, the host wants to keep it. If we allow the two “game-players” (host, contestant) randomized strategies, then according to von Neumann's minimax theorem, they both have a minimax stategy, and the game has a value say $p$, such that if the contestant uses his minimax strategy, then whatever strategy is used by the host, the contestant will go home with the car with probability at least $p$; while on the other hand, if the host uses his minimax strategy, then whatever strategy is used by the contestant, the contestant will go home with the car with probability at most $p$.

It is not difficult to show, and symmetry is one way to establish this, that the minimax strategy of the host is: hide the car uniformly at random, and open either door with equal chance when there is a choice. The minimax strategy of the contestant is: choose a door uniformly at random and thereafter switch, regardless of the which door is opened by the host.

With his minimax strategy the contestant wins the car with probability $2/3$ exactly, whatever strategy is used by the player. With the host's minimax strategy, the contestant can't do better than $2/3$ (random initial choice and thereafter switch).

A wise player would be recommended to choose a door number in advance, at home, by a fair randomization, and later switch. He'll get the car with probability $2/3$, he cannot do better, and his ego won't be damaged when his initial choice turned out to have been right and yet he switched and lost the car.

References

Bell, W. (1992), Comment on Morgan et al. (1991a), Am. Statist. 46 241.

Bhaskara Rao, M. (1992), Comment on Morgan et al. (1991a), Am. Statist. 46 241–242.

Gardner, M. (1959a), “Mathematical Games” column, Scientific American, October 1959, 180–182. Reprinted in The Second Scientific American Book of Mathematical Puzzles and Diversions.

Gardner, M. (1959b), “Mathematical Games” column, Scientific American, November 1959, p. 188.

Gill, R.D. (2011), The Monty Hall Problem is not a Probability Puzzle – it's a challenge in mathematical modelling, Statistica Neerlandica 65 58–71.

Hogbin, M. and Nijdam, W. (2010), Letter to the editor, Am. Statist. 64 193.

Morgan, J. P., Chaganty, N. R., Dahiya, R. C., and Doviak, M. J. (1991a), Let's make a deal: The player's dilemma, Am. Statist. 45 284–287.

Morgan, J. P., Chaganty, N. R., Dahiya, R. C., and Doviak, M. J. (1991b), Rejoinder to Seymann's comment on “Let's make a deal: the player's dilemma”, Am. Statist. 45 289.

Morgan, J. P., Chaganty, N. R., Dahiya, R. C., and Doviak, M. J. (2010), Response to Hogbin and Nijdam's letter, Am. Statist. 64 193–194.

Nalebuff, B. (1987), Puzzles: Choose a curtain, duel-ity, two point conversions, and more, J. Econ. Perspectives 1 (2) 157–163.

Rosenhouse, J. (2009), The Monty Hall Problem, Oxford University Press.

Rosenthal, J. S. (2005), Struck by Lightning: The Curious World of Probabilities. Harper Collins, Canada.

Rosenthal, J. S. (2008), Monty Hall, Monty Fall, Monty Crawl, Math Horizons 16 5–7. http://probability.ca/jeff/writing/montyfall.pdf

Selvin, S. (1975a), A problem in probability (letter to the editor), Am. Statist. 29 67.

Selvin, S. (1975b), On the Monty Hall problem (letter to the editor), Am. Statist. 29 134.

Seyman, R. G. (1991), Comment on “Let's make a deal: the player's dilemma”, Am. Statist. 64 287–288.

vos Savant, Marilyn (1990), “Ask Marilyn” column, Parade Magazine, 9 September 1990, p.16.

vos Savant, Marilyn (1991), Letter to the editor “Marilyn vos Savant's reply”, Am. Statist. 45 347. With response by Morgan, Chaganty, Dahiya and Doviak, pp. 347-348.

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, and a short note such as this cannot even begin to do 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. Suppose $X := (X_k, k \in{\bf Z})$ is a sequence of random variables on a given probability space $(\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} For the given random sequence $X$, for any positive integer $n$, define the dependence coefficient \begin{equation} \alpha(n) = \alpha(X,n) := \sup_{j \in{\bf Z}} \alpha({\cal F}_{-\infty}^j, {\cal F}_{j + n}^{\infty}). \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) \to0$ 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.)

In the case where the given sequence $X$ is strictly stationary (i.e. its distribution is invariant under a 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} 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.)

In particular, for strictly stationary sequences, the strong mixing ($\alpha$-mixing) condition implies Kolmogorov regularity (a trivial “past tail” $\sigma$-field), which in turn implies “mixing” (in the ergodic-theoretic sense), which in turn implies ergodicity. (None of the converse implications holds.) For further related information, see e.g. [Br, v1, Chapter 2].

Comments on limit theory under $\alpha$-mixing. Under $\alpha$-mixing and other similar conditions (including ones reviewed below), there has been a vast development of limit theory — for example, CLTs, weak invariance principles, laws of the iterated logarithm, almost sure invariance principles, and rates of convergence in the strong law of large numbers. For example, the CLT in [Ro1] evolved through subsequent refinements by several researchers into the following “canonical” form. (For its history and a generously detailed presentation of its proof, see e.g. [Br, v1, Theorems 1.19 and 10.2].)

Theorem 1. Suppose $(X_k, k \in{\bf Z})$ is a strictly stationary sequence of random variables such that $EX_0 = 0$, $EX_0^2 < \infty$, $\sigma_n^2 := ES_n^2 \to\infty$ as $n \to\infty$, and $\alpha(n) \to0$ as $n \to\infty$. Then the following two conditions (A) and (B) are equivalent:

(A) The family of random variables $(S_n^2/\sigma_n^2, n \in{\bf N})$ is uniformly integrable.

(B) $S_n/\sigma_n \Rightarrow N(0,1)$ as $n \to\infty$.

If (the hypothesis and) these two equivalent conditions (A) and (B) hold, then $\sigma_n^2 = n \cdot h(n)$ for some function $h(t),\ t \in(0, \infty)$ which is slowly varying as $t \to\infty$.

Here $S_n := X_1 + X_2 + \dots+ X_n$; and $\Rightarrow$ denotes convergence in distribution. The assumption $ES_n^2 \to\infty$ is needed here in order to avoid trivial $\alpha$-mixing (or even 1-dependent) counterexamples in which a kind of “cancellation” prevents the partial sums $S_n$ from “growing” (in probability) and becoming asymptotically normal.

In the context of Theorem 1, if one wants to obtain asymptotic normality of the partial sums (as in condition (B)) without an explicit uniform integrability assumption on the partial sums (as in condition (A)), then as an alternative, one can impose a combination of assumptions on, say, (i) the (marginal) distribution of $X_0$ and (ii) the rate of decay of the numbers $\alpha(n)$ to 0 (the “mixing rate”). This involves a “trade-off”; the weaker one assumption is, the stronger the other has to be. One such CLT of Ibragimov in 1962 involved such a “trade-off” in which it is assumed that for some $\delta> 0$, $E|X_0|^{2 + \delta} < \infty$ and $\sum_{n=1}^\infty[\alpha(n)]^{\delta/(2 + \delta)} < \infty$. Counterexamples of Davydov in 1973 (with just slightly weaker properties) showed that that result is quite sharp. However, it is not at the exact “borderline”. From a covariance inequality of Rio in 1993 and a CLT (in fact a weak invariance principle) of Doukhan, Massart, and Rio in 1994, it became clear that the “exact borderline” CLTs of this kind have to involve quantiles of the (marginal) distribution of $X_0$ (rather than just moments). For a generously detailed exposition of such CLTs, see [Br, v1, Chapter 10]; and for further related results, see also Rio [Ri].

Under the hypothesis (first sentence) of Theorem 1 (with just finite second moments), there is no mixing rate, no matter how fast (short of $m$-dependence), that can insure that a CLT holds. That was shown in 1983 with two different counterexamples, one by the author and the other by Herrndorf. See [Br, v1&3, Theorem 10.25 and Chapter 31].

Several other classic strong mixing conditions. As indicated above, the terms “$\alpha$-mixing” and “strong mixing condition” (singular) both refer to the condition $\alpha(n) \to0$. (A little caution is in order; in ergodic theory, the term “strong mixing” is often used to refer to the condition of “mixing in the ergodic-theoretic sense”, which is weaker than $\alpha$-mixing as noted earlier.) The term “strong mixing conditions” (plural) can reasonably be thought of as referring to all conditions that are at least as strong as (i.e. that imply) $\alpha$-mixing. In the classical theory, five strong mixing conditions (again, plural) have emerged as the most prominent ones: $\alpha$-mixing itself and four others that will be defined here.

Recall our probability space $(\Omega, {\cal F}, P)$. For any two $\sigma$-fields ${\cal A}$ and ${\cal B} \subset{\cal F}$, define the following four “measures of dependence”: \begin{eqnarray} \phi({\cal A}, {\cal B}) &:= & \sup_{A \in{\cal A}, B \in{\cal B}, P(A) > 0} |P(B|A) - P(B)|; \\ \psi({\cal A}, {\cal B}) &:= & \sup_{A \in{\cal A}, B \in{\cal B}, P(A) > 0, P(B) > 0} |P(B \cap A)/[P(A)P(B)]\thinspace-\thinspace1|; \\ \rho({\cal A}, {\cal B}) &:= & \sup_{f \in{\cal L}^2({\cal A}),\thinspace g \in{\cal L}^2({\cal B})} |{\rm Corr}(f,g)|; \quad{\rm and} \\ \beta({\cal A}, {\cal B}) &:=& \sup\ (1/2) \sum_{i=1}^I \sum_{j=1}^J |P(A_i \cap B_j) - P(A_i)P(B_j)| \end{eqnarray} where the latter supremum is taken over all pairs of finite partitions $(A_1, A_2, \dots, A_I)$ and $(B_1, B_2, \dots, B_J)$ of $\Omega$ such that $A_i \in{\cal A}$ for each $i$ and $B_j \in{\cal B}$ for each $j$. In (6), for a given $\sigma$-field ${\cal D} \subset{\cal F}$, the notation ${\cal L}^2({\cal D})$ refers to the space of (equivalence classes of) square-integrable, ${\cal D}$-measurable random variables.

Now suppose $X := (X_k, k \in{\bf Z})$ is a strictly stationary sequence of random variables on $(\Omega, {\cal F}, P)$. For any positive integer $n$, analogously to (3), define the dependence coefficient \begin{equation} \phi(n) = \phi(X,n) := \phi({\cal F}_{-\infty}^0, {\cal F}_n^{\infty}), \end{equation} and define analogously the dependence coefficients $\psi(n)$, $\rho(n)$, and $\beta(n)$. Each of these four sequences of dependence coefficients is trivially nonincreasing. The (strictly stationary) sequence $X$ is said to be

“$\phi$-mixing” if $\phi(n) \to0$ as $n \to\infty$;

“$\psi$-mixing” if $\psi(n) \to0$ as $n \to\infty$;

“$\rho$-mixing” if $\rho(n) \to0$ as $n \to\infty$; and

“absolutely regular”, or “$\beta$-mixing”, if $\beta(n) \to0$ as $n \to\infty$.

The $\phi$-mixing condition was introduced by Ibragimov in 1959 and was also studied by Cogburn in 1960 . The $\psi$-mixing condition evolved through papers of Blum, Hanson, and Koopmans in 1963 and Philipp in 1969; and (see e.g. [Io]) it was also implicitly present in earlier work of Doeblin in 1940 involving the metric theory of continued fractions. The $\rho$-mixing condition was introduced by Kolmogorov and Rozanov 1960. (The “maximal correlation coefficient” $\rho({\cal A}, {\cal B})$ itself was first studied by Hirschfeld in 1935 in a statistical context that had no particular connection with “stochastic processes”.) The absolute regularity ($\beta$-mixing) condition was introduced by Volkonskii and Rozanov in 1959, and in the ergodic theory literature it is also called the “weak Bernoulli” condition.

For the five measures of dependence in (1) and (4)–(7), one has the following well known inequalities: \begin{eqnarray*} 2\alpha({\cal A}, {\cal B}) \thinspace& \leq\thinspace\beta({\cal A}, {\cal B}) \thinspace\leq\thinspace\phi({\cal A}, {\cal B}) \thinspace\leq\thinspace(1/2) \psi({\cal A}, {\cal B}); \\ 4 \alpha({\cal A}, {\cal B})\thinspace&\leq\thinspace\rho({\cal A}, {\cal B}) \thinspace\leq\thinspace\psi({\cal A}, {\cal B}); \quad{\rm and} \\ \rho({\cal A}, {\cal B}) \thinspace&\leq\thinspace2 [\phi({\cal A}, {\cal B})]^{1/2} [\phi({\cal B}, {\cal A})]^{1/2} \thinspace\leq\thinspace2 [\phi({\cal A}, {\cal B})]^{1/2}. \end{eqnarray*} For a history and proof of these inequalities, see e.g. [Br, v1, Theorem 3.11]. As a consequence of these inequalities and some well known examples, one has the following “hierarchy” of the five strong mixing conditions here:

(i) $\psi$-mixing implies $\phi$-mixing.

(ii) $\phi$-mixing implies both $\rho$-mixing and $\beta$-mixing (absolute regularity).

(iii) $\rho$-mixing and $\beta$-mixing each imply $\alpha$-mixing (strong mixing).

(iv) Aside from “transitivity”, there are in general no other implications between these five mixing conditions. In particular, neither of the conditions $\rho$-mixing and $\beta$-mixing implies the other.

For all of these mixing conditions, the “mixing rates” can be essentially arbitrary, and in particular, arbitrarily slow. That general principle was established by Kesten and O'Brien in 1976 with several classes of examples. For further details, see e.g. [Br, v3, Chapter 26].

The various strong mixing conditions above have been used extensively in statistical inference for weakly dependent data. See e.g. [DDLLLP], [DMS], [Ro3], or [Žu].

Ibragimov's conjecture and related material. Suppose (as in Theorem 1) $X := (X_k, k \in{\bf Z})$ is a strictly stationary sequence of random variables such that $$ EX_0 = 0,\ \ EX_0^2 < \infty,\ \ {\rm and}\ \ ES_n^2 \to\infty\ {\rm as}\ n \to\infty. \eqno(9) $$

In the 1960s, I.A. Ibragimov conjectured that under these assumptions, if also $X$ is $\phi$-mixing, then a CLT holds. Technically, this conjecture remains unsolved. Peligrad showed in 1985 that it holds under the stronger “growth” assumption $\liminf_{n \to\infty} n^{-1} ES_n^2 > 0$. (See e.g. [Br, v2, Theorem 17.7].)

Under (9) and $\rho$-mixing (which is weaker than $\phi$-mixing), a CLT need not hold (see [Br, v3, Chapter 34] for counterexamples). However, if one also imposes either the stronger moment condition $E|X_0|^{2 + \delta} < \infty$ for some $\delta> 0$, or else the “logarithmic” mixing rate assumption $\sum_{n=1}^\infty\rho(2^n) < \infty$, then a CLT does hold (results of Ibragimov in 1975). For further limit theory under $\rho$-mixing, see e.g. [LL] or [Br, v1, Chapter 11].

Under (9) and an “interlaced” variant of the $\rho$-mixing condition (i.e. with the two index sets allowed to be “interlaced” instead of just “past” and “future”), a CLT does hold. For this and related material, see e.g. [Br, v1, Sections 11.18-11.28].

There is a vast literature on central limit theory for random fields satisfying various strong mixing conditions. See e.g. [Ro3], [Žu], [Do], and [Br, v3]. In the formulation of mixing conditions for random fields — and also “interlaced” mixing conditions for random sequences — some caution is needed; see e.g. [Br, v1&3, Theorems 5.11, 5.13, 29.9, and 29.12].

Connections with specific types of models. Now let us return briefly to a theme from the beginning of this write-up: the connection between strong mixing conditions and specific structures.

Markov chains. Suppose $X := (X_k, k \in{\bf Z})$ is a strictly stationary Markov chain. In the case where $X$ has finite state space and is irreducible and aperiodic, it is $\psi$-mixing, with at least exponentially fast mixing rate. In the case where $X$ has countable (but not necessarily finite) state space and is irreducible and aperiodic, it satisfies $\beta$-mixing, but the mixing rate can be arbitrarily slow. In the case where $X$ has (say) real (but not necessarily countable) state space, (i) Harris recurrence and “aperiodicity” (suitably defined) together are equivalent to $\beta$-mixing, (ii) the “geometric ergodicity” condition is equivalent to $\beta$-mixing with at least exponentially fast mixing rate, and (iii) one particular version of “Doeblin's condition” is equivalent to $\phi$-mixing (and the mixing rate will then be at least exponentially fast). There exist strictly stationary, countable-state Markov chains that are $\phi$-mixing but not “time reversed” $\phi$-mixing (note the asymmetry in the definition of $\phi({\cal A}, {\cal B})$ in (4)). For this and other information on strong mixing conditions for Markov chains, see e.g. [Ro2, Chapter 7], [Do], [MT], and [Br, v1&2, Chapters 7 and 21].

Stationary Gaussian sequences. For stationary Gaussian sequences $X := (X_k, k \in{\bf Z})$, Ibragimov and Rozanov [IR] give characterizations of various strong mixing conditions in terms of properties of spectral density functions. Here are just a couple of comments: For stationary Gaussian sequences, the $\alpha$- and $\rho$-mixing conditions are equivalent to each other, and the $\phi$- and $\psi$-mixing conditions are each equivalent to $m$-dependence. If a stationary Gaussian sequence has a continuous positive spectral density function, then it is $\rho$-mixing. For some further closely related information on stationary Gaussian sequences, see also [Br, v1&3, Chapters 9 and 27].

Dynamical systems. Many dynamical systems have strong mixing properties. Certain one-dimensional “Gibbs states” processes are $\psi$-mixing with at least exponentially fast mixing rate. A well known standard “continued fraction” process is $\psi$-mixing with at least exponentially fast mixing rate (see [Io]). For certain stationary finite-state stochastic processes built on piecewise expanding mappings of the unit interval onto itself, the absolute regularity condition holds with at least exponentially fast mixing rate. For more detains on the mixing properties of these and other dynamical systems, see e.g. Denker [De].

Linear and related processes. There is a large literature on strong mixing properties of strictly stationary linear processes (including strictly stationary ARMA processes and also “non-causal” linear processes and linear random fields) and also of some other related processes such as bilinear, ARCH, or GARCH models. For details on strong mixing properties of these and other related processes, see e.g. Doukhan [Do, Chapter 2].

However, many strictly stationary linear processes fail to be $\alpha$-mixing. A well known classic example is the strictly stationary AR(1) process (autoregressive process of order 1) $X := (X_k, k \in{\bf Z})$ of the form $X_k = (1/2)X_{k-1} + \xi_k$ where $(\xi_k, k \in{\bf Z})$ is a sequence of independent, identically distributed random variables, each taking the values 0 and 1 with probability 1/2 each. It has long been well known that this random sequence $X$ is not $\alpha$-mixing. For more on this example, see e.g. [Br, v1, Example 2.15] or [Do, Section 2.3.1].

Further related developments. The AR(1) example spelled out above, together with many other examples that are not $\alpha$-mixing but seem to have some similar “weak dependence” quality, have motivated the development of more general conditions of weak dependence that have the “spirit” of, and most of the advantages of, strong mixing conditions, but are less restrictive, i.e. applicable to a much broader class of models (including the AR(1) example above). There is a substantial development of central limit theory for strictly stationary sequences under weak dependence assumptions explicitly involving characteristic functions in connection with “block sums”; much of that theory is codified in [Ja]. There is a substantial development of limit theory of various kinds under weak dependence assumptions that involve covariances of certain multivariate Lipschitz functions of random variables from the “past” and “future” (in the spirit of, but much less restrictive than, say, the dependence coefficient $\rho(n)$ defined analogously to (3) and (8)); see e.g. [DDLLLP]. There is a substantial development of limit theory under weak dependence assumptions that involve dependence coefficients similar to $\alpha(n)$ in (3) but in which the classes of events are restricted to intersections of finitely many events of the form $\{X_k > c\}$ for appropriate indices $k$ and appropriate real numbers $c$; for the use of such conditions in extreme value theory, see e.g. [LLR]. In recent years, there has been a considerable development of central limit theory under “projective” criteria related to martingale theory (motivated by Gordin's martingale-approximation technique — see [HH]); for details, see e.g. [Pe]. There are far too many other types of weak dependence conditions, of the general spirit of strong mixing conditions but less restrictive, to describe here; for more details, see e.g. [DDLLLP] or [Br, v1, Chapter 13].

References

[Br] R.C. Bradley. Introduction to Strong Mixing Conditions, Vols. 1, 2, and 3. Kendrick Press, Heber City (Utah), 2007.

[DDLLLP] J. Dedecker, P. Doukhan, G. Lang, J.R. León, S. Louhichi, and C. Prieur. Weak Dependence: Models, Theory, and Applications. Lecture Notes in Statistics 190. Springer-Verlag, New York, 2007.

[DMS] H. Dehling, T. Mikosch, and M. Sørensen, eds. Empirical Process Techniques for Dependent Data. Birkhäuser, Boston, 2002.

[De] M. Denker. The central limit theorem for dynamical systems. In: Dynamical Systems and Ergodic Theory, (K. Krzyzewski, ed.), pp. 33-62. Banach Center Publications, Polish Scientific Publishers, Warsaw, 1989.

[Do] P. Doukhan. Mixing: Properties and Examples. Springer-Verlag, New York, 1995.

[HH] P. Hall and C.C. Heyde. Martingale Limit Theory and its Application. Academic Press, San Diego, 1980.

[IR] I.A. Ibragimov and Yu.A. Rozanov. Gaussian Random Processes. Springer-Verlag, New York, 1978.

[Io] M. Iosifescu. Doeblin and the metric theory of continued fractions: a functional theoretic solution to Gauss' 1812 problem. In: Doeblin and Modern Probability, (H. Cohn, ed.), pp. 97-110. Contemporary Mathematics 149, American Mathematical Society, Providence, 1993.

[Ja] A. Jakubowski. Asymptotic Independent Representations for Sums and Order Statistics of Stationary Sequences. Uniwersytet Mikołaja Kopernika, Toruń, Poland, 1991.

[LL] Z. Lin and C. Lu. Limit Theory for Mixing Dependent Random Variables. Kluwer Academic Publishers, Boston, 1996.

[LLR] M.R. Leadbetter, G. Lindgren, and H. Rootzén. Extremes and Related Properties of Random Sequences and Processes. Springer-Verlag, New York, 1983.

[MT] S.P. Meyn and R.L. Tweedie. Markov Chains and Stochastic Stability (3rd printing). Springer-Verlag, New York, 1996.

[Pe] M. Peligrad. Conditional central limit theorem via martingale approximation. In: Dependence in Probability, Analysis and Number Theory, (I. Berkes, R.C. Bradley, H. Dehling, M. Peligrad, and R. Tichy, eds.), pp. 295-309. Kendrick Press, Heber City (Utah), 2010.

[Ri] E. Rio. Théorie Asymptotique des Processus Aléatoires Faiblement Dépendants.

Mathématiques & Applications 31. Springer, Paris, 2000.

[Ro1] M. Rosenblatt. A central limit theorem and a strong mixing condition. Proc. Natl. Acad. Sci. USA 42 (1956) 43-47.

[Ro2] M. Rosenblatt. Markov Processes, Structure and Asymptotic Behavior. Springer-Verlag, New York, 1971.

[Ro3] M. Rosenblatt. Stationary Sequences and Random Fields. Birkhäuser, Boston, 1985.

[Žu] I.G. Žurbenko. The Spectral Analysis of Time Series. North-Holland, Amsterdam, 1986.

How to Cite This Entry:
Boris Tsirelson/sandbox. Encyclopedia of Mathematics. URL: http://encyclopediaofmath.org/index.php?title=Boris_Tsirelson/sandbox&oldid=30064