• JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
 
  Bookmark and Share
 
 
Master's Dissertation
DOI
https://doi.org/10.11606/D.76.2023.tde-12062023-084122
Document
Author
Full name
João Vitor Bevilacqua de Souza Merenda
Institute/School/College
Knowledge Area
Date of Defense
Published
São Carlos, 2023
Supervisor
Committee
Bruno, Odemir Martinez (President)
Backes, André Ricardo
Liang, Zhao
Title in Portuguese
Reconhecimento de padrões em redes complexas usando caminhadas determinísticas do turista
Keywords in Portuguese
Autômatos
Caminhada determinística do turista
Reconhecimento de padrões
Redes complexas
Abstract in Portuguese
A ciência de redes tem tornado-se cada vez mais presente, tanto em meios acadêmicos quanto na indústria e no cotidiano. Diversos sistemas reais, considerados complexos, podem ser reduzidos a uma rede, onde o formalismo exibe um número pequeno de variáveis. Dentre os sistemas que podem ser representados por redes estão: as redes sociais, redes de reações químicas, teias alimentares e redes neurais. Dado o elevado número de aplicações no mundo real, tornou-se imprescindível reconhecer padrões, encontrar variáveis determinantes que definem a estrutura da rede. Nessa dissertação abordaremos dois métodos para o reconhecimento de padrão em redes. O primeiro foi desenvolvido para estudar redes de pequeno-mundo e o segundo para analisar tanto redes sintéticas quanto redes reais. O primeiro método mostrou bons resultados em mostrar a transição de rede regular para rede aleatória em grafos de Watts-Strogatz. O segundo método, chamado de caminhada determinística do turista com bifurcações, mostrou bom desempenho na classificação de redes sintéticas e de redes reais.
Title in English
Pattern recognition in complex networks using deterministic tourist walks
Keywords in English
Automata
Complex networks
Deterministic tourist walk
Pattern recognition
Abstract in English
Network science has become increasingly present in academic circles, industry, and everyday life. Many real-world systems, considered complex systems, can be reduced to a network since this formalism exhibits a short number of variables. Some systems, such as social networks, chemical reaction networks, food webs, and neural networks, can be represented by networks. Therefore, it has become fundamental to recognize patterns and find a variable set that defines the network structure. In this dissertation, we will discuss two methods for pattern recognition in networks. The first method was developed to study small-world networks, and the second algorithm was made to analyze both synthetic and real-world networks. The first method presented well results in verifying the transition from regular network to random network in Watts-Strogatz graphs. The second method, called deterministic tourist walk with bifurcations, got a good performance in the synthetic and real-world network classification.
 
WARNING - Viewing this document is conditioned on your acceptance of the following terms of use:
This document is only for private use for research and teaching activities. Reproduction for commercial use is forbidden. This rights cover the whole data about this document as well as its contents. Any uses or copies of this document in whole or in part must include the author's name.
Publishing Date
2023-06-14
 
WARNING: Learn what derived works are clicking here.
All rights of the thesis/dissertation are from the authors
CeTI-SC/STI
Digital Library of Theses and Dissertations of USP. Copyright © 2001-2024. All rights reserved.