On unfair permutations
From MaRDI portal
Publication:722653
DOI10.1016/J.SPL.2018.05.011zbMATH Open1397.05006arXiv1611.07275OpenAlexW2964077274MaRDI QIDQ722653FDOQ722653
Authors: İlker Arslan, Ümit Işlak, Cihan Pehlivan
Publication date: 27 July 2018
Published in: Statistics \& Probability Letters (Search for Journal in Brave)
Abstract: In this paper we study the inverse of so-called unfair permutations, and explore various properties of them. Our investigation begins with comparing this class of permutations with uniformly random permutations, and showing that they behave very much alike for locally dependent random variables. As an example of a globally dependent statistic we use the number of inversions, and show that this statistic satisfies a central limit theorem after proper centering and scaling. A secondary example of a globally dependent statistic to be studied will be the number of fixed points. Finally, we introduce two different generalizations of inverse-unfair permutations.
Full work available at URL: https://arxiv.org/abs/1611.07275
Recommendations
Permutations, words, matrices (05A05) Combinatorial probability (60C05) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Cites Work
- Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
- Fundamentals of Stein's method
- Normal approximation under local dependence.
- Applications of size biased couplings for concentration of measures
- A probabilistic approach to the asymptotics of the length of the longest alternating subsequence
- Convergence rates for generalized descents
- Title not available (Why is that?)
This page was built for publication: On unfair permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q722653)