Parry–Daniels map explained

In mathematics, the Parry–Daniels map is a function studied in the context of dynamical systems. Typical questions concern the existence of an invariant or ergodic measure for the map.[1]

It is named after the English mathematician Bill Parry[2] and the British statistician Henry Daniels,[3] who independently studied the map in papers published in 1962.

Definition

Given an integer n ≥ 1, let Σ denote the n-dimensional simplex in Rn+1 given by

\Sigma:=\{x=(x0,x1,...,xn)\inRn|0\leqxi\leq1foreachiandx0+x1+...+xn=1\}.

Let π be a permutation such that

x\pi(0)\leqx\pi\leq...\leqx\pi.

Then the Parry–Daniels map

T\pi:\Sigma\to\Sigma

is defined by

T\pi(x0,x1,...,xn):=\left(

x\pi
x\pi

,

x\pi-x\pi
x\pi

,...,

x\pi-x\pi
x\pi

\right).

Notes and References

  1. Web site: Zweimüller . Roland . Surrey Notes on Infinite Ergodic Theory .
  2. Parry . William . 1962 . Ergodic Properties of Some Permutation Processes . Biometrika . 49 . 1/2 . 151–154 . 10.2307/2333475 . 2333475 . 0006-3444.
  3. Daniels . H. E. . 1962 . Processes Generating Permutation Expansions . Biometrika . 49 . 1/2 . 139–149 . 10.2307/2333474 . 2333474 . 0006-3444.