Smart random walkers: the cost of knowing the path

Perotti, Juan I. and Billoni, Orlando V. Smart random walkers: the cost of knowing the path. Physical Review E, 86. 011120. ISSN 1539-3755 (2012)

Preview

PDF - Published Version Download (546kB) | Preview

Abstract

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 imposes a restriction on the long paths and therefore focuses the signal to the target. By this scheme we go continuously from fully random walkers to walkers biased to the target. We found that the optimal degree of penalization is mainly determined by the topology of the network. By analyzing several examples, we have found that a small amount of penalization reduces considerably the typical walk length, and from this we conclude that a network can be efficiently navigated with restricted information.

Item Type:	Article
Identification Number:	https://doi.org/10.1103/PhysRevE.86.011120
Additional Information:	© 2012 American Physical Society
Uncontrolled Keywords:	PACS number(s): 05.40.Fb, 89.70.Hj, 89.70.Cf
Subjects:	Q Science > QC Physics
Research Area:	Economics and Institutional Change
Depositing User:	Ms T. Iannizzi
Date Deposited:	04 Dec 2014 09:48
Last Modified:	04 Dec 2014 11:46
URI:	http://eprints.imtlucca.it/id/eprint/2399

Actions (login required)

Edit Item