14 citations · 27 across the 2 of their papers we have counts for
2 papers
math.CO2018★ 13 cited
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…
math.CO2016★ 14 cited
Blocking duality for -modulus on networks and applications
Nathan Albin, Jason Clemens, Nethali Fernando +1
This paper explores the implications of blocking duality---pioneered by Fulkerson et al.---in the context of -modulus on networks. Fulkerson's blocking duality is an analogue on…