Diffusive capture processes for information search

Physics – Physics and Society

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

10.1016/j.physa.2007.07.022

We show how effectively the diffusive capture processes (DCP) on complex networks can be applied to information search in the networks. Numerical simulations show that our method generates only 2% of traffic compared with the most popular flooding-based query-packet-forwarding (FB) algorithm. We find that the average searching time, $$, of the our model is more scalable than another well known $n$-random walker model and comparable to the FB algorithm both on real Gnutella network and scale-free networks with $\gamma =2.4$. We also discuss the possible relationship between $$ and $$, the second moment of the degree distribution of the networks.

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

Diffusive capture processes for information search 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 Diffusive capture processes for information search, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Diffusive capture processes for information search will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-114090

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