Change search
ReferencesLink to record
Permanent link

Direct link
Ranking and clustering of nodes in networks with smart teleportation
Univ Namur, Dept Math & Naxys, B-5000 Namur, Belgium .
Umeå University, Faculty of Science and Technology, Department of Physics.
2012 (English)In: Physical Review E. Statistical, Nonlinear, and Soft Matter Physics, ISSN 1539-3755, Vol. 85, no 5, 056107- p.Article in journal (Refereed) Published
Abstract [en]

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.

Place, publisher, year, edition, pages
2012. Vol. 85, no 5, 056107- p.
National Category
Physical Sciences
URN: urn:nbn:se:umu:diva-56215DOI: 10.1103/PhysRevE.85.056107ISI: 000303759800001OAI: diva2:532925
Available from: 2012-06-12 Created: 2012-06-12 Last updated: 2012-06-12Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Rosvall, Martin
By organisation
Department of Physics
In the same journal
Physical Review E. Statistical, Nonlinear, and Soft Matter Physics
Physical Sciences

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 39 hits
ReferencesLink to record
Permanent link

Direct link