The DOI matches its Crossref record.
Hit-and-Run Algorithms for Generating Multivariate Distributions
Abstract
We introduce a general class of Hit-and-Run algorithms for generating essentially arbitrary absolutely continuous distributions on R d. They include the Hypersphere Directions algorithm and the Coordinate Directions algorithm that have been proposed for identifying nonredundant linear constraints and for generating uniform distributions over subsets of R d. Given a bounded open set S in R d, an absolutely continuous probability distribution π on S (the target distribution) and an arbitrary probability distribution ν on the boundary of the d-dimensional unit sphere centered at the origin (the direction distribution), the (ν, π)-Hit-and-Run algorithm produces a sequence of iteration points as follows. Given the nth iteration point x, choose a direction θ according to the distribution ν and then choose the (n + 1)st iteration point according to the conditionalization of the distribution π along the line defined by x and x + θ. Under mild conditions, we show that this sequence of points is a Harris recurrent reversible Markov chain converging in total variation to the target distribution π.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Derivative-free optimization: a review of algorithms and comparison of software implementations
Rios, L. M., & Sahinidis, N. V. (2013) · Journal of Global Optimization · doi:10.1007/s10898-012-9951-y · Cited by 1,276
Adaptive Rejection Metropolis Sampling within Gibbs Sampling
Gilks, W. R., Best, N. G., & Tan, K. K. C. (1995) · Applied Statistics · doi:10.2307/2986138 · Cited by 671
A practical guide to robust optimization
Gorissen, B. L., Yanıkoğlu, İ., & den Hertog, D. (2015) · Omega · doi:10.1016/j.omega.2014.12.006 · Cited by 636
Algebraic algorithms for sampling from conditional distributions
Diaconis, P., & Sturmfels, B. (1998) · The Annals of Statistics · doi:10.1214/aos/1030563990 · Cited by 616
The Theory and Practice of Simulated Annealing
Henderson, D., Jacobson, S. H., & Johnson, A. W. (2006) · International Series in Operations Research & Management Science · doi:10.1007/0-306-48056-5_10 · Cited by 514
Metadata
- Authors
- Bélisle, C. J. P., Romeijn, H. E., & Smith, R. L.
- Venue
- Mathematics of Operations Research
- Published
- 1993-05
- Volume
- 18
- Issue
- 2
- Pages
- 255-266
- ISSN
- 0364-765X (ISSN-L)
- 1526-5471
- OpenAlex
- W2031715986
- Cited by
- 186
- References
- 0
- FWCI
- 6.02
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Hit-and-Run Algorithms for Generating Multivariate Distributions. https://app.cochat.ai/papers/10.1287/moor.18.2.255
- The paper
- Bélisle, C. J. P., Romeijn, H. E., & Smith, R. L. (1993). Hit-and-Run Algorithms for Generating Multivariate Distributions. Mathematics of Operations Research. https://doi.org/10.1287/moor.18.2.255
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.