Abstract
We establish a novel bijective encoding that represents permutations as forests of decorated (or enriched) trees. This allows us to prove local convergence of uniform random permutations from substitution-closed classes satisfying a criticality constraint. It also enables us to reprove and strengthen permuton limits for these classes in a new way, that uses a semi-local version of Aldous' skeleton decomposition for size-constrained Galton-Watson trees.
Item Type: | Journal article |
---|---|
Faculties: | Mathematics, Computer Science and Statistics > Mathematics |
Subjects: | 500 Science > 510 Mathematics |
ISSN: | 1083-6489 |
Language: | English |
Item ID: | 88965 |
Date Deposited: | 25. Jan 2022, 09:28 |
Last Modified: | 13. Aug 2024, 12:44 |