Logo Logo
Switch Language to German

Borga, Jacopo; Bouvel, Mathilde; Feray, Valentin and Stufler, Benedikt (2020): A decorated tree approach to random permutations in substitution-closed classes. In: Electronic Journal of Probability, Vol. 25, 67

Full text not available from 'Open Access LMU'.


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.

Actions (login required)

View Item View Item