Reliability of rank order in sampled networks

Details Reliability of rank order in sampled networks Reliability of rank order in sampled networks

2007-02-17

arxiv.org/abs/physics/0702148v1

Eur. Phys. J. B 55, 109-114 (2007)

Physics

Physics and Society

Scientific paper

10.1140/epjb/e2007-00033-7

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.

Affiliated with

Also associated with

No associations

Rating

Reliability of rank order in sampled networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Reliability of rank order in sampled networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Reliability of rank order in sampled networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-348454