VOLUMES SPANNED BY RANDOM POINTS IN THE HYPERCUBE

被引:28
作者
DYER, ME
FUREDI, Z
MCDIARMID, C
机构
[1] HUNGARIAN ACAD SCI,INST MATH,H-1361 BUDAPEST 5,HUNGARY
[2] UNIV OXFORD,DEPT STAT,OXFORD,ENGLAND
关键词
D O I
10.1002/rsa.3240030107
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Consider the hypercube [0, 1]n in R(n). This has 2n vertices and volume 1. Pick N = N(n) vertices independently at random, form their convex hull, and let V(n) be its expected volume. How large should N(n) be to pick up significant volume? Let kappa = 2/square-root e almost-equal-to 1.213, and let epsilon > 0. We shall show that, as n --> infinity, V(n) --> if N(n) less-than-or-equal-to (kappa - epsilon)n, and V(n) --> 1 if N(n) greater-than-or-equal-to (kappa + epsilon)n. A similar result holds for sampling uniformly from within the hypercube, with constant lambda = exp{integral-0/infinity(1/u - 1/(e(u) - 1))2 du} almost-equal-to 2.136.
引用
收藏
页码:91 / 106
页数:16
相关论文
共 5 条
[1]  
[Anonymous], 1991, INTRO PROBABILITY TH
[2]  
BAHADUR RR, CBMS REGIONAL C SERI, V4
[3]   APPROXIMATION OF THE SPHERE BY POLYTOPES HAVING FEW VERTICES [J].
BARANY, I ;
FUREDI, Z .
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY, 1988, 102 (03) :651-659
[4]  
DYER ME, 1990, POLYHEDRAL COMBINATO, P33
[5]   A GEOMETRIC INEQUALITY AND THE COMPLEXITY OF COMPUTING VOLUME [J].
ELEKES, G .
DISCRETE & COMPUTATIONAL GEOMETRY, 1986, 1 (04) :289-292