Almost-sure asymptotics for the number of heaps inside a random sequence
From MaRDI portal
Publication:1748569
DOI10.1214/18-ECP120zbMath1388.60072arXiv1702.06444MaRDI QIDQ1748569
Anne-Laure Basdevant, Arvind Singh
Publication date: 11 May 2018
Published in: Electronic Communications in Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1702.06444
interacting particles systemsalmost-sure convergencelongest increasing subsequencesHammersley processheap sortingpatience sorting
Strong limit theorems (60F15) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55)
Related Items (1)
Cites Work
This page was built for publication: Almost-sure asymptotics for the number of heaps inside a random sequence