centr_betw: Centralize a graph according to the betweenness of vertices

Description Usage Arguments Value See Also Examples

View source: R/auto.R

Description

See centralize for a summary of graph centralization.

Usage

1
centr_betw(graph, directed = TRUE, nobigint = TRUE, normalized = TRUE)

Arguments

graph

The input graph.

directed

logical scalar, whether to use directed shortest paths for calculating betweenness.

nobigint

Logical scalar, whether to use big integers for the betweenness calculation. This argument is passed to the betweenness function.

normalized

Logical scalar. Whether to normalize the graph level centrality score by dividing by the theoretical maximum.

Value

A named list with the following components:

res

The node-level centrality scores.

centralization

The graph level centrality index.

theoretical_max

The maximum theoretical graph level centralization score for a graph with the given number of vertices, using the same parameters. If the normalized argument was TRUE, then the result was divided by this number.

See Also

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

Examples

1
2
3
4
5
6
# A BA graph is quite centralized
g <- sample_pa(1000, m = 4)
centr_degree(g)$centralization
centr_clo(g, mode = "all")$centralization
centr_betw(g, directed = FALSE)$centralization
centr_eigen(g, directed = FALSE)$centralization

Example output

Attaching package: 'igraph'

The following objects are masked from 'package:stats':

    decompose, spectrum

The following object is masked from 'package:base':

    union

[1] 0.1588275
[1] 0.4222048
[1] 0.2493544
[1] 0.9453363

igraph documentation built on March 19, 2020, 5:13 p.m.

Related to centr_betw in igraph...