StatusCentrality

StatusCentrality[g]
gives a list of status centralities for the vertices in the graph g.

Details and OptionsDetails and Options

  • StatusCentrality gives a list of centralities that satisfy c=alpha TemplateBox[{a}, Transpose].c+alpha beta, where is the adjacency matrix of g, is the vector of minimums between the inverse of the largest in- or out-degree of each vertex, and is the vertex in-degree of g.
  • The status centrality for an isolated vertex is taken to be zero.

ExamplesExamplesopen allclose all

Basic Examples (2)Basic Examples (2)

Compute status 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 connected from other well-connected vertices:

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 »