Skip to main navigation Skip to search Skip to main content

Longest increasing paths with Lipschitz constraints

Research output: Contribution to journalArticlepeer-review

Abstract

The Hammersley problem asks for the maximal number of points in a monotonous path through a Poisson point process. It is exactly solvable and notoriously known to belong to the KPZ universality class, with a cube-root scaling for the fluctuations. Here we introduce and analyze a variant in which we impose a Lipschitz condition on paths. Thanks to a coupling with the classical Hammersley problem we observe that this variant is also exactly solvable. It allows us to derive first and second order asymptotics. It turns out that the cube-root scaling only holds for certain choices of the Lipschitz constants.

Original languageEnglish
Pages (from-to)1849-1868
Number of pages20
JournalAnnales de l'institut Henri Poincare (B) Probability and Statistics
Volume58
Issue number3
DOIs
Publication statusPublished - 1 Aug 2022
Externally publishedYes

Keywords

  • Combinatorial probability
  • Cube-root fluctuations
  • Hammersley's process
  • Last-passage percolation
  • Longest increasing paths
  • Longest increasing subsequences

Fingerprint

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

Cite this