Entropia de informação de redes clássicas e complexas

Abstract

Studies in complex networks are essential in many fields of knowledge (science) because of their ability to represent real systems. Some studies show that through the discussion of the matrices that make up a network it is possible to extract properties and analyze them from the perspective of Quantum Mechanics. In this work, we will discuss the von Neumann entropy as an information quantifier present in random graphs. In this monographwe will study three types of networks: Regular Network with k = 4, Erdös and Rényi random model and Scale-Free network using Barabási-Albert model, we will observe the von Neumann entropy for three different topologies.