Phase change of limit laws in the quicksort recurrence under varying toll functions

SIAM Journal on Computing

Volumn 31, Issue 6, 2002, Pages 1687-1722

  Hwang, Hsien Kuei ^a   Neininger, Ralph ^b  

^a INSTITUTE OF STATISTICAL SCIENCE   (Taiwan)

^b MCGILL UNIVERSITY   (Canada)

Author keywords

Analysis of algorithms; Binary search trees; Contraction method; Limit distribution; Method of moments; Quicksort

Indexed keywords

ALGORITHMS; FUNCTIONS; MATHEMATICAL MODELS; METHOD OF MOMENTS;

BINARY SEARCH TREE; CONTRACTION METHOD; LIMIT DISTRIBUTION; QUICKSORT;

RANDOM PROCESSES;

EID: 0036766889     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S009753970138390X     Document Type: Article

References (76)

1. D. Aldous, Asymptotic fringe distributions for general families of random trees, Ann. Appl. Probab., 1 (1991), pp. 228-266.
2. A. Andersson, A note on the expected behaviour of binary tree traversals, Comput. J., 33 (1990), pp. 471-472.
3. Z.-D. Bai, H.-K. Hwang, and W.-Q. Liang, Normal approximations of the number of records in geometrically distributed random variables, Random Structures Algorithms, 13 (1998), pp. 319-334.
4. A. D. Barbour and S. Tavaré, A rate for the Erdös-Turán law, Combin. Probab. Comput., 3 (1994), pp. 167-176.
5. J. L. Bentley and M. D. McIlroy, Engineering a sort function, Software-Practice and Experience, 23 (1993), pp. 1249-1265.
6. F. Bergeron, P. Flajolet, and B. Salvy, Varieties of increasing trees. in CAAP'92 (Rennes, 1992), Lecture Notes in Comput. Sci. 581, Springer-Verlag, Berlin, 1992. pp. 24-48.
7. P. J. Bickel and P. A. Freedman, Some asymptotic theory for the bootstrap, Ann. Statist., 9 (1981), pp. 1196-1217.
8. P. Billingsley, Probability and Measure, 3rd ed., John Wiley and Sons, New York, 1995.
9. N. H. Bingham, C. M. Goldie, and J. L. Teugels, Regular Variation, Cambridge University Press, Cambridge, UK, 1989.
10. K. Brinck, The expected performance of traversal algorithms in binary trees. Comput. J., 28 (1985), pp. 426-432.
11. K. Brinck and N. Y. Foo, Analysis of algorithms on threaded trees, Comput. J., 24 (1981), pp. 148-155.
12. W. A. Burkhard, Nonrecursive traversals of trees, Comput. J., 18 (1975), pp. 227-230.
13. W. A. Burkhard, Corrigendum: Nonrecursive traversals of trees, Comput. J., 20 (1977), p. 352.
14. H.-H. Chern and H.-K. Hwang, Phase changes in random m-ary search trees and generalized quicksort, Random Structures Algorithms, 19 (2001), pp. 316-358.
15. H.-H. Chern, H.-K. Hwang, and T.-H. Tsai, An asymptotic theory for Cauchy-Euler differential equations with applications to the analysis of algorithms, J. Algorithms, to appear.
16. T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms, MIT Press, Cambridge, MA, 1990.
17. M. Cramer and L. Rüschendorf, Analysis of recursive algorithms by the contraction method, in Proceedings of the Athens Conference on Applied Probability and Time Series Analysis, Athens, Greece, 1995, C. C. Heyde et al., eds., Lecture Notes in Statist. 114, Springer-Verlag, New York, 1996, pp. 18-33.
18. L. Devroye, Limit laws for local counters in random binary search trees, Random Structures Algorithms, 2 (1991), pp. 303-315.
19. L. Devroye, Universal limit laws for depths in random trees, SIAM J. Comput., 28 (1998), pp. 409-432.
20. L. Devroye, Limit laws for sums of functions of subtrees of random binary search trees, SIAM J. Comput., to appear.
21. P. Diaconis, Application of the method of moments in probability and statistics, in Moments in Mathematics (San Antonio, TX, 1987), AMS, Providence, RI, 1987, pp. 125-142.
22. R. P. Dobrow and J. A. Fill, Total path length for random recursive trees. Combin. Probab. Comput., 8 (1999), pp. 317-333.
23. B. Dwyer, Simple algorithms for traversing a tree without an auxiliary stack, Inform. Process. Lett., 2 (1974), pp. 143-145.
24. T. I. Fenner and G. Loizou, A note on traversal algorithms for triply linked trees, BIT, 21 (1981), pp. 153-156.
25. J. A. Fill, On the distribution of binary search trees under the random permutation model, Random Structures Algorithms, 8 (1996), pp. 1-25.
26. J. A. Fill and S. Janson, Smoothness and decay properties of the limiting quicksort density function, in Mathematics and Computer Science: Algorithms, Trees, Combinatorics, and Probabilities, D. Gardy and A. Mokkadem, eds., Birkhäuser, Basel, 2000, pp. 53-64.
27. J. A. Fill, H. Mahmoud, and W. Szpankowski, On the distribution for the duration of a randomized leader election algorithm, Ann. Appl. Probabl., 6 (1996), pp. 1260-1283.
28. P. Flajolet, X. Gourdon, and C. Martínez, Patterns in random binary search trees, Random Structures Algorithms, 11 (1997), pp. 223-244.
29. P. Flajolet and A. Odlyzko, Singularity analysis of generating functions, SIAM J. Discrete Math., 3 (1990), pp. 216-240.
30. P. Flajolet, P. Poblete, and A. Viola, On the analysis of linear probing hashing. Algorithmica, 22 (1998), pp. 490-515.
31. G. H. Gonnet and R. Baeza-Yates, Handbook of Algorithms and Data Structures, Addison-Wesley, Reading, MA, 1991.
32. D. Gordon, Eliminating the flag in threaded binary search trees, Inform. Process. Lett., 23 (1986), pp. 209-214.
33. P. Grabner and H. Prodinger, Sorting algorithms for broadcast communications: Mathematical analysis, Theoret. Comput. Sci., to appear.
34. I. Gutman, S. Klavzar, and B. Mohar, eds., Fifty years of the Wiener index. Match, 35 (1997), pp. 1-259.
35. P. Hennequin, Combinatorial analysis of quicksort algorithm, RAIRO Inform. Théor. Appl., 23 (1989), pp. 317-333.
36. P. Hennequin, Analyse en moyenne d'algorithme, tri rapide et arbres de recherche, Ph.D. thesis, Ecole Polytechnique, Palaiseau, France, 1991.
37. C. A. R. Hoare, Quicksort, Comput. J., 5 (1962), pp. 10-15.
38. M. Hofri and H. Shachnai, Efficient reorganization of binary search trees, in Algorithms and Complexity (Rome, 1994), Lecture Nots in Comput. Sci. 778, Springer-Verlag, Berlin, 1994, pp. 152-166.
39. H.-K. Hwang, Asymptotics of Poisson approximation to random discrete distributions: An analytic approach, Adv. in Appl. Probabl., 31 (1999), pp. 448-491.
40. H.-K. Hwang and T.-H. Tsai, Quickselect and Dickman function, Combin. Probab. Comput., to appear.
41. J. JaJa, A perspective on quicksort, Computing in Science and Engineering, 2 (2000), pp. 43-49.
42. P. Kirschenhofer, H. Prodinger, and R. F. Tichy, A contribution to the analysis of in situ permutation, Glas. Mat. Ser. III, 22 (1987), pp. 269-278.
43. D. E. Knuth, Mathematical analysis of algorithms. in Information Processing '71, Proceedings of the IFIP Congress, Ljubljana, 1971, Vol. 1: Foundations and systems, North-Holland, Amsterdam, 1972, pp. 19-27.
44. M. Loève, Probability Theory I, 4th ed., Springer-Verlag, New York, 1977.
45. I. D. G. MacLeod, An algorithm for in-situ permutation, Austral. Comput. J., 2 (1970), pp. 16-19.
46. M. Maejima and S. T. Rachey, An ideal metric and the rate of convergence to a self similar process, Ann. Probab., 15 (1987), pp. 708-727.
47. H. M. Mahmoud, Limiting distributions for path lengths in recursive trees, Probab. Engrg. Inform. Sci., 5 (1991), pp. 53-59.
48. H. M. Mahmoud, Evolution of Random Search Trees, John Wiley and Sons, New York, 1992.
49. H. M. Mahmoud, Sorting. A Distribution Theory, Wiley-Interscience, New York, 2000.
50. H. M. Mahmoud, R. Modarres, and R. T. Smythe, Analysis of quickselect: An algorithm for order statistics, RAIRO Inform. Théor. Appl., 29 (1995), pp. 255-276.
51. J. M. Morris, Traversing binary trees simply and cheaply, Inform. Process. Lett., 9 (1979), pp. 197-200.
52. R. Neininger, Limit Laws for Random Recursive Structures Algorithms, Ph.D. Dissertation, Institut für Mathematische Stochastik, Universität Freiburg, Freiburg, Germany, 1999: also available online from www.stochastik.uni-freiburg.de/homepages/neiniger/.
53. R. Neininger, On a multivariate contraction method for random recursive structures with applications to quicksort, Random Structures Algorithms, 19 (2001), pp. 498-524.
54. R. Neininger, On binary search tree recursions with monomials as toll functions, J. Comput. Appl. Math., 142 (2002), pp. 185-196.
55. R. Neininger, Wiener index of random trees, Combin. Probab. Comput., to appear.
56. R. Neininger and L. Rüschendorf, A General Contraction Theorem and Asymptotic Normality in Combinatorial Structures, preprint, Institut für Mathematische Stochastik, Universität Freiburg, Freiburg, Germany, 2001; also available online from http://www.stochastik.uni-freiburg.de/homepages/neininger.
57. A. Panholzer and H. Prodinger, Binary search tree recursions with harmonic toll functions, J. Comput. Appl. Math., to appear.
58. B. Pittel, Normal convergence problem? Two moments and a recurrence may be the clues, Ann. Appl. Probab., 9 (1999), pp. 1260-1302.
59. H. Prodinger, How to select a loser, Discrete Math., 120 (1993), pp. 149-159.
60. S. T. Rachev, Probability Metrics and the Stability of Stochastic Models, John Wiley, New York, 1991.
61. S. T. Rachev and L. Rüschendorf, A new ideal metric with applications to multivariate stable limit theorems, Probab. Theory Related Fields, 94 (1992), pp. 163-187.
62. S. T. Rachev and L. Rüschendorf, Probability metrics and recursive algorithms, Adv. in Appl. Probab., 27 (1995), pp. 770-799.
63. S. T. Rachev and L. Rüschendorf, Mass Transportation Problems, Vol. 1: Theory, Springer-Verlag, New York, 1998.
64. M. Régnier, A limiting distribution for quicksort, RAIRO Inform. Théor. Appl., 23 (1989), pp. 335-343.
65. J. M. Robson, An improved algorithm for traversing binary trees without auxiliary stack, Inform. Process. Lett., 2 (1973), pp. 12-14.
66. U. Rösler, A limit theorem for "Quicksort," RAIRO Inform. Théor. Appl., 25 (1991), pp. 85-100.
67. U. Rösler, A fixed point theorem for distributions, Stochastic Process. Appl., 42 (1992), pp. 195-214.
68. U. Rösler, The analysis of stochastic divide and conquer algorithms, Algorithmica, 29 (2001), pp. 238-261.
69. U. Rösler and L. Rüschendorf, The contraction method for recursive algorithms, Algorithmica, 29 (2001), pp. 3-33.
70. W. Schachinger, Limiting distribution of the costs of partial match retrievals in multidimensional tries, Random Structures Algorithms, 17 (2000), pp. 428-459.
71. R. Sedgewick, Quicksort, Gurland Publishing, New York, 1980.
72. S.-H. Shiau and C.-B. Yang, A fast sorting algorithm and its generalization on broadcast communications, in Computing and Combinatorics (Sydney, 2000), Lecture Notes in Comput. Sci. 1858, Springer-Verlag, New York, 2000, pp. 252-261.
73. R. T. Smythe and H. M. Mahmoud, A survey of recursive trees, Theory Probab. Math. Statist., 51 (1996), pp. 1-27.
74. N. Trinajstić, Chemical Graph Theory, Vol. 2, CRC Press, Boca Raton, FL, 1983.
75. J. D. Valois, Introspective sorting and selection revisited, Software-Practice and Experience, 30 (2000), pp. 617-638.
76. V. M. Zolotarev, Ideal metrics in the problem of approximating distributions of sums of independent random variables, Theory Probab. Appl., 22 (1977), pp. 433-449.