Smoothed analysis of left-to-right maxima with applications
ACM Transactions on Algorithms (TALG)(2012)
摘要
A left-to-right maximum in a sequence of n numbers s1, …, sn is a number that is strictly larger than all preceding numbers. In this article we present a smoothed analysis of the number of left-to-right maxima in the presence of additive random noise. We show that for every sequence of n numbers si ∈ [0,1] that are perturbed by uniform noise from the interval [-ε,ε], the expected number of left-to-right maxima is Θ(&sqrt;n/ε + log n) for ε1/n. For Gaussian noise with standard deviation σ we obtain a bound of O((log3/2 n)/σ + log n). We apply our results to the analysis of the smoothed height of binary search trees and the smoothed number of comparisons in the quicksort algorithm and prove bounds of Θ(&sqrt;n/ε + log n) and Θ(n/ε+1&sqrt;n/ε + n log n), respectively, for uniform random noise from the interval [-ε,ε]. Our results can also be applied to bound the smoothed number of points on a convex hull of points in the two-dimensional plane and to smoothed motion complexity, a concept we describe in this article. We bound how often one needs to update a data structure storing the smallest axis-aligned box enclosing a set of points moving in d-dimensional space.
更多查看译文
关键词
smoothed analysis,additive random noise,expected number,n number,uniform noise,n numbers si,n log n,left-to-right maximum,gaussian noise,preceding number,log n,data structure,standard deviation,binary search tree,binary search trees,convex hull
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络