Sampling from log-concave distributions

DOI10.1214/aoap/1177004973zbMath0813.60060OpenAlexW2022004112WikidataQ57401586 ScholiaQ57401586MaRDI QIDQ1336592

Nick Polson, Ravindran Kannan, Alan M. Frieze

Publication date: 30 May 1995

Published in: The Annals of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1214/aoap/1177004973

zbMATH Keywords

samplingMonte Carlo methodMarkov chainlog-concavityconvergence of the distribution

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Monte Carlo methods (65C05) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)

Related Items

Applications of geometric bounds to the convergence rate of Markov chains on \(\mathbb R^ {n}\)., Unnamed Item, On the computational complexity of MCMC-based estimators in large samples, Markov chain convergence: From finite to infinite, Convergence properties of the Gibbs sampler for perturbations of Gaussians, Mixing times for uniformly ergodic Markov chains, Log-concavity and strong log-concavity: a review, Simple Monte Carlo and the Metropolis algorithm, Approximate Spectral Gaps for Markov Chain Mixing Times in High Dimensions, Markov-chain monte carlo: Some practical implications of theoretical results, An approximation algorithm for counting contingency tables, On Sampling from Multivariate Distributions, What do we know about the Metropolis algorithm?, Conductance bounds on the L² convergence rate of Metropolis algorithms on unbounded state spaces, Log-Sobolev inequalities and sampling from log-concave distributions, Unnamed Item