Abstract
We consider a random walk on a finite group G based on a generating set that is a union of conjugacy classes. Let the nonnegative integer valued random variable T denote the first time the walk arrives at the identity element of G, if the starting point of the walk is uniformly distributed on G. Under suitable hypotheses, we show that the distribution function F of T is almost exponential, and we give an error term.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
REFERENCES
Aldous, D. (1982). Markov chains with almost exponential hitting times, Stoch. Proc. Appl. 13, 305–310.
Aldous, D. (1983). Random walk on finite groups and rapidly mixing Markov chains. Springer, Berlin, Sém. de Prob. XVII, LNM, Vol. 986.
Aschbacher, M. (1986). Finite Group Theory, Cambridge University Press, Cambridge.
Diaconis, P. (1988). Group representations in probability and statistics, IMS, Hayward, California.
Diaconis, P., and Shahshahani, M. (1981). Generating a random permutation with random transpositions, Z. Wahrsch. 57, 159–179.
Flatto, L., Odlyzko, A., and Wales, D. (1985). Random shuffles and group representations, Ann. Prob. 13, 154–178.
Gluck, D. (1997). Characters and random walks on finite classical groups, Adv. Math. 129, 46–72.
Landazuri, V., and Seitz, G. (1974). On the minimal degrees of projective representations of the finite Chevalley groups, J. Algebra 32, 418–443.
Roichman, Y. (1996). Upper bound on the characters of the symmetric groups, Invent. Math. 125, 451–485.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Gluck, D. First Hitting Times for Some Random Walks on Finite Groups. Journal of Theoretical Probability 12, 739–755 (1999). https://doi.org/10.1023/A:1021679932572
Issue Date:
DOI: https://doi.org/10.1023/A:1021679932572