Computes the rich club coefficient for a given degree threshold k. Measures the tendency of high-degree nodes to connect to each other. A normalized version compares to random graphs.
Arguments
- x
Network input: matrix, igraph, network, cograph_network, or tna object
- k
Degree threshold. Only nodes with degree > k are included. If NULL, uses median degree.
- normalized
Logical. Normalize by random graph expectation? Default FALSE.
- n_random
Number of random graphs for normalization. Default 10.
- ...
Additional arguments passed to
to_igraph
Examples
# Scale-free networks often show rich-club effect
if (requireNamespace("igraph", quietly = TRUE)) {
g <- igraph::sample_pa(50, m = 2, directed = FALSE)
network_rich_club(g, k = 5)
}
#> [1] 0.3090909
