Skip to main content Accessibility help
×
Home

Asymmetric Rényi Problem

  • M. DRMOTA (a1), A. MAGNER (a2) and W. SZPANKOWSKI (a3)

Abstract

In 1960 Rényi, 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 (Hn), before at least one element is recovered (Fn), and to recover a randomly chosen element (Dn). This problem exhibits several remarkable behaviours: Dn converges in probability but not almost surely; Hn and Fn 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 +{\tfrac{1}{2}} \log_{p/(1-p)}\log n +o(\log \log n)$$
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 +\sqrt{2 \log_{2} n} +o(\sqrt{\log n})$$
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.

Copyright

Footnotes

Hide All

Research partially supported by Austrian Science Foundation FWF grant F50-02.

Research supported by NSF Center for Science of Information (CSoI) grant CCF-0939370.

§

Research partially supported by NSF Center for Science of Information (CSoI) grant CCF-0939370, and in addition by NSF grants CCF-1524312, and NIH grant 1U01CA198941-01.

Footnotes

References

Hide All
[1]Abramowitz, M. and Stegun, I. A. (1964) Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables, Vol. 55 of National Bureau of Standards Applied Mathematics Series, US Government Printing Office.
[2]Devroye, L. (1992) A note on the probabilistic analysis of PATRICIA trees. Random Struct. Alg. 3 203214.
[3]Devroye, L. (2002) Laws of large numbers and tail inequalities for random tries and PATRICIA trees. J. Comput. Appl. Math. 142 2737.
[4]Devroye, L. (2005) Universal asymptotics for random tries and PATRICIA trees. Algorithmica 42 1129.
[5]Drmota, M., Krattenthaler, C. and Pogudin, G. (2017) Problem 11997, The Amer. Math. Monthly, vol. 124, number 7, p. 660.
[6]Drmota, M., Magner, A. and Szpankowski, W. (2016) Asymmetric Rényi problem and PATRICIA tries. In 27th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms.
[7]Drmota, M., Magner, A. and Szpankowski, W. (2017) Asymmetric Rényi problem. arXiv:1711.01528
[8]Drmota, M. and Szpankowski, W. (2011) The expected profile of digital search trees. J. Combin. Theory Ser. A 118 19391965.
[9]Flajolet, P., Gourdon, X. and Dumas, P. (1995) Mellin transforms and asymptotics: Harmonic sums. Theoret. Comput. Sci. 144 358.
[10]Flajolet, P. and Sedgewick, R. (2009) Analytic Combinatorics, Cambridge University Press.
[11]Jacquet, P. and Szpankowski, W. (1998) Analytical depoissonization and its applications. Theoret. Comput. Sci. 201 162.
[12]Janson, S. and Szpankowski, W. (1997) Analysis of an asymmetric leader election algorithm. Electron. J. Combin. 4 #R17.
[13]Kazemi, R. and Vahidi-Asl, M. (2011) The variance of the profile in digital search trees. Discrete Math. Theoret. Comput. Sci. 13 2138.
[14]Knuth, D. E. (1998) The Art of Computer Programming, Vol. 3: Sorting and Searching, second edition, Addison Wesley Longman.
[15]Magner, A. (2015) Profiles of PATRICIA tries. PhD thesis, Purdue University.
[16]Magner, A., Knessl, C. and Szpankowski, W. (2014) Expected external profile of PATRICIA tries. In Eleventh Workshop on Analytic Algorithmics and Combinatorics, SIAM, pp. 1624.
[17]Magner, A. and Szpankowski, W. (2016) Profiles of PATRICIA tries. Algorithmica 76 167.
[18]Park, G., Hwang, H.-K., Nicodème, P. and Szpankowski, W. (2009) Profiles of tries. SIAM J. Comput. 38 18211880.
[19]Pittel, B. (1985) Asymptotic growth of a class of random trees. Ann. Probab. 18 414427.
[20]Pittel, B. and Rubin, H. (1990) How many random questions are needed to identify n distinct objects? J. Combin. Theory Ser. A 55 292312.
[21]Rényi, A. (1961) On random subsets of a finite set. Mathematica 3 355362.
[22]Szpankowski, W. (1990) PATRICIA tries again revisited. J. Assoc. Comput. Mach. 37 691711.
[23]Szpankowski, W. (2001) Average Case Analysis of Algorithms on Sequences, Wiley.

MSC classification

Asymmetric Rényi Problem

  • M. DRMOTA (a1), A. MAGNER (a2) and W. SZPANKOWSKI (a3)

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed