On the Average Number of Maxima in a Set of Vectors
暂无分享,去创建一个
Abstract Any of n vectors in d -space is called maximal if none of the remaining vectors dominates it in every component. Assuming that n vectors are distributed identically and that the d components of each vector are distributed independently and continuously, we determine the expected number of maximal vectors explicitly for any n and d . The asymptotic behaviour of this quantity as n tends to infinity, which was investigated by Bentley, Kung, Schkolnick, Thompson and Devroye, follows immediately from our result.
[1] Luc Devroye. A Note on Finding Convex Hulls Via Maximal Vectors , 1980, Inf. Process. Lett..
[2] H. T. Kung,et al. On the Average Number of Maxima in a Set of Vectors and Applications , 1978, JACM.
[3] Michael Ian Shamos,et al. Divide and Conquer for Linear Expected Time , 1978, Inf. Process. Lett..