page.rank(graph, nodes = V(graph), directed = is.directed(graph),
niter = 1000, eps = 0.001, damping = 0.85)
Since the calculation is an iterative process, the algorithm is stopped after a given count of iterations or if the PageRank value differences between iterations are less than a predefined value.
For the explanation of the PageRank algorithm, see the following
webpage:
Sergey Brin and Larry Page: The Anatomy of a Large-Scale Hypertextual Web Search Engine. Proceedings of the 7th World-Wide Web Conference, Brisbane, Australia, April 1998.
closeness
,
betweenness
, degree
g <- random.graph.game(20, 5/20, directed=TRUE)
page.rank(g)
g2 <- graph.star(10)
page.rank(g2)
Run the code above in your browser using DataCamp Workspace