3 citations · 7 across the 8 of their papers we have counts for
1 paper · 2 filters
David Eppstein, Daniel Frishberg
We give a new rapid mixing result for a natural random walk on the independent sets of a graph G. We show that when G has bounded treewidth, this random walk -- known as the Gl…