Pages that link to "Item:Q1336592"
From MaRDI portal
The following pages link to Sampling from log-concave distributions (Q1336592):
Displaying 16 items.
- Log-concavity and strong log-concavity: a review (Q485901) (← links)
- What do we know about the Metropolis algorithm? (Q1273859) (← links)
- Log-Sobolev inequalities and sampling from log-concave distributions (Q1296584) (← links)
- Applications of geometric bounds to the convergence rate of Markov chains on \(\mathbb R^ {n}\). (Q1877387) (← links)
- Markov chain convergence: From finite to infinite (Q1915845) (← links)
- Convergence properties of the Gibbs sampler for perturbations of Gaussians (Q1922399) (← links)
- Mixing times for uniformly ergodic Markov chains (Q1965874) (← links)
- On the computational complexity of MCMC-based estimators in large samples (Q2388988) (← links)
- Simple Monte Carlo and the Metropolis algorithm (Q2465298) (← links)
- An approximation algorithm for counting contingency tables (Q3057067) (← links)
- On Sampling from Multivariate Distributions (Q3088131) (← links)
- Markov-chain monte carlo: Some practical implications of theoretical results (Q4399495) (← links)
- Conductance bounds on the <i>L</i><sup>2</sup> convergence rate of Metropolis algorithms on unbounded state spaces (Q4464174) (← links)
- (Q4637035) (← links)
- Approximate Spectral Gaps for Markov Chain Mixing Times in High Dimensions (Q5154639) (← links)
- (Q5214293) (← links)