On the length of the longest monotone subsequence in a random permutation
From MaRDI portal
Publication:1176972
DOI10.1214/AOAP/1177005939zbMATH Open0738.05002OpenAlexW1963811858WikidataQ94767378 ScholiaQ94767378MaRDI QIDQ1176972FDOQ1176972
Publication date: 25 June 1992
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1214/aoap/1177005939
Permutations, words, matrices (05A05) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05)
Cited In (20)
- A concentration bound for the longest increasing subsequence of a randomly chosen involution
- Arithmetic subsequences in a random ordering of an additive set
- Random \(k\)-dimensional orders: Width and number of linear extensions
- Untangling planar graphs from a specified vertex position-Hard cases
- A direct verification argument for the Hamilton-Jacobi equation continuum limit of nondominated sorting
- Young tableaux and longest monotone subsequences: An inequality and a conjecture
- Connect the dots: how many random points can a regular curve pass through?
- Concentration of measure and isoperimetric inequalities in product spaces
- A probabilistic approach to the asymptotics of the length of the longest alternating subsequence
- On the limiting distribution for the length of the longest alternating sequence in a random permutation
- Decomposing Random Permutations into Order-Isomorphic Subpermutations
- Locally uniform random permutations with large increasing subsequences
- Random partial orders defined by angular domains
- Minimum Number of Monotone Subsequences of Length 4 in Permutations
- Noncommutative martingale concentration inequalities
- On the distribution of the length of the longest increasing subsequence of random permutations
- Expected length of the longest common subsequence for large alphabets
- A sharp concentration inequality with applications
- Hammersley's interacting particle process and longest increasing subsequences
- Longest convex chains
This page was built for publication: On the length of the longest monotone subsequence in a random permutation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1176972)
