Search in weighted complex networks Export

@misc{citeulike:403836, abstract = {We study complex 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 novel network measure, local betweenness centrality (LBC), utilizes the heterogeneity of both node degrees and edge weights to perform the best in power-law weighted networks. The search based on LBC is universal and performs well in a large class of complex networks.}, archivePrefix = {arXiv}, author = {Thadakamalla, Hari P. and Albert, Reka and Kumara, Soundar R. T.}, citeulike-article-id = {403836}, citeulike-linkout-0 = {http://arxiv.org/abs/cond-mat/0511476}, citeulike-linkout-1 = {http://arxiv.org/pdf/cond-mat/0511476}, day = {18}, eprint = {cond-mat/0511476}, keywords = {networks, powerlaws}, month = {Nov}, posted-at = {2005-11-21 21:46:03}, priority = {2}, title = {Search in weighted complex networks}, url = {http://arxiv.org/abs/cond-mat/0511476}, year = {2005} }

TY - ELEC ID - citeulike:403836 L3 - citeulike-article-id:403836 N2 - We study complex 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 novel network measure, local betweenness centrality (LBC), utilizes the heterogeneity of both node degrees and edge weights to perform the best in power-law weighted networks. The search based on LBC is universal and performs well in a large class of complex networks. TI - Search in weighted complex networks KW - networks KW - powerlaws AU - Thadakamalla, Hari AU - Albert, Reka AU - Kumara, Soundar PY - 2005/Nov/18/ UR - http://arxiv.org/abs/cond-mat/0511476 ER -