Longest increasing paths with Lipschitz constraints

DOI10.1214/21-AIHP1220MaRDI QIDQ2157463zbMATH OpenFDO

Authors Anne-Laure Basdevant, L. Gerin

Publication date 22 July 2022

Published in Annales de l'Institut Henri Poincaré. Probabilités et Statistiques (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2001.06290

zbMATH Keywords

combinatorial probabilitylast-passage percolationlongest increasing subsequencesHammersley's processcube-root fluctuationslongest increasing paths

Mathematics Subject Classification ID

Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Combinatorial probability (60C05)

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 orders asymptotics. It turns out that the cube-root scaling only holds for certain choices of the Lipschitz constants.

Recommendations

• Longest increasing paths with gaps
• Ulam's problem and Hammersley's process
• Transversal fluctuations for increasing subsequences on the plane
• Hammersley's interacting particle process and longest increasing subsequences
• Soft edge results for longest increasing paths on the planar lattice

Cites work

• scientific article; zbMATH DE number 3630761 (Why is no real title available?)
• scientific article; zbMATH DE number 3373691 (Why is no real title available?)
• Beyond Hammersley's last-passage percolation: a discussion on possible local and global constraints
• Entropy-controlled last-passage percolation
• Hammersley's interacting particle process and longest increasing subsequences
• Hammersley's process with sources and sinks
• Hydrodynamical methods for analyzing longest increasing subsequences
• Increasing sequences of independent points on the planar lattice
• Kardar-Parisi-Zhang universality
• Limiting curves for i.i.d. records
• Longest convex chains
• Longest increasing paths with gaps
• Modulus of continuity for polymer fluctuations and weight profiles in Poissonian last passage percolation
• On the distribution of the length of the longest increasing subsequence of random permutations
• On the local fluctuations of last-passage percolation models
• Second class particles and cube root asymptotics for Hammersley's process
• The competition of roughness and curvature in area-constrained polymer models
• The surprising mathematics of longest increasing subsequences
• Transversal fluctuations for increasing subsequences on the plane

Cited in

(4)

• Longest increasing path within the critical strip
• Maintaining longest paths incrementally
• Soft edge results for longest increasing paths on the planar lattice
• Longest increasing paths with gaps

This page was built for publication: Longest increasing paths with Lipschitz constraints

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