PR ] 2 0 A ug 2 00 7 On the Chung-Diaconis-Graham random process

@inproceedings{Hildebrand2006PR2,
  title={PR ] 2 0 A ug 2 00 7 On the Chung-Diaconis-Graham random process},
  author={Martin Hildebrand},
  year={2006}
}
Chung, Diaconis, and Graham considered random processes of the form Xn+1 = 2Xn + bn (mod p) where X0 = 0, p is odd, and bn for n = 0, 1, 2, . . . are i.i.d. random variables on {−1, 0, 1}. If Pr(bn = −1) = Pr(bn = 1) = β and Pr(bn = 0) = 1 − 2β, they asked which value of β makes Xn get close to uniformly distributed on the integers mod p the slowest. In this paper, we extend the results of Chung, Diaconis, and Graham in the case p = 2t − 1 to show that for 0 < β ≤ 1/2, there is no such value of… CONTINUE READING

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-6 of 6 references

Group Representations in Probability and Statistics

P. Diaconis
Institute of Mathematical Statistics, • 1988
View 6 Excerpts
Highly Influenced

A random walk problem arising in random number generation

F. Chung, P. Diaconis, R. Graham
Ann. Probab • 1987
View 10 Excerpts
Highly Influenced

On the Chung-Diaconis-Graham random process

M. Hildebrand
Electron. Comm. in Probab • 2006

Random processes of the form X n + 1 = a n X n + b n ( mod p ) where b n takes on a single value . pp . 153 - 174 , Random Discrete Structures

M. Hildebrand
1996

Random processes of the form Xn+1 = anXn+bn (mod p) where bn takes on a single value

M. Hildebrand
Random Discrete Structures, ed. Aldous and Pemantle. Springer-Verlag, • 1996
View 1 Excerpt

Random processes of the form Xn+1 = anXn + bn (mod p)

M. Hildebrand
Ann. Probab • 1993
View 2 Excerpts

Similar Papers

Loading similar papers…