Searching for Nodes in Random Graphs

Physics – Condensed Matter – Statistical Mechanics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

13 pages, 12 figures

Scientific paper

We consider the problem of searching for a node on a labelled random graph according to a greedy algorithm that selects a route to the desired node using metric information on the graph. Motivated by peer-to-peer networks two types of random graph are proposed with properties particularly amenable to this kind of algorithm. We derive equations for the probability that the search is successful and also study the number of hops required, finding both numerical and analytic evidence of a transition as the number of links is varied.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Searching for Nodes in Random Graphs 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 Searching for Nodes in Random Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Searching for Nodes in Random Graphs will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-377414

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.