Ranking and clustering of nodes in networks with smart teleportation

Details Ranking and clustering of nodes in networks with smart teleportation Ranking and clustering of nodes in networks with smart teleportation

2011-12-22

arxiv.org/abs/1112.5252v1

Computer Science

Social and Information Networks

10 pages, 7 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Ranking and clustering of nodes in networks with smart teleportation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Ranking and clustering of nodes in networks with smart teleportation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Ranking and clustering of nodes in networks with smart teleportation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-306018