TY - JOUR

T1 - Anomalous biased diffusion in networks

AU - Skarpalezos, Loukas

AU - Kittas, Aristotelis

AU - Argyrakis, Panos

AU - Cohen, Reuven

AU - Havlin, Shlomo

PY - 2013/7/30

Y1 - 2013/7/30

N2 - We study diffusion with a bias toward a target node in networks. This problem is relevant to efficient routing strategies in emerging communication networks like optical networks. Bias is represented by a probability p of the packet or particle to travel at every hop toward a site that is along the shortest path to the target node. We investigate the scaling of the mean first passage time (MFPT) with the size of the network. We find by using theoretical analysis and computer simulations that for random regular (RR) and Erdos-Rényi networks, there exists a threshold probability, p th, such that for pth the MFPT scales anomalously as Nα, where N is the number of nodes, and α depends on p. For p>pth, the MFPT scales logarithmically with N. The threshold value pth of the bias parameter for which the regime transition occurs is found to depend only on the mean degree of the nodes. An exact solution for every value of p is given for the scaling of the MFPT in RR networks. The regime transition is also observed for the second moment of the probability distribution function, the standard deviation. For the case of scale-free (SF) networks, we present analytical bounds and simulations results showing that the MFPT scales at most as lnN to a positive power for any finite bias, which means that in SF networks even a very small bias is considerably more efficient in comparison to unbiased walk.

AB - We study diffusion with a bias toward a target node in networks. This problem is relevant to efficient routing strategies in emerging communication networks like optical networks. Bias is represented by a probability p of the packet or particle to travel at every hop toward a site that is along the shortest path to the target node. We investigate the scaling of the mean first passage time (MFPT) with the size of the network. We find by using theoretical analysis and computer simulations that for random regular (RR) and Erdos-Rényi networks, there exists a threshold probability, p th, such that for pth the MFPT scales anomalously as Nα, where N is the number of nodes, and α depends on p. For p>pth, the MFPT scales logarithmically with N. The threshold value pth of the bias parameter for which the regime transition occurs is found to depend only on the mean degree of the nodes. An exact solution for every value of p is given for the scaling of the MFPT in RR networks. The regime transition is also observed for the second moment of the probability distribution function, the standard deviation. For the case of scale-free (SF) networks, we present analytical bounds and simulations results showing that the MFPT scales at most as lnN to a positive power for any finite bias, which means that in SF networks even a very small bias is considerably more efficient in comparison to unbiased walk.

UR - http://www.scopus.com/inward/record.url?scp=84881175631&partnerID=8YFLogxK

U2 - 10.1103/PhysRevE.88.012817

DO - 10.1103/PhysRevE.88.012817

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

C2 - 23944528

AN - SCOPUS:84881175631

SN - 1539-3755

VL - 88

JO - Physical Review E

JF - Physical Review E

IS - 1

M1 - 012817

ER -