Rapidly mixing random walks and bounds on characters of the symmetric group
From MaRDI portal
(Redirected from Publication:1862995)
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.
Recommendations
- Mixing times for random \(k\)-cycles and coalescence-fragmentation chains
- Characters of symmetric groups: sharp bounds and applications.
- The random \((n-k)\)-cycle to transpositions walk on the symmetric group
- The random k cycle walk on the symmetric group
- A random walk on the symmetric group generated by random involutions
Cites work
- Diameters of finite simple groups: sharp bounds and applications
- Factorization of permutations into n-cycles
- Generating a random permutation with random transpositions
- scientific article; zbMATH DE number 3766017 (Why is no real title available?)
- scientific article; zbMATH DE number 3771876 (Why is no real title available?)
- scientific article; zbMATH DE number 44579 (Why is no real title available?)
- scientific article; zbMATH DE number 3577263 (Why is no real title available?)
- scientific article; zbMATH DE number 782054 (Why is no real title available?)
- On mixing of certain random walks, cutoff phenomenon and sharp threshold of random matroid processes
- On the number of rim hook tableaux
- Strong uniform times and finite random walks
- The cutoff phenomenon in finite Markov chains.
- Upper bound on the characters of the symmetric groups
Cited in
(16)- Characters of symmetric groups: sharp bounds and applications.
- Kazhdan constants for conjugacy classes of compact groups.
- Likelihood orders for the \(p\)-cycle walks on the symmetric group
- Cutoff for conjugacy-invariant random walks on the permutation group
- A random walk on the symmetric group generated by random involutions
- Mixing times for random walks on finite lamplighter groups
- Total variation cutoff for the transpose top-2 with random shuffle
- Limit profile for random transpositions
- The random \((n-k)\)-cycle to transpositions walk on the symmetric group
- Mixing times for exclusion processes on hypergraphs
- The random k cycle walk on the symmetric group
- The mixing time for a random walk on the symmetric group generated by random involutions
- Some remarks on global/local conjectures
- Conjugacy classes, growth and complexity
- Cycle structure of the interchange process and representation theory
- Mixing times for random \(k\)-cycles and coalescence-fragmentation chains
This page was built for publication: Rapidly mixing random walks and bounds on characters of the symmetric group
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1862995)
