Coupling (probability)

Coupling (probability)

In probability theory, coupling is a proof technique that allows one to compare two unrelated variables by "forcing" them to be related in some way.

Definition

Using the standard formalism of probability, let X1 and X2 be two random variables defined on probability spaces 1,F1,P1) and 2,F2,P2). Then a coupling of X1 and X2 is a new probability space (Ω,F,P) over which there are two random variables Y1 and Y2 such that Y1 has the same distribution as X1 while Y2 has the same distribution as X2.

The interesting case is when Y1 and Y2 are not independent.

Examples

Assume two particles A and B perform a simple random walk in two dimensions, but they start from different points. The simplest way to couple them is simply to force them to walk together. On every step, if A walks up, so does B, if A moves to the left, so does B, etc. Thus, the difference between the two particles stays fixed. As far as A is concerned, it is doing a perfect random walk, while B is the copycat. B holds the opposite view, i.e. that he is, in effect, the original and that A is the copy. And in a sense they both are right. In other words, any mathematical theorem, or result that holds for a regular random walk, will also hold for both A and B.

Consider now a more elaborate example. Assume that A starts from the point (0,0) and B from (10,10). First couple them so that they walk together in the vertical direction, i.e. if A goes up, so does B, etc., but are mirror images in the horizontal direction i.e. if A goes left, B goes right and vice versa. We continue this coupling until A and B have the same horizontal coordinate, or in other words are on the vertical line (5,y). If they never meet, we continue this process forever (the probability for that is zero, though). After this event, we change the coupling rule. We let them walk together in the horizontal direction, but in a mirror image rule in the vertical direction. We continue this rule until they meet in the vertical direction too (if they do), and from that point on, we just let them walk together.

This is a coupling in the sense that neither particle, taken on its own, can feel anything we did. Nor that fact that the other particle follows him in one way or the other, nor the fact that we changed the coupling rule or when we did it. Each particle performs a simple random walk. And yet, our coupling rule forces them to meet almost surely and to continue from that point on together permanently. This allows one to prove many interesting results that say that "in the long run", it is not important where you started.

References

  • T. Lindvall, Lectures on the coupling method. Wiley, New York, 1992.
  • H. Thorisson, Coupling, Stationarity, and Regeneration. Springer, New York, 2000.

Wikimedia Foundation. 2010.

Игры ⚽ Поможем написать курсовую

Look at other dictionaries:

  • Coupling (disambiguation) — Coupling is a connection or joint between two things. Coupling may also refer to: Television Coupling (UK TV series), a British sitcom written by Steven Moffat for the BBC Coupling (U.S. TV series), a short lived American sitcom based on the… …   Wikipedia

  • Coupling from the past — Among Markov chain Monte Carlo (MCMC) algorithms, coupling from the past is a method for sampling from the stationary distribution of a Markov chain. Contrary to many MCMC algorithms, coupling from the past gives in principle a perfect sample… …   Wikipedia

  • Coupling (railway) — Knuckle (AAR Type E ) couplers in use ICE coupler A c …   Wikipedia

  • List of probability topics — This is a list of probability topics, by Wikipedia page. It overlaps with the (alphabetical) list of statistical topics. There are also the list of probabilists and list of statisticians.General aspects*Probability *Randomness, Pseudorandomness,… …   Wikipedia

  • Statistical coupling analysis — or SCA is a technique used in bioinformatics to measure covariation between pairs of amino acids in a protein multiple sequence alignment (MSA). More specifically, it quantifies how much the amino acid distribution at some position i changes upon …   Wikipedia

  • List of mathematics articles (C) — NOTOC C C closed subgroup C minimal theory C normal subgroup C number C semiring C space C symmetry C* algebra C0 semigroup CA group Cabal (set theory) Cabibbo Kobayashi Maskawa matrix Cabinet projection Cable knot Cabri Geometry Cabtaxi number… …   Wikipedia

  • Markov chain mixing time — In probability theory, the mixing time of a Markov chain is the time until the Markov chain is close to its steady state distribution. More precisely, a fundamental result about Markov chains is that a finite state irreducible aperiodic chain has …   Wikipedia

  • Ising model — The Ising model, named after the physicist Ernst Ising, is a mathematical model in statistical mechanics. It has since been used to model diverse phenomena in which bits of information, interacting in pairs, produce collectiveeffects.Definition… …   Wikipedia

  • Mathematical principles of reinforcement — (MPR) are a set of mathematical equations that attempt to describe and predict the most fundamental aspects of behavior. The three key principles of MPR, arousal, constraint, and coupling, describe how incentives motivate responding, how time… …   Wikipedia

  • Marcus theory — is a theory originally developed by Rudolph A. Marcus, starting in 1956, to explain the rates of electron transfer reactions – the rate at which an electron can move or jump from one chemical species (called the electron donor) to another (called …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”