Mallows permutations as stable matchings

DOI10.4153/S0008414X20000590zbMath1493.60017arXiv1802.07142OpenAlexW2789066782MaRDI QIDQ5021256

Alexander E. Holroyd, Tom Hutchcroft, Avi Levy, Omer Angel

Publication date: 12 January 2022

Published in: Canadian Journal of Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

complete bipartite graphstable matchingMallows permutationinfinite volume limits

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial probability (60C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (6)

A central limit theorem for descents of a Mallows permutation and its inverse ⋮ Stationary distributions of the multi-type ASEP ⋮ Mallows permutations and finite dependence ⋮ Cycles in Mallows random permutations ⋮ Limit distributions for Euclidean random permutations ⋮ Strongly correlated random interacting processes. Abstracts from the workshop held January 28 -- February 3, 2018

Cites Work

• Unnamed Item
• The length of the longest increasing subsequence of a random Mallows permutation
• The two-sided infinite extension of the Mallows model for random permutations
• \(q\)-exchangeability via quasi-invariance
• The TASEP speed process
• Limit theorems for longest monotone subsequences in random Mallows permutations
• On the cycle structure of Mallows permutations
• Mallows permutations and finite dependence
• Lengths of monotone subsequences in a Mallows permutation
• The length of the longest common subsequence of two independent Mallows permutations
• Stochastic domination and comb percolation
• NON-NULL RANKING MODELS. I
• Thermodynamic limit for the Mallows model on Sn
• Phase uniqueness for the Mallows measure on permutations
• Mixing times of the biased card shuffling and the asymmetric exclusion process
• College Admissions and the Stability of Marriage
• Analysis of systematic scan Metropolis algorithms using Iwahori-Hecke algebra techniques

This page was built for publication: Mallows permutations as stable matchings