Centralize a graph according to the degrees of verticesSource:
centralize() for a summary of graph centralization.
centr_degree( graph, mode = c("all", "out", "in", "total"), loops = TRUE, normalized = TRUE )
The input graph.
This is the same as the
Logical scalar, whether to consider loops edges when calculating the degree.
Logical scalar. Whether to normalize the graph level centrality score by dividing by the theoretical maximum.
A named list with the following components:
The node-level centrality scores.
The graph level centrality index.
The maximum theoretical graph level centralization score for a graph with the given number of vertices, using the same parameters. If the
TRUE, then the result was divided by this number.
Other centralization related:
# A BA graph is quite centralized g <- sample_pa(1000, m = 4) centr_degree(g)$centralization #>  0.1658415 centr_clo(g, mode = "all")$centralization #>  0.4299737 centr_betw(g, directed = FALSE)$centralization #>  0.2556298 centr_eigen(g, directed = FALSE)$centralization #>  0.9438796