From Hammersley's lines to Hammersley's trees
From MaRDI portal
Publication:1647922
DOI10.1007/s00440-017-0772-2zbMath1392.60015arXiv1605.02981MaRDI QIDQ1647922
Jean-Baptiste Gouéré, Lucas Gerin, Arvind Singh, Anne-Laure Basdevant
Publication date: 27 June 2018
Published in: Probability Theory and Related Fields (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1605.02981
interacting particles systems; longest increasing subsequences; Hammersley process; heap sorting; patience sorting
60K35: Interacting random processes; statistical mechanics type models; percolation theory
60C05: Combinatorial probability
60G55: Point processes (e.g., Poisson, Cox, Hawkes processes)
Related Items
Almost-sure asymptotics for the number of heaps inside a random sequence, On a toy network of neurons interacting through their dendrites, Efficient methods of calculating the number of heapable permutations
Cites Work
- Subadditive ergodic theory
- A variational problem for random Young tableaux
- Exact limiting shape for a simplified model of first-passage percolation on the plane
- Increasing sequences of independent points on the planar lattice
- Hydrodynamical methods for analyzing longest increasing subsequences
- Hammersley's process with sources and sinks
- Hammersley's interacting particle process and longest increasing subsequences
- Discrete Hammersley's Lines with sources and sinks
- The Surprising Mathematics of Longest Increasing Subsequences
- Partition into Heapable Sequences, Heap Tableaux and a Multiset Extension of Hammersley’s Process
- On the distribution of the length of the longest increasing subsequence of random permutations
- Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem
- Unnamed Item