Rapidly mixing random walks and bounds on characters of the symmetric group
type: Item
instance of: scholarly article
title: Rapidly mixing random walks and bounds on characters of the symmetric group
zbMATH Open document ID: 1012.05156
DOI: 10.1023/A:1021172928478
author: Nathan Lulov
author: Igor Pak
published in: Journal of Algebraic Combinatorics
publication date: 2003-03-11T00:00:00Z
review text: The authors investigate mixing of random walks on \(S_n\) and \(A_n\) generated by permutations of a given cycle structure. The approach follows methods developed by P. Diaconis. It requires certain estimates on characters of the symmetric group and uses combinatorics of Young tableaux. Some conjectures and open problems are presented.
Mathematics Subject Classification ID: 05E10
Mathematics Subject Classification ID: 05E15
Mathematics Subject Classification ID: 20C20
zbMATH DE Number: 1879614
zbMATH Keywords: random walks on groups
zbMATH Keywords: symmetric groups
zbMATH Keywords: character
zbMATH Keywords: Young tableaux
reviewed by: Anatoli Kondrat'ev
MaRDI profile type: Publication
cites work: Strong uniform times and finite random walks
cites work: Q4146776
cites work: Q3995195
cites work: The cutoff phenomenon in finite Markov chains.
cites work: Generating a random permutation with random transpositions
cites work: Q3364761
cites work: Q3952291
cites work: Diameters of finite simple groups: sharp bounds and applications
cites work: Q4841310
cites work: Q3947818
cites work: On mixing of certain random walks, cutoff phenomenon and sharp threshold of random matroid processes
cites work: Upper bound on the characters of the symmetric groups
cites work: Factorization of permutations into n-cycles
full work available at URL: a:1021172928478
OpenAlex ID: W2081568866
description: scientific article; zbMATH DE number 1879614