centr_betw_tmax
Theoretical maximum for betweenness centralization
See centralize for a summary of graph centralization.
Usage
centr_betw_tmax(graph = NULL, nodes = 0, directed = TRUE)Arguments
- graph
The input graph. It can also be
NULL, ifnodesis given.- nodes
The number of vertices. This is ignored if the graph is given.
- directed
logical scalar, whether to use directed shortest paths for calculating betweenness.
Value
Real scalar, the theoratical maximum (unnormalized) graph betweenness centrality score for graphs with given order and other parameters.
See Also
Other centralization related: centr_betw,
centralization.betweenness;
centr_clo_tmax,
centralization.closeness.tmax;
centr_clo,
centralization.closeness;
centr_degree_tmax,
centralization.degree.tmax;
centr_degree,
centralization.degree;
centr_eigen_tmax,
centralization.evcent.tmax;
centr_eigen,
centralization.evcent;
centralization, centralize,
centralize.scores
Examples
# NOT RUN {
# A BA graph is quite centralized
g <- sample_pa(1000, m = 4)
centr_betw(g, normalized = FALSE)$centralization %>%
`/`(centr_betw_tmax(g))
centr_betw(g, normalized = TRUE)$centralization
# }