Unseparated pairs and fixed points in random permutations

DOI10.1016/j.aam.2014.05.006zbMath1372.60010arXiv1308.5459MaRDI QIDQ2406543

Persi Diaconis, Steven N. Evans, Ronald L. Graham

Publication date: 5 October 2017

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1308.5459

zbMATH Keywords

shuffle; Stein's method; Markov chain; Poisson distribution; commutator; derangement; chinese restaurant process; smoosh; wash

Mathematics Subject Classification ID

60F05: Central limit and other weak theorems

60C05: Combinatorial probability

60B15: Probability measures on groups or semigroups, Fourier transforms, factorization

Related Items

Fixed points and adjacent ascents for classical complex reflection groups, Shuffling cards by spatial motion

Cites Work

• Unnamed Item
• Some things we've learned (about Markov chain Monte Carlo)
• On products of conjugacy classes of the symmetric group
• Exchangeable pairs and Poisson approximation
• Nombre de représentations d'une permutation comme produit de deux cycles de longueurs données
• Factorization of permutations into n-cycles
• Decomposition of certain products of conjugacy classes of \(S_ n\)
• Statistics-preserving bijections between classical and cyclic permutations
• Combinatorial stochastic processes. Ecole d'Eté de Probabilités de Saint-Flour XXXII -- 2002.
• Théorie géométrique des polynômes eulériens
• Word maps and spectra of random graph lifts
• On the number of cycles of given length of a free word in several random permutations
• The Poset of Conjugacy Classes and Decomposition of Products in the Symmetric Group