Shortest path discovery of complex networks

Details Shortest path discovery of complex networks Shortest path discovery of complex networks

2008-10-08

arxiv.org/abs/0810.1428v2

Physics

Condensed Matter

Disordered Systems and Neural Networks

10 pages, 4 figures

Scientific paper

In this paper we present an analytic study of sampled networks in the case of some important shortest-path sampling models. We present analytic formulas for the probability of edge discovery in the case of an evolving and a static network model. We also show that the number of discovered edges in a finite network scales much slower than predicted by earlier mean field models. Finally, we calculate the degree distribution of sampled networks, and we demonstrate that they are analogous to a destructed network obtained by randomly removing edges from the original network.

Affiliated with

Also associated with

No associations

Rating

Shortest path discovery of complex 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 Shortest path discovery of complex networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Shortest path discovery of complex networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-30121