Spanning tree modulus for secure broadcast games

The theory of p‐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, p‐modulus has an interesting probabilistic interpretation. In particular, the 2‐modulus problem in this case has been shown to be equival...

Full description

Saved in:
Bibliographic Details
Published in:Networks 2020-10, Vol.76 (3), p.350-365
Main Authors: Albin, Nathan, Kottegoda, Kapila, Poggi‐Corradini, Pietro
Format: Article
Language:English
Subjects:
broadcast game
discrete modulus
game theory
Graph theory
network security
optimization
spanning trees
Statistical analysis
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The theory of p‐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, p‐modulus has an interesting probabilistic interpretation. In particular, the 2‐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 fairly 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.
ISSN:0028-3045
1097-0037
DOI:10.1002/net.21945