Ergodic sequence

From testwiki
Jump to navigation Jump to search

Template:Short description In mathematics, an ergodic sequence is a certain type of integer sequence, having certain equidistribution properties.[1]

Definition

Let A={aj} be an infinite, strictly increasing sequence of positive integers. Then, given an integer q, this sequence is said to be ergodic mod q if, for all integers 1kq, one has

limtN(A,t,k,q)N(A,t)=1q

where

N(A,t)=card{ajA:ajt}

and card is the count (the number of elements) of a set, so that N(A,t) is the number of elements in the sequence A that are less than or equal to t, and

N(A,t,k,q)=card{ajA:ajt,ajmodq=k}

so N(A,t,k,q) is the number of elements in the sequence A, less than t, that are equivalent to k modulo q. That is, a sequence is an ergodic sequence if it becomes uniformly distributed mod q as the sequence is taken to infinity.

An equivalent definition is that the sum

limt1N(A,t)j;ajtexp2πikajq=0

vanish for every integer k with kmodq0.

If a sequence is ergodic for all q, then it is sometimes said to be ergodic for periodic systems.

Examples

The sequence of positive integers is ergodic for all q.

Almost all Bernoulli sequences, that is, sequences associated with a Bernoulli process, are ergodic for all q.[2]

That is, let (Ω,Pr) be a probability space of random variables over two letters {0,1}. Then, given ωΩ, the random variable Xj(ω) is 1 with some probability p and is zero with some probability 1-p; this is the definition of a Bernoulli process. Associated with each ω is the sequence of integers

ω={n:Xn(ω)=1}

Then almost every sequence ω is ergodic.

Counter examples

Template:See also

Fibonacci numbers are not an ergodic sequence.[3]

See also

References

Template:Reflist

Template:Math-stub