Spherically Symmetric Random Permutations
Alexander Gnedin, Vadim Gorin

TL;DR
This paper studies spherically symmetric random permutations under various metrics, identifying the extreme cases for infinite processes using a unified stochastic monotonicity approach.
Contribution
It characterizes the extreme infinitely spherically symmetric permutation processes for Hamming, Kendall-tau, and Caley metrics, providing a unified proof method.
Findings
Identified extreme permutation processes for three metrics.
Unified approach via stochastic monotonicity.
Applicable to infinite permutation processes.
Abstract
We consider random permutations which are spherically symmetric with respect to a metric on the symmetric group and are consistent as varies. The extreme infinitely spherically symmetric permutation-valued processes are identified for the Hamming, Kendall-tau and Caley metrics. The proofs in all three cases are based on a unified approach through stochastic monotonicity.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
