centr_eigen_tmax

0th

Percentile

Theoretical maximum for betweenness centralization

See centralize for a summary of graph centralization.

Usage
centr_eigen_tmax(graph = NULL, nodes = 0, directed = FALSE,
  scale = TRUE)
Arguments
graph

The input graph. It can also be NULL, if nodes is 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.

scale

Whether to rescale the eigenvector centrality scores, such that the maximum score is one.

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_tmax, centr_betw, centr_clo_tmax, centr_clo, centr_degree_tmax, centr_degree, centr_eigen, centralize

Aliases
  • centr_eigen_tmax
  • centralization.evcent.tmax
Examples
# NOT RUN {
# A BA graph is quite centralized
g <- sample_pa(1000, m = 4)
centr_eigen(g, normalized = FALSE)$centralization %>%
 `/`(centr_eigen_tmax(g))
centr_eigen(g, normalized = TRUE)$centralization
# }
Documentation reproduced from package igraph, version 1.2.2, License: GPL (>= 2)

Community examples

Looks like there are no examples yet.