How to Get a Perfectly Random Sample fro
โ
James Gary Propp; David Bruce Wilson
๐
Article
๐
1998
๐
Elsevier Science
๐
English
โ 793 KB
A general problem in computational probability theory is that of generating a random sample from the state space of a Markov chain in accordance with the steady-state probability law of the chain. Another problem is that of generating a random spanning tree of a graph or spanning arborescence of a d