Dispersion of Mass and the Complexity of Randomized Geometric Algorithms

How much can randomness help computation? Motivated by this general question and by volume computation, one of the few instances where randomness provably helps, we analyze a notion of dispersion and connect it to asymptotic convex geometry. We obtain a nearly quadratic lower bound on the complexity of randomized volume algorithms for convex bodies in Ropfn (the current best algorithm has complexity roughly n4, conjectured to be n3). Our main tools, dispersion of random determinants and dispersion of the length of a random point from a convex body, are of independent interest and applicable more generally; in particular, the latter is closely related to the variance hypothesis from convex geometry. This geometric dispersion also leads to lower bounds for matrix problems and property testing

[1]  Santosh S. Vempala,et al.  The Random Projection Method , 2005, DIMACS Series in Discrete Mathematics and Theoretical Computer Science.

[2]  Miklós Simonovits,et al.  Random walks and an O*(n5) volume algorithm for convex bodies , 1997, Random Struct. Algorithms.

[3]  David Applegate,et al.  Sampling and integration of near log-concave functions , 1991, STOC '91.

[4]  Zoltán Füredi,et al.  Computing the volume is difficult , 1986, STOC '86.

[5]  R. Stephenson.  A and V , 1962, The British journal of ophthalmology.

[6]  László Lovász,et al.  Linear decision trees: volume estimates and topological bounds , 1992, STOC '92.

[7]  Miklós Simonovits,et al.  How to compute the volume in high dimension? , 2003, Math. Program..

[8]  M. Dyer.  Computing the volume of convex bodies : a case where randomness provably helps , 1991 .

[9]  Martin E. Dyer,et al.  A random polynomial-time algorithm for approximating the volume of convex bodies , 1991, JACM.

[10]  S. Vempala,et al.  Dispersion of mass and the complexity of randomized geometric algorithms , 2008 .

[11]  Leonid A. Levin,et al.  A hard-core predicate for all one-way functions , 1989, STOC '89.

[12]  Keith Ball,et al.  Normed spaces with a weak-Gordon-Lewis property , 1991 .

[13]  A. Edelman.  Eigenvalues and condition numbers of random matrices , 1988 .

[14]  DyerMartin,et al.  A random polynomial-time algorithm for approximating the volume of convex bodies , 1991 .

[15]  S. Vempala,et al.  The geometry of logconcave functions and sampling algorithms , 2007 .

[16]  J. Bourgain.  On the distribution of polynomials on high dimensional convex sets , 1991 .

[17]  Miklós Simonovits,et al.  Random Walks in a Convex Body and an Improved Volume Algorithm , 1993, Random Struct. Algorithms.

[18]  György Elekes,et al.  A geometric inequality and the complexity of computing volume , 1986, Discret. Comput. Geom..

[19]  Santosh S. Vempala,et al.  Simulated annealing in convex bodies and an O*(n4) volume algorithm , 2006, J. Comput. Syst. Sci..

[20]  Santosh S. Vempala,et al.  The geometry of logconcave functions and sampling algorithms , 2007, Random Struct. Algorithms.

[21]  S. Vempala.  Geometric Random Walks: a Survey , 2007 .

[22]  Irene A. Stegun,et al.  Handbook of Mathematical Functions. , 1966 .

[23]  Richard J. Lipton,et al.  A Lower Bound of ½n² on Linear Search Programs for the Knapsack Problem , 1976, MFCS.

[24]  DAVID DOBKIN,et al.  A Lower Bound of the ½n² on Linear Search Programs for the Knapsack Problem , 1978, J. Comput. Syst. Sci..

[25]  M. Simonovits,et al.  Random walks and an O * ( n 5 ) volume algorithm for convex bodies , 1997 .

[26]  Miklós Simonovits,et al.  The mixing rate of Markov chains, an isoperimetric inequality, and computing the volume , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[27]  Sergey G. Bobkov,et al.  On the Central Limit Property of Convex Bodies , 2003 .

[28]  Leslie G. Valiant,et al.  Random Generation of Combinatorial Structures from a Uniform Distribution , 1986, Theor. Comput. Sci..

[29]  L. Lovász,et al.  Geometric Algorithms and Combinatorial Optimization , 1981 .

[30]  V. Milman,et al.  Isotropic position and inertia ellipsoids and zonoids of the unit ball of a normed n-dimensional space , 1989 .