ANÁLISE DA ENTROPIA EM REDES COMPLEXAS

• Ano de defesa: 2016
• Autor(a) principal: Vosgerau, Roberto Antonio
• Orientador(a): Pinto, Sandro Ely de Souza
• Banca de defesa: Iarosz, Kelly Cristiane , Silva, Sani de Carvalho Rutz da , Gomes, Adriano Doff Sotta , Szezech Júnior, José Danilo
• Tipo de documento: Tese
• Tipo de acesso: Acesso aberto
• Idioma: por
• Instituição de defesa: UNIVERSIDADE ESTADUAL DE PONTA GROSSA
• Programa de Pós-Graduação: Programa de Pós-Graduação em Ciências
• Departamento: Fisica
• País: BR
• Palavras-chave em Português: redes complexas; robustez; entropias estruturais
• Palavras-chave em Inglês: complex networks; robustness; structural entropy
• Área do conhecimento CNPq: CNPQ::CIENCIAS EXATAS E DA TERRA::FISICA
• Link de acesso: http://tede2.uepg.br/jspui/handle/prefix/859

In this thesis, we apply network entropy to analyze characteristics of complex networks. It is analyzed the effect of vertices removal on the structure and robustness of directed and undirected networks, as a result of failures and attacks. The variation in the structure and robustness of networks due to this removal is quantified by structural entropies with zero and one order approximation. These entropies are calculated to real networks to verify the robustness, where we have been using biological network as directed and literary network as undirected. The failures are simulated through vertices that are randomly removal, while the attacks are realized on the hubs and according to betweenness centrality. We observe that the network with failures exhibits entropies with values smaller than the original network. When the attack is on the hubs or according to the betweenness centrality we verify that the entropies decrease. However, if the attack is not on the hubs, it is possible to verify values of entropies larger than the original network. Moreover, the measure of the shortest path length showed a correlation with the structural entropy.