Random sampling: Billiard Walk algorithm

Elena Gryazina, Boris Polyak

Research output: Contribution to journalArticlepeer-review

7 Citations (Scopus)


Hit-and-Run is known to be one of the best random sampling algorithms, its mixing time is polynomial in dimension. However in practice, the number of steps required to obtain uniformly distributed samples is rather high. We propose a new random walk algorithm based on billiard trajectories. Numerical experiments demonstrate much faster convergence to the uniform distribution.

Original languageEnglish
Pages (from-to)497-504
Number of pages8
JournalEuropean Journal of Operational Research
Issue number2
Publication statusPublished - 16 Oct 2014
Externally publishedYes


  • Billiards
  • Hit-and-Run
  • Monte-Carlo
  • Sampling


Dive into the research topics of 'Random sampling: Billiard Walk algorithm'. Together they form a unique fingerprint.

Cite this