84 citations · 85 across the 2 of their papers we have counts for
2 papers
math.PR2004★ 84 cited
Perfect Sampling Using Bounding Chains
Mark Huber
Bounding chains are a technique that offers three benefits to Markov chain practitioners: a theoretical bound on the mixing time of the chain under restricted conditions, experimen…
math.PR2003★ 1 cited
Exact Sampling from Perfect Matchings of Dense Nearly Regular Bipartite Graphs
Mark Huber
We present the first algorithm for generating random variates exactly uniformly from the set of perfect matchings of a bipartite graph with a polynomial expected running time over…