@article{Russo2018LinkingAC,
title={Linking and Cutting Spanning Trees},
author={Lu{\'i}s M. S. Russo and Andreia Sofia Teixeira and A. Francisco},
journal={Algorithms},
year={2018},
volume={11},
pages={53}
}

We consider the problem of uniformly generating a spanning tree, of a connected undirected graph. This process is useful to compute statistics, namely for phylogenetic trees. We describe a Markov chain for producing these trees. For cycle graphs we prove that this approach significantly outperforms existing algorithms. For general graphs we obtain no analytical bounds, but experimental results show that the chain still converges quickly. This yields an efficient algorithm, also due to the use… Expand