Longest increasing paths with Lipschitz constraints
DOI10.1214/21-AIHP1220zbMath1493.60018arXiv2001.06290MaRDI QIDQ2157463
Anne-Laure Basdevant, Lucas 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
combinatorial probabilitylast-passage percolationlongest increasing subsequencesHammersley's processcube-root fluctuationslongest increasing paths
Interacting random processes; statistical mechanics type models; percolation theory (60K35) Combinatorial probability (60C05) Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55)
Cites Work
- Unnamed Item
- Unnamed Item
- Second class particles and cube root asymptotics for Hammersley's process
- Increasing sequences of independent points on the planar lattice
- Transversal fluctuations for increasing subsequences on the plane
- Hydrodynamical methods for analyzing longest increasing subsequences
- The competition of roughness and curvature in area-constrained polymer models
- Hammersley's process with sources and sinks
- Limiting curves for i.i.d. records
- Hammersley's interacting particle process and longest increasing subsequences
- Beyond Hammersley's last-passage percolation: a discussion on possible local and global constraints
- Modulus of continuity for polymer fluctuations and weight profiles in Poissonian last passage percolation
- Entropy-controlled last-passage percolation
- On the local fluctuations of last-passage percolation models
- Kardar-Parisi-Zhang Universality
- The Surprising Mathematics of Longest Increasing Subsequences
- Longest convex chains
- On the distribution of the length of the longest increasing subsequence of random permutations
- Longest increasing paths with gaps
This page was built for publication: Longest increasing paths with Lipschitz constraints