SearcharxivSearch

arXiv subjects

Wei-Chun Hung

Publications and source records attributed to Wei-Chun Hung.

3 recordsLinked to original sources

Density functions for QuickQuant and QuickVal

We prove that, for every $0 \leq t \leq 1$, the limiting distribution of the scale-normalized number of key comparisons used by the celebrated algorithm QuickQuant to find the $t$th quantile in a randomly ordered list has a Lipschitz continuous density function $f_t$ that is bounded above by $10$. Furthermore, this density $f_t(x)$ is positive for every $x > \min\{t, 1 - t\}$ and, uniformly in $t$, enjoys superexponential decay in the right tail. We also prove that the survival function $1 - F_t(x) = \int_x^{\infty}\!f_t(y)\,\mathrm{d}y$ and the density function $f_t(x)$ both have the right tail asymptotics $\exp [-x \ln x - x \ln \ln x + O(x)]$. We use the right-tail asymptotics to bound large deviations for the scale-normalized number of key comparisons used by QuickQuant.

math.PR

QuickSort: Improved right-tail asymptotics for the limiting distribution, and large deviations

We substantially refine asymptotic logarithmic upper bounds produced by Svante Janson (2015) on the right tail of the limiting QuickSort distribution function $F$ and by Fill and Hung (2018) on the right tails of the corresponding density $f$ and of the absolute derivatives of $f$ of each order. For example, we establish an upper bound on $\log[1 - F(x)]$ that matches conjectured asymptotics of Knessl and Szpankowski (1999) through terms of order $(\log x)^2$; the corresponding order for the Janson (2015) bound is the lead order, $x \log x$. Using the refined asymptotic bounds on $F$, we derive right-tail large deviation (LD) results for the distribution of the number of comparisons required by QuickSort that substantially sharpen the two-sided LD results of McDiarmid and Hayward (1996).

math.PR

On the tails of the limiting QuickSort density

We give upper and lower asymptotic bounds for the left tail and for the right tail of the continuous limiting QuickSort density f that are nearly matching in each tail. The bounds strengthen results from a paper of Svante Janson (2015) concerning the corresponding distribution function F. Furthermore, we obtain similar bounds on absolute values of derivatives of f of each order.

math.PR