Longest increasing paths with gaps
Preprint
Abstract
We consider a variant of the continuous and discrete Ulam-Hammersley problems: we study the maximal length of an increasing path through a Poisson point process (or a Bernoulli point process) with the restriction that there must be minimal gaps between abscissae and ordinates of successive points of the path.For both cases (continuous and discrete) our approach rely on couplings with well-studied models: respectively the classical Ulam-Hammersley problem and last-passage percolation with geometric weights. Thanks to these couplings we obtain explicit limiting shapes in both settings.We also establish that, as in the classical Ulam-Hammersley problem, the fluctuations around the mean are given by the Tracy-Widom distribution.Keywords
All Related Versions
This publication has 16 references indexed in Scilit:
- Order of the Variance in the Discrete Hammersley Process with BoundariesJournal of Statistical Physics, 2019
- Optimality Regions and Fluctuations for Bernoulli Last Passage ModelsMathematical Physics, Analysis and Geometry, 2018
- The Surprising Mathematics of Longest Increasing Subsequences2014
- On Two Variants of the Longest Increasing Subsequence Problem2009
- Exact solution of the Bernoulli matching model of sequence alignmentJournal of Statistical Mechanics: Theory and Experiment, 2008
- Bethe Ansatz in the Bernoulli matching model of random sequence alignmentPhysical Review E, 2008
- Exact asymptotic results for the Bernoulli matching model of sequence alignmentPhysical Review E, 2005
- Hydrodynamical methods for analyzing longest increasing subsequencesJournal of Computational and Applied Mathematics, 2002
- Shape Fluctuations and Random MatricesCommunications in Mathematical Physics, 2000
- On the distribution of the length of the longest increasing subsequence of random permutationsJournal of the American Mathematical Society, 1999