arXiv · 1302.4572
Searchability of central nodes in networks
Abstract
Social networks are discrete systems with a large amount of heterogeneity among nodes (individuals). Measures of centrality aim at a quantification of nodes' importance for structure and function. Here we ask to which extent the most central nodes can be found by purely local search. We find that many networks have close-to-optimal searchability under eigenvector centrality, outperforming searches for degree and betweenness. Searchability of the strongest spreaders in epidemic dynamics tends to be substantially larger for supercritical than for subcritical spreading.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Konstantin Klemm. 2013-06-11. Searchability of central nodes in networks. https://doi.org/10.1007/s10955-013-0727-7
Cite the original work for its findings. Save a collection to share your selection of sources.