Dispersion of mass and the complexity of randomized geometric algorithms

• Autores: Luis Rademacher, Santosh Vempala
• Localización: Advances in mathematics, ISSN 0001-8708, Vol. 219, Nº 3, 2008, págs. 1037-1069
• Idioma: inglés
• DOI: 10.1016/j.aim.2008.06.004
• Texto completo no disponible (Saber más ...)
• Resumen

  • 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 (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.