Locally uniform random permutations with large increasing subsequences
From MaRDI portal
Publication:6204686
DOI10.5070/c63362784arXiv2301.07658OpenAlexW4390103652MaRDI QIDQ6204686
Publication date: 2 April 2024
Published in: Combinatorial Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2301.07658
Cites Work
- Fixed points and cycle structure of random permutations
- The length of the longest increasing subsequence of a random Mallows permutation
- Finitely forcible graphons and permutons
- On the length of the longest monotone subsequence in a random permutation
- The Brownian limit of separable permutations
- Limiting curves for i.i.d. records
- Hammersley's interacting particle process and longest increasing subsequences
- Concentration of measure and isoperimetric inequalities in product spaces
- Limits of permutation sequences
- Scaling limits of permutation classes with a finite specification: a dichotomy
- Universal limits of substitution-closed permutation classes
- Lengths of monotone subsequences in a Mallows permutation
- Quasirandom permutations are characterized by 4-point densities
- A concentration bound for the longest increasing subsequence of a randomly chosen involution
- Weighted sums of certain dependent random variables
- The Surprising Mathematics of Longest Increasing Subsequences
- Probability Inequalities for the Sum of Independent Random Variables
- On the distribution of the length of the longest increasing subsequence of random permutations
- Linear-sized independent sets in random cographs and increasing subsequences in separable permutations
- Superlogarithmic Cliques in Dense Inhomogeneous Random Graphs
- Cliques in dense inhomogeneous random graphs
- Monotone subsequences in locally uniform random permutations
This page was built for publication: Locally uniform random permutations with large increasing subsequences
