Análise e comparação entre algoritmos de percolação

• Ano de defesa: 2008
• Autor(a) principal: Silva, Isaac Dayan Bastos da
• Tipo de documento: Dissertação
• Tipo de acesso: Acesso aberto
• Idioma: por
• Instituição de defesa: Universidade Federal do Rio Grande do Norte; BR; UFRN; Programa de Pós-Graduação em Matemática Aplicada e Estatística; Probabilidade e Estatística; Modelagem Matemática
• Palavras-chave em Português: Percolação; Complexidade de algoritmos; Algoritmos de percolação; Algoritmos de Ziff e Neuman; Algoritmo de Elias; Percolation; Algorithms complexity; Percolation algorithms; Newman and Ziff algorithm; Elias algorithm; CNPQ::CIENCIAS EXATAS E DA TERRA::MATEMATICA::MATEMATICA APLICADA
• Link de acesso: https://repositorio.ufrn.br/jspui/handle/123456789/17000

In this work, we study and compare two percolation algorithms, one of then elaborated by Elias, and the other one by Newman and Ziff, using theorical tools of algorithms complexity and another algorithm that makes an experimental comparation. This work is divided in three chapters. The first one approaches some necessary definitions and theorems to a more formal mathematical study of percolation. The second presents technics that were used for the estimative calculation of the algorithms complexity, are they: worse case, better case e average case. We use the technique of the worse case to estimate the complexity of both algorithms and thus we can compare them. The last chapter shows several characteristics of each one of the algorithms and through the theoretical estimate of the complexity and the comparison between the execution time of the most important part of each one, we can compare these important algorithms that simulate the percolation.