TY - JOUR
T1 - Ranking and clustering of nodes in networks with smart teleportation
AU - Lambiotte, R.
AU - Rosvall, M.
N1 - Copyright 2012 Elsevier B.V., All rights reserved.
PY - 2012/5/8
Y1 - 2012/5/8
N2 - Random teleportation is a necessary evil for ranking and clustering directed networks based on random walks. Teleportation enables ergodic solutions, but the solutions must necessarily depend on the exact implementation and parametrization of the teleportation. For example, in the commonly used PageRank algorithm, the teleportation rate must trade off a heavily biased solution with a uniform solution. Here we show that teleportation to links rather than nodes enables a much smoother trade-off and effectively more robust results. We also show that, by not recording the teleportation steps of the random walker, we can further reduce the effect of teleportation with dramatic effects on clustering. © 2012 American Physical Society.
AB - Random teleportation is a necessary evil for ranking and clustering directed networks based on random walks. Teleportation enables ergodic solutions, but the solutions must necessarily depend on the exact implementation and parametrization of the teleportation. For example, in the commonly used PageRank algorithm, the teleportation rate must trade off a heavily biased solution with a uniform solution. Here we show that teleportation to links rather than nodes enables a much smoother trade-off and effectively more robust results. We also show that, by not recording the teleportation steps of the random walker, we can further reduce the effect of teleportation with dramatic effects on clustering. © 2012 American Physical Society.
UR - http://www.scopus.com/inward/record.url?scp=84861957197&partnerID=8YFLogxK
U2 - 10.1103/PhysRevE.85.056107
DO - 10.1103/PhysRevE.85.056107
M3 - Article
SN - 1539-3755
VL - 85
JO - Physical Review E - Statistical, Nonlinear, and Soft Matter Physics
JF - Physical Review E - Statistical, Nonlinear, and Soft Matter Physics
IS - 5
ER -