DeepAI AI Chat
Log In Sign Up

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

by   James Allen Fill, et al.
Johns Hopkins University

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 [1 - F(x)] that matches conjectured asymptotics of Knessl and Szpankowski (1999) through terms of order ( x)^2; the corresponding order for the Janson (2015) bound is the lead order, x 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).


page 1

page 2

page 3

page 4


On the tails of the limiting QuickSort density

We give upper and lower asymptotic bounds for the left tail and for the ...

Exponential tail bounds and Large Deviation Principle for Heavy-Tailed U-Statistics

We study deviation of U-statistics when samples have heavy-tailed distri...

Density functions for QuickQuant and QuickVal

We prove that, for every 0 ≤ t ≤ 1, the limiting distribution of the sca...

Improving Generalization Bounds for VC Classes Using the Hypergeometric Tail Inversion

We significantly improve the generalization bounds for VC classes by usi...

Right-truncated Archimedean and related copulas

The copulas of random vectors with standard uniform univariate margins t...

Automated Tail Bound Analysis for Probabilistic Recurrence Relations

Probabilistic recurrence relations (PRRs) are a standard formalism for d...

Instance-dependent uniform tail bounds for empirical processes

We formulate a uniform tail bound for empirical processes indexed by a c...