Regenerative random permutations of integers
arXiv:1704.01166 · doi:10.1214/18-AOP1286
Abstract
Motivated by recent studies of large Mallows permutations, we propose a class of random permutations of and of , called regenerative permutations. Many previous results of the limiting Mallows permutations are recovered and extended. Three special examples: blocked permutations, p-shifted permutations and p-biased permutations are studied.
arXiv comment30 pages. This paper is published by https://projecteuclid.org/euclid.aop/1556784022
References in corpus (10)
- Harmonic analysis on the infinite symmetric group
- Spatial random permutations and infinite cycles
- -exchangeability via quasi-invariance
- The Descent Set and Connectivity Set of a Permutation
- Size-biased permutation of a finite sequence with independent and identically distributed terms
- Renewal sequences and record chains related to multiple zeta sums
- Weak convergence of random p-mappings and the exploration process of inhomogeneous continuum random trees
- Iterated primitives of logarithmic powers
- Gibbs measures on permutations over one-dimensional discrete point sets
- Gaps and interleaving of point processes in sampling from a residual allocation model