Spanning tree modulus for secure broadcast games
| Autor: | Pietro Poggi-Corradini, Nathan Albin, Kapila Kottegoda |
|---|---|
| Rok vydání: | 2019 |
| Předmět: |
Theoretical computer science
TheoryofComputation_COMPUTATIONBYABSTRACTDEVICES Computer Networks and Communications Network security Computer science 0211 other engineering and technologies Modulus 02 engineering and technology Interpretation (model theory) 0502 economics and business ComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATION FOS: Mathematics Mathematics - Combinatorics 050210 logistics & transportation 021103 operations research Spanning tree business.industry 05 social sciences Probabilistic logic Hardware and Architecture Graph (abstract data type) Probability distribution Combinatorics (math.CO) business Game theory Software Information Systems |
| DOI: | 10.48550/arxiv.1904.03962 |
| Popis: | 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 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|