Theoretical maximum for betweenness centralization — centr_betw_tmax • igraph

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 if nodes and directed are both 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. Ignored if an undirected graph was given.

Value

Real scalar, the theoretical maximum (unnormalized) graph betweenness centrality score for graphs with given order and other parameters.

See also

Other centralization related: centr_betw(), centr_clo(), centr_clo_tmax(), centr_degree(), centr_degree_tmax(), centr_eigen(), centr_eigen_tmax(), centralize()

igraph_centralization_betweenness_tmax().

Examples

# A BA graph is quite centralized
g <- sample_pa(1000, m = 4)
centr_betw(g, normalized = FALSE)$centralization %>%
  `/`(centr_betw_tmax(g))
#> [1] 0.0005692495
centr_betw(g, normalized = TRUE)$centralization
#> [1] 0.0005692495