GraphTheory - Maple Programming Help

Online Help

All Products    Maple    MapleSim


Home : Support : Online Help : Mathematics : Discrete Mathematics : Graph Theory : GraphTheory Package : GraphTheory/PageRankCentrality

GraphTheory

  

PageRankCentrality

  

compute PageRank centrality

 

Calling Sequence

Parameters

Description

Examples

Compatibility

Calling Sequence

PageRankCentrality(G, alpha, )

PageRankCentrality(G, alpha, v)

Parameters

G

-

graph

alpha

-

real constant

v

-

(optional) a vertex of G

Description

• 

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.

Examples

withGraphTheory:

Compute the PageRank centrality for a specified graph.

GGraph6,1,3,1,6,2,4,2,6,3,6,4,5,4,6,5,6

GGraph 1: an undirected unweighted graph with 6 vertices and 8 edge(s)

(1)

DrawGraphG

PageRankCentralityG,0.1

0.161848054511877,0.159412214226581,0.161848054511877,0.169696873208941,0.159412214226581,0.187782589314144

(2)

Compatibility

• 

The GraphTheory[PageRankCentrality] command was introduced in Maple 2020.

• 

For more information on Maple 2020 changes, see Updates in Maple 2020.

See Also

BetweennessCentrality

ClosenessCentrality

DegreeCentrality

EigenvectorCentrality

HarmonicCentrality

InformationCentrality

KatzCentrality