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
- Geometry of random sections of isotropic convex bodiesarxiv.org
- An optimization perspective on log-concave sampling and beyond | Sinho Chewichewisinho.github.io
- Dynamical Approach to RMT.pdfpeople.math.harvard.edu
- probmethod_notes.pdfyufeizhao.com
- [2608.00140] Discrepancy Theory: An Algorithmic and Geometric Perspectivearxiv.org
- rakhlin_mathstat_sp24.pdfmit.edu
- Distances between non-symmetric convex bodies: optimal bounds up to polylogarxiv.org
- practicalqmc.pdfartowen.su.domains
- refining bounds - cover timesarxiv.org
- A Primer on Stochastic Partial Differential Equationsmath.utah.edu
- Analysis of Circulant Embedding Methods for Sampling Stationary Random Fieldsarxiv.org
- Advanced stochastic analysishairer.org