Showing math.PRShow all
3 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
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…
math.PR2018
Heavy Bernoulli-percolation clusters are indistinguishable
Pengfei Tang
We prove that the heavy clusters are indistinguishable for Bernoulli percolation on quasi-transitive nonunimodular graphs. As an application, we show that the uniqueness threshold…