Abstract
In this paper we explore how the von Neumann entropy can be used as a measure of graph complexity. We also develop a simplified form for the von Neumann entropy of a graph that can be computed in terms of node degree statistics. We compare the resulting complexity with Estrada’s heterogeneity index which measures the heterogeneity of the node degree across a graph and reveal a new link between Estrada’s index and the commute time on a graph. Finally, we explore how the von Neumann entropy can be used in conjunction with thermodynamic depth. This measure has been shown to overcome problems associated with iso-spectrality encountered when using complexity measures based on spectral graph theory. Our experimental evaluation of the simplified von Neumann entropy explores (a) the accuracy of the underlying approximation, (b) a comparison with alternative graph characterizations, and (c) the application of the entropy-based thermodynamic depth to characterize protein–protein interaction networks.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
