Abstract
This paper considers some random processes of the form X n+1=T X n +B n (mod∈p) where B n and X n are random variables over (ℤ/pℤ) d and T is a fixed d×d integer matrix which is invertible over the complex numbers. For a particular distribution for B n , this paper improves results of Asci to show that if T has no complex eigenvalues of length 1, then for integers p relatively prime to det∈(T), order (log∈p)2 steps suffice to make X n close to uniformly distributed where X 0 is the zero vector. This paper also shows that if T has a complex eigenvalue which is a root of unity, then order p b steps are needed for X n to get close to uniformly distributed for some positive value b≤2 which may depend on T and X 0 is the zero vector.
| Original language | English |
|---|---|
| Pages (from-to) | 802-811 |
| Number of pages | 10 |
| Journal | Journal of Theoretical Probability |
| Volume | 21 |
| Issue number | 4 |
| DOIs | |
| State | Published - Dec 2008 |
Keywords
- Fourier transform
- Random processes
- Upper bound lemma
Fingerprint
Dive into the research topics of 'Generating Random vectors in (ℤ/pℤ) d via an affine random process'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver