Cutoff for the warp-transpose top with random shuffle
zbMATH Open1459.60009MaRDI QIDQ2199866FDOQ2199866
Publication date: 14 September 2020
Published in: Séminaire Lotharingien de Combinatoire (Search for Journal in Brave)
Full work available at URL: http://www.mat.univie.ac.at/~slc/wpapers/FPSAC2020//69.html
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Combinatorial aspects of representation theory (05E10) Ordinary representations and characters (20C15) Probability measures on groups or semigroups, Fourier transforms, factorization (60B15)
Cites Work
- Title not available (Why is that?)
- 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?)
- The cutoff phenomenon in finite Markov chains.
- The Okounkov-Vershik approach to the representation theory of \(G\sim S_n\)
- Title not available (Why is that?)
- Representation theory. A combinatorial viewpoint.
Cited In (2)
This page was built for publication: Cutoff for the warp-transpose top with random shuffle
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2199866)