Name
Abstract | ||
|---|---|---|
In 1960 Renyi, in his Michigan State University lectures, asked for the number of random queries necessary to recover a hidden bijective labelling of n distinct objects. In each query one selects a random subset of labels and asks, which objects have these labels? We consider here an asymmetric version of the problem in which in every query an object is chosen with probability p > 1/2 and we ignore 'inconclusive' queries. We study the number of queries needed to recover the labelling in its entirety (H-n), before at least one element is recovered (F-n), and to recover a randomly chosen element (D-n). This problem exhibits several remarkable behaviours: D-n converges in probability but not almost surely; H-n and F-n exhibit phase transitions with respect to p in the second term. We prove that for p > 1/2 with high probability we need H-n = log(1/p)n + 1/2 log(p/(1-p))logn + o(log logn) queries to recover the entire bijection. This should be compared to its symmetric (p = 1/2) counterpart established by Pittel and Rubin, who proved that in this case one requires H-n = log(2)n + root 2log(2)n + o(root logn) queries. As a bonus, our analysis implies novel results for random PATRICIA tries, as the problem is probabilistically equivalent to that of the height, fillup level, and typical depth of a PATRICIA trie built from n independent binary sequences generated by a biased(p) memoryless source. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1017/S0963548318000329 | COMBINATORICS PROBABILITY & COMPUTING |
DocType | Volume | Issue |
Journal | 28 | SP4 |
ISSN | Citations | PageRank |
0963-5483 | 0 | 0.34 |
References | Authors | |
0 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Michael Drmota | 1 | 438 | 54.46 |
| Abram Magner | 2 | 3 | 7.24 |
| Wojciech Szpankowski | 3 | 1557 | 192.33 |