Um algoritmo de difusão em redes com encontros probabilísticos

• Autor(a) principal: Ribeiro, Victor de Paula Dornellas
• Data de Publicação: 2021
• Tipo de documento: Dissertação
• Idioma: por
• Título da fonte: Biblioteca Digital de Teses e Dissertações do LNCC
• Texto Completo: https://tede.lncc.br/handle/tede/340
• topic: Embedding theorems; Redes dinâmicas; Teoria dos grafos; Algoritmos; CNPQ::CIENCIAS EXATAS E DA TERRA::MATEMATICA::ANALISE

The 20th century was marked by the development and spread of information technologies, witch increased the amount of information diffusion over society. Thus, the growing number of participants in a communication network has made challenging some tasks as message delivey. It is noteworthy the technoligical evolution let some network topology changes to happen. As communication networks, there are many fenomena tha can be represented by complex networks. Some networks can not be process due to its large ammount of nodes. This problem can be avoid by using embedding techniques. Graph embedding is a group of functions witch aims finding a vectorial representation from graph structures, preserving some networks propperties. Over latent space we are abble to perform operations analogous to those on graphs. We present in this dissertation an algorithm for solving an information difusion process over the embedding space.