gives a list of status centralities for the vertices in the graph g.
StatusCentrality[{vw,…}]
uses rules vw to specify the graph g.
StatusCentrality
gives a list of status centralities for the vertices in the graph g.
StatusCentrality[{vw,…}]
uses rules vw to specify the graph g.
Details and Options
- StatusCentrality gives a list of centralities
that satisfy
, 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.
- StatusCentrality works with undirected graphs, directed graphs, multigraphs, and mixed graphs.
Examples
open all close allBasic Examples (2)
g = ExampleData[{"NetworkGraph", "Friendship"}];StatusCentrality[g]HighlightGraph[g, VertexList[g], VertexSize -> Thread[VertexList[g] -> Rescale[%]]]Rank vertices. Highest-ranked vertices are connected from other well-connected vertices:
g = ExampleData[{"NetworkGraph", "Friendship"}];Part[VertexList[g], Ordering[StatusCentrality[g], All, Greater]]Scope (6)
StatusCentrality works with undirected graphs:
StatusCentrality[[image]]StatusCentrality[[image]]StatusCentrality[[image]]StatusCentrality[[image]]Use rules to specify the graph:
StatusCentrality[{1 -> 3, 2 -> 1, 3 -> 6, 4 -> 6, 1 -> 5, 5 -> 4, 6 -> 1}]StatusCentrality works with large graphs:
g = RandomGraph[{10000, 10005}];StatusCentrality[g, WorkingPrecision -> 20]//Shallow//TimingOptions (3)
WorkingPrecision (3)
By default, StatusCentrality finds centralities using machine-precision computations:
StatusCentrality[[image]]Specify a higher working precision:
StatusCentrality[[image], WorkingPrecision -> 50]Infinite working precision corresponds to exact computation:
StatusCentrality[[image] , WorkingPrecision -> ∞]Applications (1)
Highlight the status centrality for StarGraph:
HighlightCentrality[g_, cc_] := HighlightGraph[g, Table[Style[VertexList[g][[i]], ColorData["TemperatureMap"][cc[[i]] / Max[cc]]], {i, VertexCount[g]}]];g = StarGraph[8, VertexSize -> Large];cc = StatusCentrality[g];HighlightCentrality[g, cc]g = GridGraph[{10, 10}, VertexSize -> Large];cc = StatusCentrality[g];HighlightCentrality[g, cc]g = CompleteKaryTree[3, 3, VertexSize -> Large];cc = StatusCentrality[g];HighlightCentrality[g, cc]g = PathGraph[Range[20], VertexSize -> Large];cc = StatusCentrality[g];HighlightCentrality[g, cc]Properties & Relations (2)
Status centrality for isolated vertices is taken to be zero:
StatusCentrality[[image]]Use VertexIndex to obtain the centrality of a specific vertex:
g = ExampleData[{"NetworkGraph", "Friendship"}];StatusCentrality[g][[VertexIndex[g, "Anna"]]]Related Guides
Text
Wolfram Research (2012), StatusCentrality, Wolfram Language function, https://reference.wolfram.com/language/ref/StatusCentrality.html (updated 2015).
CMS
Wolfram Language. 2012. "StatusCentrality." Wolfram Language & System Documentation Center. Wolfram Research. Last Modified 2015. https://reference.wolfram.com/language/ref/StatusCentrality.html.
APA
Wolfram Language. (2012). StatusCentrality. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/ref/StatusCentrality.html
BibTeX
@misc{reference.wolfram_2026_statuscentrality, author="Wolfram Research", title="{StatusCentrality}", year="2015", howpublished="\url{https://reference.wolfram.com/language/ref/StatusCentrality.html}", note=[Accessed: 13-June-2026]}
BibLaTeX
@online{reference.wolfram_2026_statuscentrality, organization={Wolfram Research}, title={StatusCentrality}, year={2015}, url={https://reference.wolfram.com/language/ref/StatusCentrality.html}, note=[Accessed: 13-June-2026]}