Busca avançada
Ano de início
Entree
(Referência obtida automaticamente do Web of Science, por meio da informação sobre o financiamento pela FAPESP e o número do processo correspondente, incluída na publicação pelos autores.)

Effective distances for epidemics spreading on complex networks

Texto completo
Autor(es):
Iannelli, Flavio ; Koher, Andreas ; Brockmann, Dirk ; Hoevel, Philipp ; Sokolov, Igor M.
Número total de Autores: 5
Tipo de documento: Artigo Científico
Fonte: Physical Review E; v. 95, n. 1 JAN 17 2017.
Citações Web of Science: 16
Resumo

We show that the recently introduced logarithmic metrics used to predict disease arrival times on complex networks are approximations of more general network-based measures derived from random walks theory. Using the daily air-traffic transportation data we perform numerical experiments to compare the infection arrival time with this alternative metric that is obtained by accounting for multiple walks instead of only the most probable path. The comparison with direct simulations reveals a higher correlation compared to the shortest-path approach used previously. In addition our method allows to connect fundamental observables in epidemic spreading with the cumulant-generating function of the hitting time for a Markov chain. Our results provides a general and computationally efficient approach using only algebraic methods. (AU)

Processo FAPESP: 15/50122-0 - Fenômenos dinâmicos em redes complexas: fundamentos e aplicações
Beneficiário:Elbert Einstein Nehrer Macau
Linha de fomento: Auxílio à Pesquisa - Temático