Thresholds for patterns in random permutations with a given number of inversions
Bevan, David and Threlfall, Daniel (2024) Thresholds for patterns in random permutations with a given number of inversions. The Electronic Journal of Combinatorics, 31 (4). P4.6. ISSN 1077-8926 (https://doi.org/10.37236/12601)
Preview |
Text.
Filename: Bevan-Threlfall-EJC-2024-Thresholds-for-patterns-in-random-permutations.pdf
Final Published Version License: Download (406kB)| Preview |
Abstract
We explore how the asymptotic structure of a random permutation of n with m inversions evolves, as m increases, establishing thresholds for the appearance and disappearance of any classical, consecutive or vincular pattern. The threshold for the appearance of a classical pattern depends on the greatest number of inversions in any of its sum indecomposable components.
ORCID iDs
Bevan, David ORCID: https://orcid.org/0000-0001-7179-2285 and Threlfall, Daniel;-
-
Item type: Article ID code: 90774 Dates: DateEvent4 October 2024Published15 August 2024AcceptedSubjects: Science > Mathematics Department: Faculty of Science > Mathematics and Statistics Depositing user: Pure Administrator Date deposited: 04 Oct 2024 15:42 Last modified: 29 Oct 2024 08:52 URI: https://strathprints.strath.ac.uk/id/eprint/90774
CORE (COnnecting REpositories)