Reliability of rank order in sampled networks

In complex scale-free networks, ranking the individual nodes based upon their importance has useful applications, such as the identification of hubs for epidemic control, or bottlenecks for controlling traffic congestion. However, in most real situations, only limited sub-structures of entire networks are available, and therefore the reliability of the order relationships in sampled networks requires investigation. With a set of randomly sampled nodes from the underlying original networks, we rank individual nodes by three centrality measures: degree, betweenness, and closeness. The higher-ranking nodes from the sampled networks provide a relatively better characterisation of their ranks in the original networks than the lower-ranking nodes. A closeness-based order relationship is more reliable than any other quantity, due to the global nature of the closeness measure. In addition, we show that if access to hubs is limited during the sampling process, an increase in the sampling fraction can in fact decrease the sampling accuracy. Finally, an estimation method for assessing sampling accuracy is suggested.
Publisher
SPRINGER
Issue Date
2007-01
Language
ENG
Keywords

SCALE-FREE NETWORKS; COMPLEX NETWORKS; SOCIAL NETWORKS; DEGREE SEQUENCE; CENTRALITY; EVOLUTION; TOPOLOGY

Citation

EUROPEAN PHYSICAL JOURNAL B, v.55, pp.109 - 114

ISSN
1434-6028
DOI
10.1140/epjb/e2007-00033-7
URI
http://hdl.handle.net/10203/1703
Appears in Collection
PH-Journal Papers(저널논문)
Files in This Item
PJKim_Rank.pdf(1.74 MB)Download
  • Hit : 451
  • Download : 249
  • Cited 0 times in thomson ci
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡClick to seewebofscience_button
⊙ Cited 12 items in WoSClick to see citing articles inrecords_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0