Entropy of Tournament Digraphs

David E. Brown, Eric Culver, Bryce Frederickson +2

The Rényi $\alpha$-entropy $H_{\alpha }$ of complete antisymmetric directed graphs (i.e., tournaments) is explored. We optimize $H_{\alpha }$ when $\alpha =2$ and $3$, and find that as $\alpha$ increases $H_{\alpha }$'s…