期刊
PHYSICAL REVIEW LETTERS
卷 99, 期 9, 页码 -出版社
AMER PHYSICAL SOC
DOI: 10.1103/PhysRevLett.99.098701
关键词
-
We study random walks on large random graphs that are biased towards a randomly chosen but fixed target node. We show that a critical bias strength b(c) exists such that most walks find the target within a finite time when b > b(c). For b < b(c), a finite fraction of walks drift off to infinity before hitting the target. The phase transition at b=b(c) is a critical point in the sense that quantities such as the return probability P(t) show power laws, but finite-size behavior is complex and does not obey the usual finite-size scaling ansatz. By extending rigorous results for biased walks on Galton-Watson trees, we give the exact analytical value for b(c) and verify it by large scale simulations.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据