Calculate the rich club of a graph

Share:

Description

This function calculates the rich club of a graph, both the coefficient φ and the nodes that make up this subgraph.

Usage

1
rich.club.coeff(g, k = 1, weighted = FALSE)

Arguments

g

The graph of interest

k

The minimum degree for including a vertex (default: 1)

weighted

A logical indicating whether or not edge weights should be used (default: FALSE)

Value

A list with the following components:

phi

The rich club coefficient, φ.

graph

A subgraph containing only the rich club nodes.

Nk

The number of vertices in the rich club graph.

Ek

The number of edges in the rich club graph.

Author(s)

Christopher G. Watson, cgwatson@bu.edu

References

Zhou S., Mondragon R.J. (2004) The rich-club phenomenon in the internet topology. IEEE Comm Lett, 8:180-182.

Opsahl T., Colizza V., Panzarasa P., Ramasco J.J. (2008) Prominence and control: the weighted rich-club effect. Physical Review Letters, 101.16:168702.

See Also

rich.club.norm

Want to suggest features or report bugs for rdrr.io? Use the GitHub issue tracker.