关于QuickSelect算法复杂度精细波动的研究
On fine fluctuations of the complexity of the QuickSelect algorithm
AI总结:
本文研究QuickSelect算法复杂度在极限收敛中的精细波动,证明归一化残差过程依分布收敛于高斯过程混合,并将方法推广到QuickVal及交换次数、比特比较等代价度量,同时讨论极限过程路径的Hölder连续性。
摘要:
Quickselect算法(亦称FIND)是一种用于在数据集中选择秩或分位数的基本算法。Grübel和Rösler证明了,在一个自然的概率模型下,将Quickselect所需的关键字比较次数视为分位数$α\in[0,1]$的过程,经过归一化后在赋予Skorokhod度量的càdlàg空间$D[0,1]$中依分布收敛。我们证明了后一收敛中的残差过程在归一化后在$D[0,1]$中依分布收敛于高斯过程的混合。类似的结果对相关算法QuickVal也成立。我们的方法适用于其他代价度量,例如Quickselect所需的交换(关键字交换)次数,或者基于关键字比较的代价度量,这些度量额外考虑了比较两个关键字的代价可能依赖于它们的值,一个例子是比较由比特展开给出的关键字所需的比特比较次数。对于所有出现的高斯极限过程的混合,我们还讨论了其路径的Hölder连续性。
英文摘要:
The Quickselect algorithm (also called FIND) is a fundamental algorithm for selecting ranks or quantiles within a set of data. Grübel and Rösler showed that the number of key comparisons required by Quickselect considered as a process of the quantiles $α\in[0,1]$ converges within a natural probabilistic model after normalization in distribution within the càdlàg space $D[0,1]$ endowed with the Skorokhod metric. We show that the residual process in the latter convergence after normalization converges in distribution towards a mixture of Gaussian processes in $D[0,1]$. A similar result holds for the related algorithm QuickVal. Our method is applicable to other cost measures such as the number of swaps (key exchanges) required by Quickselect, or cost measures being based on key comparisons taking additionally into account that the cost of a comparison between two keys may depend on their values, an example being the number of bit comparisons needed to compare keys given by their bit expansions. For all the arising mixtures of Gaussian limit processes, we also discuss the Hölder continuity of their paths.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。