An analysis of a variation of hit-and-run for uniform sampling from general regions
From MaRDI portal
(Redirected from Publication:4635178)
Recommendations
Cited in
(17)- Hit and run ARMS: adaptive rejection Metropolis sampling with hit and run random direction
- Dimensional reduction for latent scores modeling using recursive integration
- Some rapidly mixing hit-and-run samplers for latent counts in linear inverse problems
- Comparison of hit-and-run, slice sampler and random walk Metropolis
- Uniform distributions and random variate generation over generalized \(l_p\) balls and spheres
- Pattern hit-and-run for sampling efficiently on polytopes
- Nested sampling methods
- Notes on ``Hit-and-run enables efficient weight generation for simulation-based multiple criteria decision analysis
- Convergence of hybrid slice sampling via spectral gap
- Convergence of Gibbs sampling: coordinate hit-and-run mixes fast
- Hit-and-run mixes fast
- Rank constrained distribution and moment computations
- Discrete hit-and-run for sampling points from arbitrary distributions over subsets of integer hyperrectangles
- A Markov chain Monte Carlo procedure to generate revealed preference consistent datasets
- Hit and run as a unifying device
- Efficient computation of the stochastic behavior of partial sum processes
- Monte-Carlo integration on a union of polytopes
This page was built for publication: An analysis of a variation of hit-and-run for uniform sampling from general regions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4635178)