How often do we reject a superior value? (Extended abstract)
Discrete mathematics & theoretical computer science, DMTCS Proceedings vol. AO, 23rd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2011), DMTCS Proceedings vol. AO, 23rd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2011) (2011).

Voir la notice de l'article provenant de la source Episciences

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.
@article{DMTCS_2011_special_260_a62,
     author = {Oliver, Kamilla and Prodinger, Helmut},
     title = {How often do we reject a superior value? {(Extended} abstract)},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {DMTCS Proceedings vol. AO, 23rd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2011)},
     year = {2011},
     doi = {10.46298/dmtcs.2949},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2949/}
}
TY  - JOUR
AU  - Oliver, Kamilla
AU  - Prodinger, Helmut
TI  - How often do we reject a superior value? (Extended abstract)
JO  - Discrete mathematics & theoretical computer science
PY  - 2011
VL  - DMTCS Proceedings vol. AO, 23rd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2011)
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2949/
DO  - 10.46298/dmtcs.2949
LA  - en
ID  - DMTCS_2011_special_260_a62
ER  - 
%0 Journal Article
%A Oliver, Kamilla
%A Prodinger, Helmut
%T How often do we reject a superior value? (Extended abstract)
%J Discrete mathematics & theoretical computer science
%D 2011
%V DMTCS Proceedings vol. AO, 23rd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2011)
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2949/
%R 10.46298/dmtcs.2949
%G en
%F DMTCS_2011_special_260_a62
Oliver, Kamilla; Prodinger, Helmut. How often do we reject a superior value? (Extended abstract). Discrete mathematics & theoretical computer science, DMTCS Proceedings vol. AO, 23rd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2011), DMTCS Proceedings vol. AO, 23rd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2011) (2011). doi : 10.46298/dmtcs.2949. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2949/

Cité par Sources :