survey.dvi
math.uchicago.edu · 9,198 words · saved by 1 readers
N/A
Geometric Random Walks: A Survey∗ Santosh Vempala† Department of Mathematics, Massachusetts Institute of Technology, Cambridge, MA 02139. Abstract The developing theory of geometric random walks is outlined here. Three aspects — general methods for estimating convergence (the “mix- ing” rate), isoperimetric inequalities in Rn and their intimate connection to random walks, and algorithms for fundamental problems (volume com-…
saved by
related reading
- An optimization perspective on log-concave sampling and beyond | Sinho Chewichewisinho.github.io
- ICML and isotropic position of a convex bodyweb.archive.org
- Nicholas Cook - Duke Mathsites.math.duke.edu
- Geometry of random sections of isotropic convex bodiesarxiv.org
- CSE290A - Randomized Algorithmsusers.soe.ucsc.edu
- CSE 599 Counting and Samplinghomes.cs.washington.edu
- Distances between non-symmetric convex bodies: optimal bounds up to polylogarxiv.org
- Research • Leonid Petrov. Integrable Probabilitylpetrov.cc
- rakhlin_mathstat_sp24.pdfmit.edu
- Nike Sunmath.mit.edu
- Statistics 386 Winter 2013galton.uchicago.edu
- [2608.00140] Discrepancy Theory: An Algorithmic and Geometric Perspectivearxiv.org