Almost-sure asymptotic for the number of heaps inside a random sequenceReport as inadecuate




Almost-sure asymptotic for the number of heaps inside a random sequence - Download this document for free, or read online. Document in PDF available to download.

1 MODAL-X - Modélisation aléatoire de Paris X 2 LM-Orsay - Laboratoire de Mathématiques d-Orsay

Abstract : We study the minimum number of heaps required to sort a random sequence using a generalization of Istrate and Bonchis-s algorithm 2015. In a previous paper, the authors proved that the expected number of heaps grows logarithmically. In this note, we improve on the previous result by establishing the almost-sure and L 1 convergence.

Keywords : Hammersley-s process Heap sorting Patience sorting Longest increasing subsequences Interacting particles systems Almost-sure convergence





Author: Anne-Laure Basdevant - Arvind Singh -

Source: https://hal.archives-ouvertes.fr/



DOWNLOAD PDF




Related documents