Abstract
We study two random walks on a group of upper triangular matrices. In each case, we give upper bound on the mixing time by using a stopping time technique.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
REFERENCES
Aldous, D. (1983). Random walks on finite groups and rapidly mixing Markov chains. Lect. Notes in Math. 986, 243–297.
Aldous, D., and Diaconis. P. (1986). Shuffling cards and stopping times. Amer. Math. Monthly 93, 333–348.
Aldous, D., and Diaconis, P. (1987). Strong uniform times and finite random walks. Adv. Appl. Math. 8, 69–97.
Aldous, D., and Fill, J. (1996). Reversible Markov chains and random walks on graphs, monograph in preparation.
Astashkevich, A., and Pak, I. (1997). Random walks on nilpotent and supersolvable groups. Preprint.
Bourbaki, N. (1963). Éléments de Mathématique: Intégration, Mesure de Haar; Topologie Générale, Groupes Topologiques, Hermann, Paris.
Diaconis, P. (1988). Group Representation in Probability and Statistics, IMS, Hayward, California.
Diaconis, P. (1996). The cutoff phenomenon in finite Markov chains. Proc. Nat. Acad. Sci. U.S.A. 93, 1659–1664.
Diaconis, P. (1998). An introduction to modern Markov chain theory. Proc. ICM Berlin 1, 187–204.
Diaconis, P., and Fill, J. A. (1990). Strong stationary times via new form of duality. Ann. Prob. 18, 1483–1522.
Diaconis, P., and Saloff-Coste, L. (1993). Comparison techniques for random walk on finite groups. Ann. Prob. 21, 2131–2156.
Diaconis, P., and Saloff-Coste, L. (1994). Moderate growth and random walk on finite groups. Geom. Funct. Anal. 4, 1–36.
Diaconis, P., and Shahshahani, M. (1981). Generating a random permutation with random transpositions. Z. Wahr. verw. Gebiete 57, 159–179.
Erdös, P., and Rényi, A. (1961). On classical problem of probability theory. MTA Tat. Kut Int. Közl. 6A, 215–220.
Feller, W. (1970). An Introduction to Probability Theory and Its Applications, 3rd ed., John Wiley, New York.
Humphreys, J. (1975). Linear Algebraic Groups, Springer, Berlin.
Kannan, R. (1994). Markov chains and polynomial time algorithms. 35th FOCS, IEEE Comput. Soc. Press, Los Alamitos, California, pp. 656–671.
Lovász, L., and Winkler, P. (1998). Mixing Times AMS DIMACS Series, 41, 189–204.
Matthews, P. (1988). A strong uniform time for random transpositions. J. Theor. Prob. 1, 411–423.
Pak, I. (1997). Random walks on groups: Strong uniform time approach, Ph.D. Thesis, Harvard U.
Pak, I. (1998). When and how n choose k. AMS DIMACS Series, 43, 191–238.
Pak, I., and Vu, V. H. (to appear). On finite geometric random walks. Discrete Applied Math.
Revuz, D. (1975). Markov Chains, in North Holland Mathematical Library, Vol. 11, Elsevier, New York.
Sinclair, A., and Jerrum, M. (1989). Approximate counting, uniform generation and rapidly mixing Markov chains. Inform. and Comput. 82, 93–133.
Stong, R. (1995). Random walk on the upper triangular matrices. Ann. Prob. 23, 1939–1949.
Stong, R. (1995). Eigenvalues of random walks on groups. Ann. Prob. 23, 1961–1981.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Pak, I. Two Random Walks on Upper Triangular Matrices. Journal of Theoretical Probability 13, 1083–1100 (2000). https://doi.org/10.1023/A:1007870125727
Issue Date:
DOI: https://doi.org/10.1023/A:1007870125727