Skip to contents

Largest k such that the node's closed neighborhood contains at least k nodes with degree >= k. Network analogue of the h-index.

Usage

centrality_lobby(x, mode = "all", ...)

Arguments

x

Network input (matrix, igraph, network, cograph_network, tna object).

mode

For directed networks: "all" (default), "in", or "out".

...

Additional arguments passed to centrality (e.g., normalized, weighted, directed).

Value

Named integer vector of lobby index values.

See also

centrality for computing multiple measures at once.

Examples

adj <- matrix(c(0, 1, 1, 1, 0, 1, 1, 1, 0), 3, 3)
rownames(adj) <- colnames(adj) <- c("A", "B", "C")
centrality_lobby(adj)
#> A B C 
#> 2 2 2