Longest increasing subsequences for distributions with atoms, and an inhomogeneous Hammersley process

Abstract We investigate the asymptotic behaviour of the longest increasing subsequence upper L Subscript n L n $L_n$ in a sequence of i.i.d. random variables, for an arbitrary distribution. If the common distribution is atomless then a famous result by Hammersley and Veršik-Kerov states that upper L Subscript n L n $L_n$ grows like 2 StartRoot n EndRoot 2 n $2\sqrt {n}$ . For any discrete distribution, we characterize the asymptotic order of upper L Subscript n L n $L_n$ through a variational problem and provide explicit estimates for classical distributions. The proofs rely on a coupling with an inhomogeneous version of the discrete-time continuous-space Hammersley process. This reveals that, in contrast to the continuous case, the discrete setting exhibits a wide range of growth rates between script upper O left parenthesis 1 right parenthesis O ( 1 ) $\mathcal{O}(1)$ and o left parenthesis StartRoot n EndRoot right parenthesis o ( n ) $o(\sqrt {n})$ , depending on the tail behaviour of the distribution. We can then easily deduce the asymptotics of upper L Subscript n L n $L_n$ for a completely arbitrary distribution.

Authors

Institutions

Publication Details

Journal
Combinatorics Probability Computing
Published
2026-10-26
DOI
https://doi.org/10.1017/s0963548326100583
Primary Topic
Stochastic processes and statistical mechanics
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Longest increasing subsequences for distributions with atoms, and an inhomogeneous Hammersley process

Lucas Gerin, Anne-Laure Basdevant, Maxime Marivain
Combinatorics Probability Computing
Stochastic processes and statistical mechanics
article

Longest increasing subsequences for distributions with atoms, and an inhomogeneous Hammersley process

Lucas Gerin, Anne-Laure Basdevant, Maxime Marivain
article en

Abstract

Abstract We investigate the asymptotic behaviour of the longest increasing subsequence upper L Subscript n L n $L_n$ in a sequence of i.i.d. random variables, for an arbitrary distribution. If the common distribution is atomless then a famous result by Hammersley and Veršik-Kerov states that upper L Subscript n L n $L_n$ grows like 2 StartRoot n EndRoot 2 n $2\sqrt {n}$ . For any discrete distribution, we characterize the asymptotic order of upper L Subscript n L n $L_n$ through a variational problem and provide explicit estimates for classical distributions. The proofs rely on a coupling with an inhomogeneous version of the discrete-time continuous-space Hammersley process. This reveals that, in contrast to the continuous case, the discrete setting exhibits a wide range of growth rates between script upper O left parenthesis 1 right parenthesis O ( 1 ) $\mathcal{O}(1)$ and o left parenthesis StartRoot n EndRoot right parenthesis o ( n ) $o(\sqrt {n})$ , depending on the tail behaviour of the distribution. We can then easily deduce the asymptotics of upper L Subscript n L n $L_n$ for a completely arbitrary distribution.

Combinatorics Probability Computing
École Polytechnique (FR), Sorbonne Université (FR), Université Paris Nanterre (FR), Centre de Mathématiques Appliquées de l'École polytechnique (FR), Laboratoire de Probabilités, Statistique et Modélisation (FR)
Openalex Percentile: Top 89%
Stochastic processes and statistical mechanics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon
Longest increasing subsequences for distributions with atoms, and an inhomogeneous Hammersley process — Lucas Gerin, Anne-Laure Basdevant, et al. · Combinatorics Probability Computing (2026) | TGRS Research Map | TGRS