Hit-and-run from a corner

DOI10.1145/1007352.1007403zbMath1192.68371OpenAlexW1987845271MaRDI QIDQ3580977

László Lovász, Santosh Vempala

Publication date: 15 August 2010

Published in: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1007352.1007403

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Sums of independent random variables; random walks (60G50)

Related Items (9)

Random sampling: billiard walk algorithm ⋮ Sampling by intersections with random geodesics ⋮ Complexity results for MCMC derived from quantitative bounds ⋮ Finite-sample complexity of sequential Monte Carlo estimators ⋮ Sampling Hypersurfaces through Diffusion ⋮ Using Histograms to Better Answer Queries to Probabilistic Logic Programs ⋮ Simulated annealing in convex bodies and an \(O^{*}(n^{4}\)) volume algorithm ⋮ Efficient Markov Chain Monte Carlo Methods for Decoding Neural Spike Trains ⋮ Projective re-normalization for improving the behavior of a homogeneous conic linear system

This page was built for publication: Hit-and-run from a corner