arXiv (All)
open access
Large deviation principle for random permutations
We derive a large deviation principle for random permutations induced by probability measures of the unit square, called permutons. These permutations are called $μ$-random permutations. We also introduce and study a new general class of models of random permutations, called Gibbs permutation models
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Eulerian calculus arising from permutation statistics#226750
- A large deviation principle for the Gaussian beta ensemble in the high temperature regime#1051135
- Protected tails and polynomial-time enumeration of permutations avoiding a direct sum of an increasing pattern and 231#1109623
- Permutation-invariant social welfare orders are anonymous#103343
- Harmonic higher weight distributions, Simonis' approach of MacWilliams identity and moments#785214
Record · ID 1130425
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive