On random walks on affine group
Darning Xu · Communication in Statistics- Theory and Methods · 1990
Diaconis' presumption that the number of steps required to get close to uniform for a random walk on the affine group A pis c(p)p 2with c(p) →ã is verified. We also discuss the random number generation associated with the random walk on the affine group. The number of steps to force the generated number to become random is improved. A modified version of Diacohis-Shahshahani's upper bound lemma is given and applied