Thresholds for patterns in random permutations with a given number of inversions
From MaRDI portal
Publication:6635161
DOI10.37236/12601MaRDI QIDQ6635161
Publication date: 9 November 2024
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The length of the longest increasing subsequence of a random Mallows permutation
- A probabilistic approach to consecutive pattern avoiding in permutations
- On the connected components of a random permutation graph with a given number of edges
- Enumeration schemes for vincular patterns
- Degree sequence of random permutation graphs
- Patterns in permutations and words.
- (2+2)-free posets, ascent sequences and pattern avoiding permutations
- Consecutive patterns in permutations
- Generalized permutation patterns and a classification of the Mahonian statistics
- An asymptotic expansion for the number of permutations with a certain number of inversions
- Limit theorems for longest monotone subsequences in random Mallows permutations
- Clusters, generating functions and asymptotics for consecutive patterns in permutations
- Independence of permutation limits at infinitely many scales
- A central limit theorem for descents of a Mallows permutation and its inverse
- Lengths of monotone subsequences in a Mallows permutation
- On the asymptotic statistics of the number of occurrences of multiple permutation patterns
- Asymptotic enumeration of permutations avoiding generalized patterns
- Central and local limit theorems applied to asymptotic enumeration
- Combinatorics of Permutations
- The Surprising Mathematics of Longest Increasing Subsequences
- Permutation classes
- Introduction to Random Graphs
- A survey of consecutive patterns in permutations
- NON-NULL RANKING MODELS. I
- On the distribution of the length of the longest increasing subsequence of random permutations
- A Central Limit Theorem for Vincular Permutation Patterns
- Pattern Avoidance for Random Permutations
- The probability of avoiding consecutive patterns in the Mallows distribution
- Comparing the inversion statistic for distribution-biased and distribution-shifted permutations with the geometric and the GEM distributions
- Permutations with fixed pattern densities
- Random Graphs
- The feasible region for consecutive patterns of permutations is a cycle polytope
- Generalized pattern avoidance
- Permutations avoiding a pattern of length three under Mallows distributions
- Limits of Mallows trees
This page was built for publication: Thresholds for patterns in random permutations with a given number of inversions