相关论文: Quicksort asymptotics

New bounds for the $k$-th order derivatives of the solutions of the normal and multivariate normal Stein equations are obtained. Our general order bounds involve fewer derivatives of the test function than those in the existing literature.…

The linear pivot selection algorithm, known as median-of-medians, makes the worst case complexity of quicksort be $\mathrm{O}(n\ln n)$. Nevertheless, it has often been said that this algorithm is too expensive to use in quicksort. In this…

Let $X_n(k)$ be the number of vertices at level $k$ in a random recursive tree with $n+1$ vertices. We are interested in the asymptotic behavior of $X_n(k)$ for intermediate levels $k=k_n$ satisfying $k_n\to\infty$ and $k_n=o(\log n)$ as…

In a continuous-time setting, Fill (2010) proved, for a large class of probabilistic sources, that the number of symbol comparisons used by QuickSort, when centered by subtracting the mean and scaled by dividing by time, has a limiting…

Linear thresholding models postulate that the conditional distribution of a response variable in terms of covariates differs on the two sides of a (typically unknown) hyperplane in the covariate space. A key goal in such models is to learn…

This paper derives the rate of convergence and asymptotic distribution for a class of Kolmogorov-Smirnov style test statistics for conditional moment inequality models for parameters on the boundary of the identified set under general…

Given a non-negative random variable $W$ and $\theta>0$, let the generalized Dickman transformation map the distribution of $W$ to that of $$ W^*=_d U^{1/\theta}(W+1), $$ where $U \sim {\cal U}[0,1]$, a uniformly distributed variable on the…

We consider the modulation of data given by random vectors $X_n \in \mathbb{R}^{d_n}$, $n \in \mathbb{N}$. For each $X_n$, one chooses an independent modulating random vector $\Xi_n \in \mathbb{R}^{d_n}$ and forms the projection $Y_n =…

Let $F_n$ denote the distribution function of the normalized sum $Z_n = (X_1 + \dots + X_n)/\sigma\sqrt{n}$ of i.i.d. random variables with finite fourth absolute moment. In this paper, polynomial rates of convergence of $F_n$ to the normal…

We study the space requirements of a sorting algorithm where only items that at the end will be adjacent are kept together. This is equivalent to the following combinatorial problem: Consider a string of fixed length n that starts as a…

Let $\bX=\{X_n\}_{n\geq 1}$ and $\bY=\{Y_n\}_{n\geq 1}$ be two independent random sequences. We obtain rates of convergence to the normal law of randomly weighted self-normalized sums $$ \psi_n(\bX,\bY)=\sum_{i=1}^nX_iY_i/V_n,\quad…

Divergence estimators based on direct approximation of density-ratios without going through separate approximation of numerator and denominator densities have been successfully applied to machine learning tasks that involve distribution…

Stochastic approximation is a foundation for many algorithms found in machine learning and optimization. It is in general slow to converge: the mean square error vanishes as $O(n^{-1})$. A deterministic counterpart known as quasi-stochastic…

This paper finds the bulk local limit of the swap process of uniformly random sorting networks. The limit object is defined through a deterministic procedure, a local version of the Edelman-Greene algorithm, applied to a two dimensional…

Let $X$ be an $n$-dimensional random centered Gaussian vector with independent but not identically distributed coordinates and let $T$ be an orthogonal trasformation of $\mathbb R^n$. We show that the random vector $Y=T(X)$ satisfies…

We show that the distribution of self-normalized sums of free self-adjoint random variables converges weakly to Wigner's semicircle law under appropriate conditions and estimate the rate of convergence in terms of the Kolmogorov distance.…

Since the work of Kaligosi and Sanders (2006), it is well-known that Quicksort -- which is commonly considered as one of the fastest in-place sorting algorithms -- suffers in an essential way from branch mispredictions. We present a novel…

We consider random $n\times n$ matrices of the form $Y_n=\frac1{\sqrt{d}}A_n\circ X_n$, where $A_n$ is the adjacency matrix of a uniform random $d$-regular directed graph on $n$ vertices, with $d=\lfloor p n\rfloor$ for some fixed $p \in…

Let ${X_1,...,X_n}$ be i.i.d. random observations. Let $\mathbb{S}=\mathbb{L}+\mathbb{T}$ be a $U$-statistic of order $k\ge2$ where $\mathbb{L}$ is a linear statistic having asymptotic normal distribution, and $\mathbb{T}$ is a…

We prove the existence of a limit distribution for the normalized normality measure $\mathcal{N}(E_N)/\sqrt{N}$ (as $N \to \infty$) for random binary sequences $E_N$, by this means confirming a conjecture of Alon, Kohayakawa, Mauduit,…