Showing math.COShow all
2 papers · 1 filter
math.CO2019
Spanning tree modulus for secure broadcast games
Nathan Albin, Kapila Kottegoda, Pietro Poggi-Corradini
The theory of -modulus provides a general framework for quantifying the richness of a family of objects on a graph. When applied to the family of spanning trees, -modulus has…
math.CO2018
Fairest edge usage and minimum expected overlap for random spanning trees
Nathan Albin, Jason Clemens, Derek Hoare +3
Random spanning trees of a graph are governed by a corresponding probability mass distribution (or "law"), , defined on the set of all spanning trees of . This paper addr…