Re: [igraph] personalized pagerank computation issue

[Tamas Nepusz]

• However, if I use personalized but some nodes have no outgoing edges, then the results differ.

How does your algorithm handle nodes with no outbound edges? When your random walker reaches such a node, does it jump randomly to any other node in the graph chosen from a uniform distribution, does it jump back to the starting point, does it jump back to some random node based on the personalization vector, or some other option?

All the best,

T.