Searchability of central nodes in networks
arXiv:1302.4572 · doi:10.1007/s10955-013-0727-7
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.
arXiv comment15 pages, 3 figures, 1 table, v2: minor corrections
References in corpus (19)
- Emergence of scaling in random networks
- Statistical mechanics of complex networks
- Cooperative Game Theory Approaches for Network Partitioning
- The structure of scientific collaboration networks
- Identification of influential spreaders in complex networks
- Mean-field theory for scale-free random networks
- Structure and tie strengths in mobile communication networks
- Self-similar community structure in organisations
- Structure of Growing Networks: Exact Solution of the Barabasi--Albert's Model
- Search in Power-Law Networks
- Connectivity of Growing Random Networks
- Community Structure in Jazz
- Navigability of Complex Networks
- Epidemic threshold in structured scale-free networks
- A measure of individual role in collective dynamics
- Searchability of Networks
- Hide and seek on complex networks
- Degree Landscapes in Scale-Free Networks
- Heterogeneity shapes groups growth in social online communities