# How often do we reject a superior value? (Extended abstract)

Abstract : Words $a_1 a_2 \ldots a_n$ with independent letters $a_k$ taken from the set of natural numbers, and a weight (probability) attached via the geometric distribution $pq^{i-1}(p+q=1)$ are considered. A consecutive record (motivated by the analysis of a skip list structure) can only advance from $k$ to $k+1$, thus ignoring perhaps some larger (=superior) values. We investigate the number of these rejected superior values. Further, we study the probability that there is a single consecutive maximum and show that (apart from fluctuations) it tends to a constant.
Keywords :
Document type :
Conference papers
Domain :

Cited literature [13 references]

https://hal.inria.fr/hal-01215069
Contributor : Coordination Episciences Iam Connect in order to contact the contributor
Submitted on : Tuesday, October 13, 2015 - 3:06:08 PM
Last modification on : Friday, April 10, 2020 - 10:46:12 AM
Long-term archiving on: : Thursday, April 27, 2017 - 12:00:31 AM

### File

dmAO0165.pdf
Publisher files allowed on an open archive

### Citation

Kamilla Oliver, Helmut Prodinger. How often do we reject a superior value? (Extended abstract). 23rd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2011), 2011, Reykjavik, Iceland. pp.741-752, ⟨10.46298/dmtcs.2949⟩. ⟨hal-01215069⟩

Record views