Skip to Main content Skip to Navigation
Journal articles

From Hammersley's lines to Hammersley's trees

Abstract : We construct a stationary random tree, embedded in the upper half plane, with prescribed offspring distribution and whose vertices are the atoms of a unit Poisson point process. This process which we call Hammersley's tree process extends the usual Hammersley's line process. Just as Hammersley's process is related to the problem of the longest increasing subsequence, this model also has a combinatorial interpretation: it counts the number of heaps (i.e. increasing trees) required to store a random permutation. This problem was initially considered by Byers et. al (2011) and Istrate and Bonchis (2015) in the case of regular trees. We show, in particular, that the number of heaps grows logarithmically with the size of the permutation.
Document type :
Journal articles
Complete list of metadata
Contributor : Anne-Laure Basdevant <>
Submitted on : Tuesday, May 10, 2016 - 9:48:45 AM
Last modification on : Tuesday, March 2, 2021 - 10:24:41 AM
Long-term archiving on: : Tuesday, November 15, 2016 - 10:53:00 PM


Files produced by the author(s)



Anne-Laure Basdevant, Lucas Gerin, Jean-Baptiste Gouere, Arvind Singh. From Hammersley's lines to Hammersley's trees. Probability Theory and Related Fields, Springer Verlag, 2017, ⟨10.1007/s00440-017-0772-2⟩. ⟨hal-01313542⟩



Record views


Files downloads