Search in weighted complex networks
| dc.creator | Thadakamalla, Hari P. | |
| dc.creator | Albert, Reka | |
| dc.creator | Kumara, Soundar R. T. | |
| dc.date | 2005-11-18 | |
| dc.date | 2006-01-20 | |
| dc.date.accessioned | 2026-07-07T06:49:18Z | |
| dc.date.available | 2026-07-07T06:49:18Z | |
| dc.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. | |
| dc.description | 14 pages, 5 figures, 4 tables, minor changes, added a reference | |
| dc.identifier | https://arxiv.org/abs/cond-mat/0511476 | |
| dc.identifier | http://arxiv.org/abs/cond-mat/0511476 | |
| dc.identifier | Phys. Rev. E 72, 066128 (2005) | |
| dc.identifier | doi:10.1103/PhysRevE.72.066128 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/104290 | |
| dc.subject | Statistical Mechanics | |
| dc.subject | Disordered Systems and Neural Networks | |
| dc.title | Search in weighted complex networks | |
| dc.type | text |