Networks: a random walk in degree space
The present work aims to contribute to the study of networks by mapping the temporal evolution of the degree to a random walk in degree space. We analyzed how and when the degree approximates a pre-established value through a parallel with the first-passage problem of random walks. The mean time for...
| Autor: | |
|---|---|
| Tipo de recurso: | tesis de maestría |
| Estado: | Versión publicada |
| Fecha de publicación: | 2018 |
| País: | Brasil |
| Institución: | Universidade de São Paulo (USP) |
| Repositorio: | Biblioteca Digital de Teses e Dissertações da USP |
| Idioma: | inglés |
| OAI Identifier: | oai:teses.usp.br:tde-25072018-200138 |
| Acceso en línea: | http://www.teses.usp.br/teses/disponiveis/100/100132/tde-25072018-200138/ |
| Access Level: | acceso abierto |
| Palabra clave: | Networks Passeio aleatório Random walk Redes |
| Sumario: | The present work aims to contribute to the study of networks by mapping the temporal evolution of the degree to a random walk in degree space. We analyzed how and when the degree approximates a pre-established value through a parallel with the first-passage problem of random walks. The mean time for the first-passage was calculated for the dynamical versions the Watts-Strogatz and Erdos-Renyi models. We also analyzed the degree variance for the random recursive tree and Barabasi-Albert models |
|---|