Efficient Sampling of Cycle-Rooted Spanning Forests in Weakly Inconsistent U(1)-Connection Graphs

The authors provide an elementary proof of the correctness of the CyclePopping algorithm for efficiently sampling cycle-rooted spanning forests in weakly inconsistent U(1)-connection graphs.