On the distribution of the length of the longest increasing subsequence in a random permutation

DOI10.1007/s11009-013-9376-1zbMath1319.60025OpenAlexW2064570679MaRDI QIDQ2516396

James C. Fu, Yu-Fei Hsieh

Publication date: 31 July 2015

Published in: Methodology and Computing in Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11009-013-9376-1

zbMATH Keywords

finite Markov chain imbeddingrandom permutationlongest increasing subsequenceinsertion procedure

Mathematics Subject Classification ID

Probability distributions: general theory (60E05) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)

Related Items

The distribution of the length of the longest increasing subsequence in random permutations of arbitrary multi-sets

Cites Work

• Unnamed Item
• Unnamed Item
• A variational problem for random Young tableaux
• Hammersley's interacting particle process and longest increasing subsequences
• Exact and limiting distributions of the number of successions in a random permutation
• On the distribution of the number of occurrences of an order-preserving pattern of length three in a random permutation
• Longest Increasing and Decreasing Subsequences
• On the distribution of the length of the longest increasing subsequence of random permutations
• Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem