Comparing the inversion statistic for distribution-biased and distribution-shifted permutations with the geometric and the GEM distributions
From MaRDI portal
(Redirected from Publication:5026474)
Abstract: For a distribution on the positive integers, there are two natural ways to construct a random permutation in or of from IID samples from --the -biased construction and the -shifted construction. First we consider the case that is the geometric distribution with parameter . In this case, the -shifted random permutation has the Mallows distribution with parameter . Let and denote the biased and the shifted distributions on . The expected number of inversions of a permutation under is greater than under , and under either of these, a permutation tends to have many fewer inversions than it would have under the uniform distribution. For fixed , both and converge weakly as to the uniform distribution on . We compare the biased and the shifted distributions by studying the inversion statistic under and for various rates of convergence of to 1. Then we consider -biased and -shifted permutations in the case that the distribution is itself random and distributed as a GEM-distribution. In both the GEM-biased and the GEM-shifted cases, the expected number of inversions behaves asymptotically as it does under the Geo-shifted distribution with . Thus, one can consider the GEM-shifted case as the random counterpart of the Geo-shifted case. We also consider another -biased distribution with random for which the expected number of inversions behaves asymptotically as it does under the Geo-biased case with and as above, and with and .
Recommendations
- Combinatorics of geometrically distributed random variables: Inversions and a parameter of Knuth
- On the number of inversions in bimodal permutations
- Coherent random permutations with biased record statistics
- Block size in geometric(\(p\))-biased permutations
- A central limit theorem for descents of a Mallows permutation and its inverse
Cites work
- Lengths of monotone subsequences in a Mallows permutation
- Limit theorems for longest monotone subsequences in random Mallows permutations
- On the cycle structure of Mallows permutations
- On the strange domain of attraction to generalized Dickman distributions for sums of independent random variables
- Regenerative random permutations of integers
- The two-sided infinite extension of the Mallows model for random permutations
Cited in
(6)- Clustering of consecutive numbers in permutations under Mallows distributions and super-clustering under general \(p\)-shifted distributions
- The secretary problem with biased arrival order via a Mallows distribution
- The secretary problem with non-uniform arrivals via a left-to-right minimum exponentially tilted distribution
- Thresholds for patterns in random permutations with a given number of inversions
- Classical patterns in Mallows permutations
- The inversion statistic in derangements and in other permutations with a prescribed number of fixed points
This page was built for publication: Comparing the inversion statistic for distribution-biased and distribution-shifted permutations with the geometric and the GEM distributions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5026474)