RadialityCentrality

RadialityCentrality[g]
gives a list of radiality centralities for the vertices in the graph g.

RadialityCentrality[g, "In"]
gives a list of in-centralities for a directed graph g.

RadialityCentrality[g, "Out"]
gives a list of out-centralities for a directed graph g.

DetailsDetails

  • Radiality in-centralities are also known as integration centralities.
  • RadialityCentrality will give high centralities to vertices that are a short distance to every other vertex in its reachable neighborhood compared to its diameter.
  • Radiality out-centrality for a vertex is computed using the out component for the vertex and is given by , where is the distance from to in , is the diameter of , and the sum is over the vertices in .
  • Radiality in-centrality for a vertex is computed using the in component for the vertex and is given by , where is the distance from to in , is the diameter of , and the sum is over the vertices in .
  • The radiality centrality for an isolated vertex is taken to be zero.

ExamplesExamplesopen allclose all

Basic Examples (2)Basic Examples (2)

Compute radiality centralities:

In[1]:=
Click for copyable input
In[2]:=
Click for copyable input
Out[2]=

Highlight:

In[3]:=
Click for copyable input
Out[3]=

Rank vertices. Highest-ranked vertices are at a short distance to all reachable vertices compared to the highest distance in the graph:

In[1]:=
Click for copyable input
In[2]:=
Click for copyable input
Out[2]=
New in 9
New to Mathematica? Find your learning path »
Have a question? Ask support »