Smart random walkers: the cost of knowing the path

Details Smart random walkers: the cost of knowing the path Smart random walkers: the cost of knowing the path

2012-02-24

arxiv.org/abs/1202.5568v1

Physics

Condensed Matter

Statistical Mechanics

9 pages, 10 figures

Scientific paper

In this work we study the problem of targeting signals in networks using entropy information measurements to quantify the cost of targeting. We introduce a penalization rule that impose a restriction to the long paths and therefore focus the signal to the target. By this scheme we goes continuously from fully random walkers to a walker biased to the target. We found that the optimal degree of penalization is mainly determined by the topology of the network. By mean of the analysis of several examples we have found that a small amount of penalization reduce considerably the typical walk length, and from this we conclude that a network can be efficiently navigated with restricted information.

Affiliated with

Also associated with

No associations

Rating

Smart random walkers: the cost of knowing the path 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 Smart random walkers: the cost of knowing the path, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Smart random walkers: the cost of knowing the path will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-290407