On Unfair Permutations
Loading...
Date
2018
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Elsevier Science Bv
Open Access Color
Green Open Access
Yes
OpenAIRE Downloads
0
OpenAIRE Views
2
Publicly Funded
No
BIP! Indicators
Impulse
Average
Influence
Average
Popularity
Average
Abstract
In this paper we study the inverse of so-called unfair permutations. Our investigation begins with comparing this class of permutations with uniformly random permutations, and showing that they behave very much alike in case of 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. (C) 2018 Elsevier B.V. All rights reserved.
Description
Islak, Umit/0000-0003-4281-5171
ORCID
Keywords
Random permutations, Uniform permutations, Descents, Inversions, Stein's method, Size biased coupling, Random permutations, Descents, 60C05, 05A05, 05A16, Uniform permutations, Size biased coupling, Central limit theorem, Independent random, Stein's method, Inversions, Mathematics - Probability, Permutations, words, matrices, Combinatorial probability, Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.), size biased coupling, random permutations, uniform permutations, inversions, descents
Fields of Science
0102 computer and information sciences, 0101 mathematics, 01 natural sciences
Citation
WoS Q
Q4
Scopus Q
OpenCitations Citation Count
1
Source
Statistics & Probability Letters
Volume
141
Issue
Start Page
31
End Page
40
PlumX Metrics
Citations
Scopus : 1
Captures
Mendeley Readers : 1
Google Scholar™
