Now showing items 1-1 of 1

• #### Fairest edge usage and minimum expected overlap for random spanning trees ﻿

(Elsevier, 2021-05)
Random spanning trees of a graph $G$ are governed by a corresponding probability mass distribution (or "law"), $\mu$ defined on the set of all spanning trees of $G$ This paper addresses the problem of choosing $\mu$ in ...