Robustness of Social Networks: Comparative Results Based on Distance Distributions

Details Robustness of Social Networks: Comparative Results Based on Distance Distributions Robustness of Social Networks: Comparative Results Based on Distance Distributions

2011-10-20

arxiv.org/abs/1110.4474v1

Computer Science

Social and Information Networks

Scientific paper

Given a social network, which of its nodes have a stronger impact in determining its structure? More formally: which node-removal order has the greatest impact on the network structure? We approach this well-known problem for the first time in a setting that combines both web graphs and social networks, using datasets that are orders of magnitude larger than those appearing in the previous literature, thanks to some recently developed algorithms and software tools that make it possible to approximate accurately the number of reachable pairs and the distribution of distances in a graph. Our experiments highlight deep differences in the structure of social networks and web graphs, show significant limitations of previous experimental results, and at the same time reveal clustering by label propagation as a new and very effective way of locating nodes that are important from a structural viewpoint.

Affiliated with

Also associated with

No associations

Rating

Robustness of Social Networks: Comparative Results Based on Distance Distributions 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 Robustness of Social Networks: Comparative Results Based on Distance Distributions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Robustness of Social Networks: Comparative Results Based on Distance Distributions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-551564