Biased random walks on Kleinberg’s spatial networks

Gui-Jun Pan and Rui-Wu Niu

Physica A: Statistical Mechanics and its Applications, 2016, vol. 463, issue C, 509-515

Abstract: We investigate the problem of the particle or message that travels as a biased random walk toward a target node in Kleinberg’s spatial network which is built from a d-dimensional (d=2) regular lattice improved by adding long-range shortcuts with probability P(rij)∼rij−α, where rij is the lattice distance between sites i and j, and α is a variable exponent. Bias is represented as a probability p of the packet to travel at every hop toward the node which has the smallest Manhattan distance to the target node. We study the mean first passage time (MFPT) for different exponent α and the scaling of the MFPT with the size of the network L. We find that there exists a threshold probability pth≈0.5, for p≥pth the optimal transportation condition is obtained with an optimal transport exponent αop=d, while for 0pth, and increases with L less than a power law and get close to logarithmical law for 0Keywords: Spacial network; Navigation; Optimization (search for similar items in EconPapers)
Date: 2016
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378437116304678
Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:phsmap:v:463:y:2016:i:c:p:509-515

DOI: 10.1016/j.physa.2016.07.036

Access Statistics for this article

Physica A: Statistical Mechanics and its Applications is currently edited by K. A. Dawson, J. O. Indekeu, H.E. Stanley and C. Tsallis

More articles in Physica A: Statistical Mechanics and its Applications from Elsevier
Bibliographic data for series maintained by Catherine Liu ().