1 citations · 1 across the 1 of their papers we have counts for
1 paper
Jakob Tómas Bullerjahn, Balázs Fábián, Gerhard Hummer
Markov-chain Monte Carlo algorithms rely on trial moves that are either rejected or accepted based on certain criteria. Here, we provide an efficient algorithm to generate random r…