Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Nabil, Lasmar"'
Autor:
Rafik, Aguech1,2 raguech@ksu.edu.sa, Nabil, Lasmar3 nabillasmar@yahoo.fr, Olfa, Selmi2 selmiolfa3@yahoo.fr
Publikováno v:
Annals of the Institute of Statistical Mathematics. Apr2019, Vol. 71 Issue 2, p389-408. 20p.
Publikováno v:
Lasmar, N, Mailler, C & Selmi, O 2018, ' Multiple drawing multi-colour urns by stochastic approximation ', Journal of Applied Probability, vol. 55, no. 1, pp. 254-281 . https://doi.org/10.1017/jpr.2018.16
A classical P��lya urn scheme is a Markov process whose evolution is encoded by a replacement matrix $(R_{i,j})_{1\leq i,j\leq d}$. At every discrete time-step, we draw a ball uniformly at random, denote its colour $c$, and replace it in the urn
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::254c5450a22172e9f50b25c1147fcbdc
https://doi.org/10.1017/jpr.2018.16
https://doi.org/10.1017/jpr.2018.16
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AD,..., Iss Proceedings (2005)
We investigate distances between pairs of nodes in digital trees (digital search trees (DST), and tries). By analytic techniques, such as the Mellin Transform and poissonization, we describe a program to determine the moments of these distances. The
Externí odkaz:
https://doaj.org/article/90da9a2bba5840bfb221d0eb9808af14
Publikováno v:
Probability in the Engineering and Informational Sciences. 21:133-141
We consider weighted path lengths to the extremal leaves in a random binary search tree. When linearly scaled, the weighted path length to the minimal label has Dickman's infinitely divisible distribution as a limit. By contrast, the weighted path le
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::574b65ae4091d5ea22269065f878cdaa
https://doi.org/10.1017/s026996480707009x
https://doi.org/10.1017/s026996480707009x
Publikováno v:
Acta Informatica. 43:243-264
Distances between nodes in random trees is a popular topic, and several classes of trees have recently been investigated. We look into this matter in digital search trees. By analytic techniques, such as the Mellin Transform and poissonization, we de
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c9e3e2675f2e13dd5f59ab4c8be87d5d
https://doi.org/10.1007/s00236-006-0019-7
https://doi.org/10.1007/s00236-006-0019-7
Publikováno v:
Journal of Applied Probability. 43:377-390
The trie is a sort of digital tree. Ideally, to achieve balance, the trie should grow from an unbiased source generating keys of bits with equal likelihoods. In practice, the lack of bias is not always guaranteed. We investigate the distance between
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::86d3eba6ecde2a13ba3abe466ec60193
https://doi.org/10.1017/s0021900200001704
https://doi.org/10.1017/s0021900200001704
Publikováno v:
Discrete Mathematics and Theoretical Computer Science
2005 International Conference on Analysis of Algorithms
2005 International Conference on Analysis of Algorithms, 2005, Barcelona, Spain. pp.1-10
2005 International Conference on Analysis of Algorithms
2005 International Conference on Analysis of Algorithms, 2005, Barcelona, Spain. pp.1-10
We investigate distances between pairs of nodes in digital trees (digital search trees (DST), and tries). By analytic techniques, such as the Mellin Transform and poissonization, we describe a program to determine the moments of these distances. The
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::334e5220a2ba56168a5f6ad5959509bc
https://hal.inria.fr/hal-01184045/file/dmAD0101.pdf
https://hal.inria.fr/hal-01184045/file/dmAD0101.pdf
Publikováno v:
Probability in the Engineering & Informational Sciences; Jan2007, Vol. 21 Issue 1, p133-141, 9p