Pagerank Personalization Vector , Edge Weights And Dangling Dictionary (teleportation Vector)

This is the pagerank function from networkx def pagerank(G, alpha=0.85, personalization=None, max_iter=100, tol=1.0e-6, nstart=None, weight='weight', dang

Solution 1:

This isn't really a programming question but I'll answer anyway.

In the NetworkX implementation if you set a personalization vector those values will also used for the "dangling nodes" - you cannot set the dangling node values separately.

The 'weight=' parameter gives the edge attribute to be used as a numeric edge weight. The default with weight=None sets all of the weights equal (to 1). You can adjust them as you like according to properties in your graph if you want to bias certain edges.