Longest increasing paths with gaps

Research output: Contribution to journalArticlepeer-review

Abstract

We consider a variant of the continuous and discrete Ulam-Hammersley problems: we study the maximal number of points 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.

Original languageEnglish
Pages (from-to)1141-1163
Number of pages23
JournalAlea (Rio de Janeiro)
Volume16
Issue number2
DOIs
Publication statusPublished - 1 Jan 2019

Keywords

  • BLIP (bernoulli longest increasing paths)
  • Combinatorial probability
  • Hammersley's process
  • Last-passage percolation
  • Longest in-creasing paths
  • Longest increasing subsequences
  • TASEP
  • Ulam's problem

Fingerprint

Dive into the research topics of 'Longest increasing paths with gaps'. Together they form a unique fingerprint.

Cite this