Search in weighted complex networks

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

We study trade-offs presented by local search algorithms in complex networks which are heterogeneous in edge weights and node degree. We show that search based on a network measure, local betweenness centrality (LBC), utilizes the heterogeneity of both node degrees and edge weights to perform the best in scale-free weighted networks. The search based on LBC is universal and performs well in a large class of complex networks.
14 pages, 5 figures, 4 tables, minor changes, added a reference

Keywords

Statistical Mechanics, Disordered Systems and Neural Networks

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/104290

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cond-mat/0511476
 http://arxiv.org/abs/cond-mat/0511476
 Phys. Rev. E 72, 066128 (2005)
 doi:10.1103/PhysRevE.72.066128

Collections

arXiv