Rapidly mixing random walks and bounds on characters of the symmetric group
From MaRDI portal
Publication:1862995
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
- 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?)
- Diameters of finite simple groups: sharp bounds and applications
- Factorization of permutations into n-cycles
- Generating a random permutation with random transpositions
- 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)- Some remarks on global/local conjectures
- Characters of symmetric groups: sharp bounds and applications.
- A random walk on the symmetric group generated by random involutions
- Mixing times for random walks on finite lamplighter groups
- The random \(k\) cycle walk on the symmetric group
- Total variation cutoff for the transpose top-2 with random shuffle
- Cutoff for conjugacy-invariant random walks on the permutation group
- Limit profile for random transpositions
- Kazhdan constants for conjugacy classes of compact groups.
- Mixing times for exclusion processes on hypergraphs
- Cycle structure of the interchange process and representation theory
- The mixing time for a random walk on the symmetric group generated by random involutions
- The random \((n-k)\)-cycle to transpositions walk on the symmetric group
- Conjugacy classes, growth and complexity
- Likelihood orders for the \(p\)-cycle walks on the symmetric group
- 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)