Increasing sequences of independent points on the planar lattice

DOI10.1214/aoap/1043862416zbMath0897.60095OpenAlexW2063901206MaRDI QIDQ1379710

Timo Seppäläinen

Publication date: 30 September 1998

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

Full work available at URL: https://doi.org/10.1214/aoap/1043862416

zbMATH Keywords

increasing sequencesUlam's problemasymptotic shape

Mathematics Subject Classification ID

Interacting random processes; statistical mechanics type models; percolation theory (60K35) Combinatorial probability (60C05)

Related Items (15)

A growth model in a random environment ⋮ Longest increasing paths with gaps ⋮ Bethe Ansatz Solution of the Finite Bernoulli Matching Model of Sequence Alignment ⋮ From Hammersley's lines to Hammersley's trees ⋮ Longest increasing paths with Lipschitz constraints ⋮ Optimality regions and fluctuations for Bernoulli last passage models ⋮ Strong law of large numbers for the stochastic six vertex model ⋮ Longest Increasing Subsequences of Randomly Chosen Multi-Row Arrays ⋮ Non-existence of bi-infinite geodesics in the exponential corner growth model ⋮ Properties of the limit shape for some last-passage growth models in random environments ⋮ Order of the variance in the discrete Hammersley process with boundaries ⋮ Existence of hydrodynamics for the totally asymmetric simple \(K\)-exclusion process ⋮ On the Geometry of the Last Passage Percolation Problem ⋮ Expected length of the longest common subsequence for large alphabets ⋮ First-order behavior of the time constant in Bernoulli first-passage percolation

Cites Work

• A variational problem for random Young tableaux
• A phase transition for the score in matching random sequences allowing deletions
• Approximation of subadditive functions and convergence rates in limiting-shape results
• Limiting curves for i.i.d. records
• Hammersley's interacting particle process and longest increasing subsequences
• A microscopic model for the Burgers equation and longest increasing subsequences
• Longest common subsequences of two random sequences
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Increasing sequences of independent points on the planar lattice