Reference Hub63
Quantifying Complexity in Networks: The von Neumann Entropy

Quantifying Complexity in Networks: The von Neumann Entropy

Filippo Passerini, Simone Severini
Copyright: © 2009 |Volume: 1 |Issue: 4 |Pages: 10
ISSN: 1943-0744|EISSN: 1943-0752|ISSN: 1943-0744|EISBN13: 9781616920814|EISSN: 1943-0752|DOI: 10.4018/jats.2009071005
Cite Article Cite Article

MLA

Passerini, Filippo, and Simone Severini. "Quantifying Complexity in Networks: The von Neumann Entropy." IJATS vol.1, no.4 2009: pp.58-67. http://doi.org/10.4018/jats.2009071005

APA

Passerini, F. & Severini, S. (2009). Quantifying Complexity in Networks: The von Neumann Entropy. International Journal of Agent Technologies and Systems (IJATS), 1(4), 58-67. http://doi.org/10.4018/jats.2009071005

Chicago

Passerini, Filippo, and Simone Severini. "Quantifying Complexity in Networks: The von Neumann Entropy," International Journal of Agent Technologies and Systems (IJATS) 1, no.4: 58-67. http://doi.org/10.4018/jats.2009071005

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

The authors introduce a novel entropic notion with the purpose of quantifying disorder/uncertainty in networks. This is based on the Laplacian and it is exactly the von Neumann entropy of certain quantum mechanical states. It is remarkable that the von Neumann entropy depends on spectral properties and it can be computed efficiently. The analytical results described here and the numerical computations lead us to conclude that the von Neumann entropy increases under edge addition, increases with the regularity properties of the network and with the number of its connected components. The notion opens the perspective of a wide interface between quantum information theory and the study of complex networks at the statistical level.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.