Spanning tree modulus for secure broadcast games
Combinatorics
2019-04-09 v1
Abstract
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 an interesting probabilistic interpretation. In particular, the -modulus problem in this case has been shown to be equivalent to the problem of finding a probability distribution on spanning trees that utilizes the edges of the graph as evenly as possible. In the present work, we use this fact to produce a game-theoretic interpretation of modulus by employing modulus to solve a secure broadcast game.
Cite
@article{arxiv.1904.03962,
title = {Spanning tree modulus for secure broadcast games},
author = {Nathan Albin and Kapila Kottegoda and Pietro Poggi-Corradini},
journal= {arXiv preprint arXiv:1904.03962},
year = {2019}
}