A New Entropy for Hypergraphs

DOI10.1007/978-3-030-14085-4_12OpenAlexW2915561726MaRDI QIDQ5237052

Alain Bretto, Isabelle Bloch

Publication date: 16 October 2019

Published in: Discrete Geometry for Computer Imagery (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-14085-4_12

zbMATH Keywords

entropyhypergraphsalgebraic structuresgraphical structures

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Mathematical Theory of Communication
• 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 von Neumann entropy of a graph
• Hypergraph theory. An introduction
• Robust similarity between hypergraphs based on valuations and mathematical morphology operators
• Graph characteristics from the heat kernel trace
• Depth-based hypergraph complexity traces from directed line graphs
• Dynamical zeta functions
• GRAPH ZETA FUNCTION AND DIMENSION OF COMPLEX NETWORK

This page was built for publication: A New Entropy for Hypergraphs