Entropy of tournament digraphs

DOI10.1016/j.laa.2019.09.026zbMath1440.05101arXiv1812.09458OpenAlexW2975858863WikidataQ127202331 ScholiaQ127202331MaRDI QIDQ2332443

Yanyan Li

Publication date: 4 November 2019

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1812.09458

zbMATH Keywords

spectral theorytournamentsLaplacianShannon entropyRényi entropy

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20) Coding theorems (Shannon theory) (94A24) Random walks on graphs (05C81)

Uses Software

• OEIS

Cites Work

• Note on von Neumann and Rényi entropies of a graph
• A history of graph entropy measures
• The Laplacian of a graph as a density matrix: a basic combinatorial approach to separability of mixed states
• On the Number of 4-Cycles in a Tournament
• Interpreting the von Neumann entropy of graph Laplacians, and coentropic graphs
• Quantum Computation and Quantum Information
• The on-line encyclopedia of integer sequences
• Unnamed Item
• Unnamed Item

This page was built for publication: Entropy of tournament digraphs