compute PageRank centrality
PageRankCentrality(G, alpha, )
PageRankCentrality(G, alpha, v)
(optional) a vertex of G
PageRankCentrality returns the PageRank centrality for a specified vertex in the given graph G, or if no vertex is specified, returns a list of the PageRank centralities for each vertex in G.
PageRank centrality computes the relative influence of a vertex within a network by counting the number of immediate neighbors and the total number of reachable vertices. Connections to distant vertices are penalized by an attenuation factor alpha.
Compute the PageRank centrality for a specified graph.
G ≔ Graph⁡6,1,3,1,6,2,6,2,4,3,6,4,6,4,5,5,6
G≔Graph 1: an undirected graph with 6 vertices and 8 edge(s)
The GraphTheory[PageRankCentrality] command was introduced in Maple 2020.
For more information on Maple 2020 changes, see Updates in Maple 2020.
Download Help Document