scientific article; zbMATH DE number 5019925

zbMath1106.52002MaRDI QIDQ5290281

Santosh Vempala

Publication date: 28 April 2006

Full work available at URL: http://www.msri.org/communications/books/Book52/

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

isoperimetryconvex bodystationary distributionconductancevolume computationmixing ratehit-and-runconvex optimisationball walkefficient samplinggeometric random walkgrid walk

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Computational aspects related to convexity (52B55) Abstract computational complexity for mathematical programming problems (90C60) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Numerical analysis or methods applied to Markov chains (65C40) Length, area, volume and convex sets (aspects of convex geometry) (52A38) Random convex sets and integral geometry (aspects of convex geometry) (52A22)

Related Items (34)

Rapid mixing of geodesic walks on manifolds with positive curvature ⋮ Geometric random edge ⋮ An economical acceptance-rejection algorithm for uniform random variate generation over constrained simplexes ⋮ Concentration phenomena in high dimensional geometry ⋮ Efficient sampling in spectrahedra and volume approximation ⋮ Unnamed Item ⋮ Stochastic Billiards for Sampling from the Boundary of a Convex Set ⋮ On the computational complexity of MCMC-based estimators in large samples ⋮ Geodesic Walks in Polytopes ⋮ Heat-bath random walks with Markov bases ⋮ Learning Markov random walks for robust subspace clustering and estimation ⋮ A Gibbs Sampler for a Class of Random Convex Polytopes ⋮ Complexity results for MCMC derived from quantitative bounds ⋮ Finite sample complexity of sequential Monte Carlo estimators on multimodal target distributions ⋮ Optimal scaling of random-walk Metropolis algorithms on general target distributions ⋮ Finite-sample complexity of sequential Monte Carlo estimators ⋮ Кросс-энтропийная редукции матрицы данных с ограничением информационной емкости матриц-проекторов и их норм ⋮ Generating uniform random vectors over a simplex with implications to the volume of a certain polytope and to multivariate extremes ⋮ Simple Monte Carlo and the Metropolis algorithm ⋮ Dispersion of mass and the complexity of randomized geometric algorithms ⋮ Mixing of Hamiltonian Monte Carlo on strongly log-concave distributions: continuous dynamics ⋮ Unnamed Item ⋮ On multivariate quantiles under partial orders ⋮ A ``thermodynamic approach to multi-robot cooperative localization ⋮ Maximum entropy Gaussian approximations for the number of integer points and volumes of polytopes ⋮ Unnamed Item ⋮ The accessibility of convex bodies and derandomization of the hit and run algorithm ⋮ Large scale model predictive control with neural networks and primal active sets ⋮ Uniform distributions and random variate generation over generalized \(l_p\) balls and spheres ⋮ Unnamed Item ⋮ Heat flow and a faster algorithm to compute the surface area of a convex body ⋮ Mixing time guarantees for unadjusted Hamiltonian Monte Carlo ⋮ Smart Contract Execution - the (+-)-Biased Ballot Problem. ⋮ Randomized interior point methods for sampling and optimization

This page was built for publication: