Ulam's problem and Hammersley's process

DOI10.1214/AOP/1008956689MaRDI QIDQ1872203zbMATH OpenOpenAlexFDO

Authors 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

Hammersley's processlongest increasing subsequenceUlam's problem

Mathematics Subject Classification ID

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

Recommendations

• Hammersley's interacting particle process and longest increasing subsequences
• Hammersley's process with sources and sinks
• Hydrodynamical methods for analyzing longest increasing subsequences
• The longest increasing subsequence in a random permutation and a unitary random matrix model
• From Hammersley's lines to Hammersley's trees

Cites work

• A microscopic model for the Burgers equation and longest increasing subsequences
• A variational problem for random Young tableaux
• Hammersley's interacting particle process and longest increasing subsequences
• scientific article; zbMATH DE number 48363 (Why is no real title available?)
• scientific article; zbMATH DE number 3630761 (Why is no real title available?)
• scientific article; zbMATH DE number 3373691 (Why is no real title available?)
• Integrable systems and combinatorial theory.
• Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem
• On the distribution of the length of the longest increasing subsequence of random permutations
• Subadditive ergodic theory

Cited in

(17)

• Hydrodynamical methods for analyzing longest increasing subsequences
• Hammersley's process with sources and sinks
• Hammersley's interacting particle process and longest increasing subsequences
• A microscopic model for the Burgers equation and longest increasing subsequences
• LIL for the length of the longest increasing subsequences
• Longest increasing paths with Lipschitz constraints
• Order of the variance in the discrete Hammersley process with boundaries
• Discrete Hammersley's lines with sources and sinks
• scientific article; zbMATH DE number 1775012 (Why is no real title available?)
• Moderate deviations for longest increasing subsequences: The upper tail
• Longest increasing paths with gaps
• A central limit theorem for the optimal selection process for monotone subsequences of maximum expected length
• Connect the dots: how many random points can a regular curve pass through?
• Hydrodynamics of the t-PNG model via a colored t-PNG model
• The Ulam-Hammersley problem for multiset permutations
• Extremal, enumerative and probabilistic results on ordered hypergraph matchings
• On the collision between two PNG droplets

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1872203)