Rapidly mixing random walks and bounds on characters of the symmetric group
From MaRDI portal
Publication:1862995
DOI10.1023/A:1021172928478zbMATH Open1012.05156OpenAlexW2081568866MaRDI QIDQ1862995FDOQ1862995
Publication date: 11 March 2003
Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1021172928478
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
Combinatorial aspects of representation theory (05E10) Modular representations and characters (20C20)
Cites Work
- Title not available (Why is that?)
- Generating a random permutation with random transpositions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Strong uniform times and finite random walks
- The cutoff phenomenon in finite Markov chains.
- Upper bound on the characters of the symmetric groups
- Diameters of finite simple groups: sharp bounds and applications
- Title not available (Why is that?)
- On mixing of certain random walks, cutoff phenomenon and sharp threshold of random matroid processes
- Factorization of permutations into n-cycles
- On the number of rim hook tableaux
Cited In (15)
- Total variation cutoff for the transpose top-2 with random shuffle
- The random \((n-k)\)-cycle to transpositions walk on the symmetric group
- Kazhdan constants for conjugacy classes of compact groups.
- Mixing times for random \(k\)-cycles and coalescence-fragmentation chains
- The random \(k\) cycle walk on the symmetric group
- Characters of symmetric groups: sharp bounds and applications.
- Mixing times for random walks on finite lamplighter groups
- Conjugacy classes, growth and complexity
- Title not available (Why is that?)
- Likelihood orders for the \(p\)-cycle walks on the symmetric group
- Cutoff for conjugacy-invariant random walks on the permutation group
- Limit profile for random transpositions
- Some remarks on global/local conjectures
- Mixing times for exclusion processes on hypergraphs
- Cycle structure of the interchange process and representation theory
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)