We consider versions of the FIND algorithm where the pivot element used is the median of a subset chosen uniformly at random from the data. For the median selection we assume that subsamples of size asymptotic to $c \cdot n^\alpha$ are chosen, where $0 < \alpha \leq \frac{1}{2}$, $c > 0$ and $n$ is the size of the data set to be split. We consider the complexity of FIND as a process in the rank to be selected and measured by the number of key comparisons required. After normalization we show weak convergence of the complexity to a centered Gaussian process as $n \to \infty$, which depends on $\alpha$. The proof relies on a contraction argument for probability distributions on càdlàg functions. We also identify the covariance function of the Gaussian limit process and discuss path and tail properties.
Electron. J. Probab.
19:
1-28
(2014).
DOI: 10.1214/EJP.v19-2933
Adler, Robert J. An introduction to continuity, extrema, and related topics for general Gaussian processes. Institute of Mathematical Statistics Lecture NotesâMonograph Series, 12. Institute of Mathematical Statistics, Hayward, CA, 1990. x+160 pp. ISBN: 0-940600-17-X MR1088478Adler, Robert J. An introduction to continuity, extrema, and related topics for general Gaussian processes. Institute of Mathematical Statistics Lecture NotesâMonograph Series, 12. Institute of Mathematical Statistics, Hayward, CA, 1990. x+160 pp. ISBN: 0-940600-17-X MR1088478
Billingsley, Patrick. Convergence of probability measures. Second edition. Wiley Series in Probability and Statistics: Probability and Statistics. A Wiley-Interscience Publication. John Wiley & Sons, Inc., New York, 1999. x+277 pp. ISBN: 0-471-19745-9 MR1700749Billingsley, Patrick. Convergence of probability measures. Second edition. Wiley Series in Probability and Statistics: Probability and Statistics. A Wiley-Interscience Publication. John Wiley & Sons, Inc., New York, 1999. x+277 pp. ISBN: 0-471-19745-9 MR1700749
Blanchet, Jose H.; Sigman, Karl. On exact sampling of stochastic perpetuities. J. Appl. Probab. 48A (2011), New frontiers in applied probability: a Festschrift for Soren Asmussen, 165–182. ISBN: 0-902016-08-3 MR2865624 10.1239/jap/1318940463 euclid.jap/1318940463
Blanchet, Jose H.; Sigman, Karl. On exact sampling of stochastic perpetuities. J. Appl. Probab. 48A (2011), New frontiers in applied probability: a Festschrift for Soren Asmussen, 165–182. ISBN: 0-902016-08-3 MR2865624 10.1239/jap/1318940463 euclid.jap/1318940463
Boucheron, S., Lugosi, G. and Massart, P.: Concentration Inequalities: A Nonasymptotic Theory of Independence. Oxford University Press, (2013). MR3185193Boucheron, S., Lugosi, G. and Massart, P.: Concentration Inequalities: A Nonasymptotic Theory of Independence. Oxford University Press, (2013). MR3185193
Dadoun, B. and Neininger, R.: A statistical view on exchanges in Quickselect. Proceedings of the Eleventh Workshop on Analytic Algorithmics and Combinatorics (ANALCO), (2014), 40–51. arXiv:1307.8403 1307.8403 MR3248352Dadoun, B. and Neininger, R.: A statistical view on exchanges in Quickselect. Proceedings of the Eleventh Workshop on Analytic Algorithmics and Combinatorics (ANALCO), (2014), 40–51. arXiv:1307.8403 1307.8403 MR3248352
Devroye, Luc. Exponential bounds for the running time of a selection algorithm. J. Comput. System Sci. 29 (1984), no. 1, 1–7. MR761047 10.1016/0022-0000(84)90009-6Devroye, Luc. Exponential bounds for the running time of a selection algorithm. J. Comput. System Sci. 29 (1984), no. 1, 1–7. MR761047 10.1016/0022-0000(84)90009-6
Devroye, Luc. Simulating perpetuities. Methodol. Comput. Appl. Probab. 3 (2001), no. 1, 97–115. MR1833738 10.1023/A:1011470225335Devroye, Luc. Simulating perpetuities. Methodol. Comput. Appl. Probab. 3 (2001), no. 1, 97–115. MR1833738 10.1023/A:1011470225335
Devroye, L. On the probabilistic worst-case time of "find". Mathematical analysis of algorithms. Algorithmica 31 (2001), no. 3, 291–303. MR1855252 10.1007/s00453-001-0046-2Devroye, L. On the probabilistic worst-case time of "find". Mathematical analysis of algorithms. Algorithmica 31 (2001), no. 3, 291–303. MR1855252 10.1007/s00453-001-0046-2
Drmota, Michael; Janson, Svante; Neininger, Ralph. A functional limit theorem for the profile of search trees. Ann. Appl. Probab. 18 (2008), no. 1, 288–333. MR2380900 10.1214/07-AAP457 euclid.aoap/1199890024
Drmota, Michael; Janson, Svante; Neininger, Ralph. A functional limit theorem for the profile of search trees. Ann. Appl. Probab. 18 (2008), no. 1, 288–333. MR2380900 10.1214/07-AAP457 euclid.aoap/1199890024
Dudley, R. M. Sample functions of the Gaussian process. Ann. Probability 1 (1973), no. 1, 66–103. MR346884 10.1214/aop/1176997026Dudley, R. M. Sample functions of the Gaussian process. Ann. Probability 1 (1973), no. 1, 66–103. MR346884 10.1214/aop/1176997026
Eickmeyer, Kord; Rüchendorf, Ludger. A limit theorem for recursively defined processes in $L^ p$. Statist. Decisions 25 (2007), no. 3, 217–235. MR2412071Eickmeyer, Kord; Rüchendorf, Ludger. A limit theorem for recursively defined processes in $L^ p$. Statist. Decisions 25 (2007), no. 3, 217–235. MR2412071
Fill, James Allen; Huber, Mark Lawrence. Perfect simulation of Vervaat perpetuities. Electron. J. Probab. 15 (2010), no. 4, 96–109. MR2587562 10.1214/EJP.v15-734Fill, James Allen; Huber, Mark Lawrence. Perfect simulation of Vervaat perpetuities. Electron. J. Probab. 15 (2010), no. 4, 96–109. MR2587562 10.1214/EJP.v15-734
Fill, James Allen; Nakama, Takéhiko. Analysis of the expected number of bit comparisons required by Quickselect. Algorithmica 58 (2010), no. 3, 730–769. MR2672478 10.1007/s00453-009-9294-3Fill, James Allen; Nakama, Takéhiko. Analysis of the expected number of bit comparisons required by Quickselect. Algorithmica 58 (2010), no. 3, 730–769. MR2672478 10.1007/s00453-009-9294-3
Fill, James Allen; Nakama, Takehiko. Distributional convergence for the number of symbol comparisons used by QuickSelect. Adv. in Appl. Probab. 45 (2013), no. 2, 425–450. MR3102458 10.1017/S000186780000639X euclid.aap/1370870125
Fill, James Allen; Nakama, Takehiko. Distributional convergence for the number of symbol comparisons used by QuickSelect. Adv. in Appl. Probab. 45 (2013), no. 2, 425–450. MR3102458 10.1017/S000186780000639X euclid.aap/1370870125
Grabner, Peter J.; Prodinger, Helmut. On a constant arising in the analysis of bit comparisons in quickselect. Quaest. Math. 31 (2008), no. 4, 303–306. MR2527443 10.2989/QM.2008.31.4.1.605Grabner, Peter J.; Prodinger, Helmut. On a constant arising in the analysis of bit comparisons in quickselect. Quaest. Math. 31 (2008), no. 4, 303–306. MR2527443 10.2989/QM.2008.31.4.1.605
Grübel, Rudolf. Hoare's selection algorithm: a Markov chain approach. J. Appl. Probab. 35 (1998), no. 1, 36–45. MR1622443 10.1239/jap/1032192549 euclid.jap/1032192549
Grübel, Rudolf. Hoare's selection algorithm: a Markov chain approach. J. Appl. Probab. 35 (1998), no. 1, 36–45. MR1622443 10.1239/jap/1032192549 euclid.jap/1032192549
Grübel, Rudolf. On the median-of-$k$ version of Hoare's selection algorithm. Theor. Inform. Appl. 33 (1999), no. 2, 177–192. MR1707969 10.1051/ita:1999112Grübel, Rudolf. On the median-of-$k$ version of Hoare's selection algorithm. Theor. Inform. Appl. 33 (1999), no. 2, 177–192. MR1707969 10.1051/ita:1999112
Grübel, Rudolf; Rösler, Uwe. Asymptotic distribution theory for Hoare's selection algorithm. Adv. in Appl. Probab. 28 (1996), no. 1, 252–269. MR1372338 10.2307/1427920Grübel, Rudolf; Rösler, Uwe. Asymptotic distribution theory for Hoare's selection algorithm. Adv. in Appl. Probab. 28 (1996), no. 1, 252–269. MR1372338 10.2307/1427920
Hwang, Hsien-Kuei; Tsai, Tsung-Hsi. Quickselect and the Dickman function. Combin. Probab. Comput. 11 (2002), no. 4, 353–371. MR1918722 10.1017/S0963548302005138Hwang, Hsien-Kuei; Tsai, Tsung-Hsi. Quickselect and the Dickman function. Combin. Probab. Comput. 11 (2002), no. 4, 353–371. MR1918722 10.1017/S0963548302005138
Kirschenhofer, Peter; Prodinger, Helmut. Comparisons in Hoare's Find algorithm. Combin. Probab. Comput. 7 (1998), no. 1, 111–120. MR1611049 10.1017/S0963548397003325Kirschenhofer, Peter; Prodinger, Helmut. Comparisons in Hoare's Find algorithm. Combin. Probab. Comput. 7 (1998), no. 1, 111–120. MR1611049 10.1017/S0963548397003325
Kirschenhofer, P.; Prodinger, H.; MartÃnez, C. Analysis of Hoare's FIND algorithm with median-of-three partition. Average-case analysis of algorithms (Dagstuhl, 1995). Random Structures Algorithms 10 (1997), no. 1-2, 143–156. MR1611516Kirschenhofer, P.; Prodinger, H.; MartÃnez, C. Analysis of Hoare's FIND algorithm with median-of-three partition. Average-case analysis of algorithms (Dagstuhl, 1995). Random Structures Algorithms 10 (1997), no. 1-2, 143–156. MR1611516
Knape, Margarete; Neininger, Ralph. Approximating perpetuities. Methodol. Comput. Appl. Probab. 10 (2008), no. 4, 507–529. MR2443077 10.1007/s11009-007-9059-xKnape, Margarete; Neininger, Ralph. Approximating perpetuities. Methodol. Comput. Appl. Probab. 10 (2008), no. 4, 507–529. MR2443077 10.1007/s11009-007-9059-x
Knape, Margarete; Neininger, Ralph. Appendix to "Approximating perpetuities" []. Methodol. Comput. Appl. Probab. 15 (2013), no. 3, 707–712. MR3085887 10.1007/s11009-012-9299-2Knape, Margarete; Neininger, Ralph. Appendix to "Approximating perpetuities" []. Methodol. Comput. Appl. Probab. 15 (2013), no. 3, 707–712. MR3085887 10.1007/s11009-012-9299-2
Knof, D.: Struktur von Fixpunkten aus Prozess gleichungen. Dissertation, Christian-Albrechts-Universität zu Kiel, (2007). Electronically available via urn:nbn:de:gbv:8-diss-23169Knof, D.: Struktur von Fixpunkten aus Prozess gleichungen. Dissertation, Christian-Albrechts-Universität zu Kiel, (2007). Electronically available via urn:nbn:de:gbv:8-diss-23169
Knuth, Donald E. Mathematical analysis of algorithms. Information processing 71 (Proc. IFIP Congress, Ljubljana, 1971), Vol. 1: Foundations and systems, pp. 19–27. North-Holland, Amsterdam, 1972. MR403310Knuth, Donald E. Mathematical analysis of algorithms. Information processing 71 (Proc. IFIP Congress, Ljubljana, 1971), Vol. 1: Foundations and systems, pp. 19–27. North-Holland, Amsterdam, 1972. MR403310
Mahmoud, Hosam M. Average-case analysis of moves in Quick Select. ANALCO09âWorkshop on Analytic Algorithmics and Combinatorics, 35–40, SIAM, Philadelphia, PA, 2009. MR2648340Mahmoud, Hosam M. Average-case analysis of moves in Quick Select. ANALCO09âWorkshop on Analytic Algorithmics and Combinatorics, 35–40, SIAM, Philadelphia, PA, 2009. MR2648340
Mahmoud, Hosam M. Distributional analysis of swaps in Quick Select. Theoret. Comput. Sci. 411 (2010), no. 16-18, 1763–1769. MR2650339 10.1016/j.tcs.2010.01.029Mahmoud, Hosam M. Distributional analysis of swaps in Quick Select. Theoret. Comput. Sci. 411 (2010), no. 16-18, 1763–1769. MR2650339 10.1016/j.tcs.2010.01.029
Mahmoud, Hosam M.; Modarres, Reza; Smythe, Robert T. Analysis of QUICKSELECT: an algorithm for order statistics. RAIRO Inform. Théor. Appl. 29 (1995), no. 4, 255–276. MR1359052Mahmoud, Hosam M.; Modarres, Reza; Smythe, Robert T. Analysis of QUICKSELECT: an algorithm for order statistics. RAIRO Inform. Théor. Appl. 29 (1995), no. 4, 255–276. MR1359052
Martínez, Conrado; Roura, Salvador. Optimal sampling strategies in quicksort and quickselect. SIAM J. Comput. 31 (2001/02), no. 3, 683–705 (electronic). MR1896454 10.1137/S0097539700382108Martínez, Conrado; Roura, Salvador. Optimal sampling strategies in quicksort and quickselect. SIAM J. Comput. 31 (2001/02), no. 3, 683–705 (electronic). MR1896454 10.1137/S0097539700382108
Martínez, Conrado; Panario, Daniel; Viola, Alfredo. Adaptive sampling strategies for quickselect. ACM Trans. Algorithms 6 (2010), no. 3, Art. 53, 46 pp. MR2682622 10.1145/1798596.1798606Martínez, Conrado; Panario, Daniel; Viola, Alfredo. Adaptive sampling strategies for quickselect. ACM Trans. Algorithms 6 (2010), no. 3, Art. 53, 46 pp. MR2682622 10.1145/1798596.1798606
Mörters, Peter; Peres, Yuval. Brownian motion. With an appendix by Oded Schramm and Wendelin Werner. Cambridge Series in Statistical and Probabilistic Mathematics. Cambridge University Press, Cambridge, 2010. xii+403 pp. ISBN: 978-0-521-76018-8 MR2604525Mörters, Peter; Peres, Yuval. Brownian motion. With an appendix by Oded Schramm and Wendelin Werner. Cambridge Series in Statistical and Probabilistic Mathematics. Cambridge University Press, Cambridge, 2010. xii+403 pp. ISBN: 978-0-521-76018-8 MR2604525
Neininger, Ralph; Rüschendorf, Ludger. A general limit theorem for recursive algorithms and combinatorial structures. Ann. Appl. Probab. 14 (2004), no. 1, 378–418. MR2023025 10.1214/aoap/1075828056 euclid.aoap/1075828056
Neininger, Ralph; Rüschendorf, Ludger. A general limit theorem for recursive algorithms and combinatorial structures. Ann. Appl. Probab. 14 (2004), no. 1, 378–418. MR2023025 10.1214/aoap/1075828056 euclid.aoap/1075828056
Neininger, Ralph; Rüschendorf, Ludger. Analysis of algorithms by the contraction method: additive and max-recursive sequences. Interacting stochastic systems, 435–450, Springer, Berlin, 2005. MR2118586 10.1007/3-540-27110-4_20Neininger, Ralph; Rüschendorf, Ludger. Analysis of algorithms by the contraction method: additive and max-recursive sequences. Interacting stochastic systems, 435–450, Springer, Berlin, 2005. MR2118586 10.1007/3-540-27110-4_20
Neininger, R. and Sulzbach, H.: On a functional contraction method. arXiv:1202.1370 1202.1370 MR3353815 10.1214/14-AOP919 euclid.aop/1433341320
Neininger, R. and Sulzbach, H.: On a functional contraction method. arXiv:1202.1370 1202.1370 MR3353815 10.1214/14-AOP919 euclid.aop/1433341320
Paulsen, Volkert. The moments of FIND. J. Appl. Probab. 34 (1997), no. 4, 1079–1082. MR1484039 10.2307/3215021Paulsen, Volkert. The moments of FIND. J. Appl. Probab. 34 (1997), no. 4, 1079–1082. MR1484039 10.2307/3215021
Ragab, M.: Partial Quicksort and weighted branching processes. Dissertation, Christian-Albrechts-Universität zu Kiel, (2011). Electronically available via urn:nbn:de:gbv:8-diss-73701Ragab, M.: Partial Quicksort and weighted branching processes. Dissertation, Christian-Albrechts-Universität zu Kiel, (2011). Electronically available via urn:nbn:de:gbv:8-diss-73701
Ragab, Mahmoud; Roesler, Uwe. The Quicksort process. Stochastic Process. Appl. 124 (2014), no. 2, 1036–1054. MR3138605 10.1016/j.spa.2013.09.014Ragab, Mahmoud; Roesler, Uwe. The Quicksort process. Stochastic Process. Appl. 124 (2014), no. 2, 1036–1054. MR3138605 10.1016/j.spa.2013.09.014
Rösler, U.; Rüschendorf, L. The contraction method for recursive algorithms. Average-case analysis of algorithms (Princeton, NJ, 1998). Algorithmica 29 (2001), no. 1-2, 3–33. MR1887296 10.1007/BF02679611Rösler, U.; Rüschendorf, L. The contraction method for recursive algorithms. Average-case analysis of algorithms (Princeton, NJ, 1998). Algorithmica 29 (2001), no. 1-2, 3–33. MR1887296 10.1007/BF02679611
Rüschendorf, Ludger. On stochastic recursive equations of sum and max type. J. Appl. Probab. 43 (2006), no. 3, 687–703. MR2274793 10.1239/jap/1158784939 euclid.jap/1158784939
Rüschendorf, Ludger. On stochastic recursive equations of sum and max type. J. Appl. Probab. 43 (2006), no. 3, 687–703. MR2274793 10.1239/jap/1158784939 euclid.jap/1158784939
Sulzbach, H.: On a Functional Contraction Method. Dissertation, Goethe-Universität Frankfurt am Main, (2012). Electronically available via urn:nbn:de:hebis:30:3-248587Sulzbach, H.: On a Functional Contraction Method. Dissertation, Goethe-Universität Frankfurt am Main, (2012). Electronically available via urn:nbn:de:hebis:30:3-248587
Talagrand, Michel. Regularity of Gaussian processes. Acta Math. 159 (1987), no. 1-2, 99–149. MR906527 10.1007/BF02392556Talagrand, Michel. Regularity of Gaussian processes. Acta Math. 159 (1987), no. 1-2, 99–149. MR906527 10.1007/BF02392556
Vallée, Brigitte; Clément, Julien; Fill, James Allen; Flajolet, Philippe. The number of symbol comparisons in QuickSort and QuickSelect. Automata, languages and programming. Part I, 750–763, Lecture Notes in Comput. Sci., 5555, Springer, Berlin, 2009. MR2544890 10.1007/978-3-642-02927-1_62Vallée, Brigitte; Clément, Julien; Fill, James Allen; Flajolet, Philippe. The number of symbol comparisons in QuickSort and QuickSelect. Automata, languages and programming. Part I, 750–763, Lecture Notes in Comput. Sci., 5555, Springer, Berlin, 2009. MR2544890 10.1007/978-3-642-02927-1_62
Wild, S., Nebel, M.E. and Mahmoud, H.M.: Analysis of Quickselect under Yaroslavskiy's Dual-Pivoting Algorithm. ARXIV1306.3819. MR3439254 10.1007/s00453-014-9953-xWild, S., Nebel, M.E. and Mahmoud, H.M.: Analysis of Quickselect under Yaroslavskiy's Dual-Pivoting Algorithm. ARXIV1306.3819. MR3439254 10.1007/s00453-014-9953-x