Ulam's problem and Hammersley's process

DOI10.1214/AOP/1008956689zbMath1013.60003OpenAlexW2154933175MaRDI QIDQ1872203

Piet Groeneboom

Publication date: 6 May 2003

Published in: The Annals of Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1214/aop/1008956689

zbMATH Keywords

longest increasing subsequenceUlam's problemHammersley's process

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Combinatorial probability (60C05)

Related Items (6)

Moderate deviations for longest increasing subsequences: The upper tail ⋮ On the collision between two PNG droplets ⋮ Connect the dots: how many random points can a regular curve pass through? ⋮ A central limit theorem for the optimal selection process for monotone subsequences of maximum expected length ⋮ Order of the variance in the discrete Hammersley process with boundaries ⋮ Hammersley's process with sources and sinks

Cites Work

• Subadditive ergodic theory
• A variational problem for random Young tableaux
• Hammersley's interacting particle process and longest increasing subsequences
• A microscopic model for the Burgers equation and longest increasing 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Ulam's problem and Hammersley's process