5 citations · 9 across the 8 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
math.PR2019
Weights of uniform spanning forests on nonunimodular transitive graphs
Pengfei Tang
Considering the wired uniform spanning forest on a nonunimodular transitive graph, we show that almost surely each tree of the wired uniform spanning forest is light. More generall…
math.PR2019★ 2 cited
A reverse Aldous/Broder algorithm
Yiping Hu, Russell Lyons, Pengfei Tang
The Aldous--Broder algorithm provides a way of sampling a uniformly random spanning tree for finite connected graphs using simple random walk. Namely, start a simple random walk on…