Poisson approximations of the number of fixed points in random multiset permutations
Dudley Stark
Abstract
For ordinary permutations on n letters, the distribution of the number of fixed points of random permutations is well known to approach the Poisson(1) distribution in total variation distance as n∞ super-exponentially quickly. We use Stein's method to get related results for the number of fixed points of random permutations of multisets. Given a sequence of multisets on n letters whose expected number of fixed points converges to a constant c, we must have c≥ 1 and the distribution of number of fixed points converges to the Poisson(c) distribution as n∞. If c>1, then the rate of convergence in total variation distance can be as slow as n-1/2.
Create a lesson
Related papers
Simple Cayley permutations
Giulio Cerbai, Anders Claesson
Transfer of difference structures: a new semidirect product framework
Sophie Huczynska, Struan McCartney, Carys Williams
Connected Mutual-Visibility in Graphs
Tonny K B, Shikhi M
Decomposing Gorenstein polytopes of large index
Johannes Knupfer, Benjamin Nill
A non-trivial bound for 3AP-intersecting families
Peter Keevash
Solution to a conjecture on integral uniform hypercycles
Joyentanuj Das, Iswar Mahato