The two-sided infinite extension of the Mallows model for random permutations

DOI10.1016/j.aam.2012.01.001zbMath1242.60010arXiv1103.1498OpenAlexW2080851052WikidataQ104457080 ScholiaQ104457080MaRDI QIDQ424535

Grigori Olshanski, Alexander V. Gnedin

Publication date: 1 June 2012

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1103.1498

zbMATH Keywords

Mallows modelrandom permutationsinfinite symmetric groupq-exchangeability

Mathematics Subject Classification ID

Combinatorial probability (60C05) Dynamical systems and their relations with probability theory and stochastic processes (37A50) Exchangeability for stochastic processes (60G09)

Related Items

A view from the bridge spanning combinatorics and probability ⋮ Statistical enumeration of groups by double cosets ⋮ A central limit theorem for descents of a Mallows permutation and its inverse ⋮ The Mallows measures on the hyperoctahedral group ⋮ Stationary distributions of the multi-type ASEP ⋮ Mallows permutations and finite dependence ⋮ Cycles in Mallows random permutations ⋮ Regenerative random permutations of integers ⋮ Limit distributions for Euclidean random permutations ⋮ Comparing the inversion statistic for distribution-biased and distribution-shifted permutations with the geometric and the GEM distributions ⋮ Limit theorems for longest monotone subsequences in random Mallows permutations ⋮ Sampling and learning Mallows and generalized Mallows models under the Cayley distance ⋮ The space \(L^2\) on semi-infinite Grassmannian over finite field ⋮ Strongly correlated random interacting processes. Abstracts from the workshop held January 28 -- February 3, 2018 ⋮ Mallows and generalized Mallows model for matchings ⋮ On the cycle structure of Mallows permutations ⋮ Groups \(\mathrm{GL}(\infty)\) over finite fields and multiplications of double cosets ⋮ The Infinite limit of random permutations avoiding patterns of length three ⋮ The height of Mallows trees ⋮ Clustering of consecutive numbers in permutations under Mallows distributions and super-clustering under general \(p\)-shifted distributions ⋮ Lengths of monotone subsequences in a Mallows permutation ⋮ Mallows permutations as stable matchings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The length of the longest increasing subsequence of a random Mallows permutation
• \(q\)-exchangeability via quasi-invariance
• Coherent random permutations with biased record statistics
• Harmonic analysis on the infinite symmetric group
• Random orderings of the integers and card shuffling
• The representation of composition structures
• Logarithmic combinatorial structures: A probabilistic approach
• A \(q\)-analogue of de Finetti's theorem
• On equivalence of infinite product measures
• NON-NULL RANKING MODELS. I
• Mixing times of the biased card shuffling and the asymmetric exclusion process
• Coherent permutations with descent statistic and the boundary problem for the graph of zigzag diagrams
• Analysis of systematic scan Metropolis algorithms using Iwahori-Hecke algebra techniques