arXiv · physics/0003078
A fast algorithm for generating a uniform distribution inside a high-dimensional polytope
Abstract
We describe a uniformly fast algorithm for generating points \vec{x} uniformly in a hypercube with the restriction that the difference between each pair of coordinates is bounded. We discuss the quality of the algorithm in the sense of its usage of pseudo-random source numbers, and present an interesting result on the correlation between the coordinates.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
A. van Hameren, R. Kleiss. 2000-05-04. A fast algorithm for generating a uniform distribution inside a high-dimensional polytope. https://doi.org/10.1016/s0010-4655(00)00157-0
Cite the original work for its findings. Save a collection to share your selection of sources.