Calculate the rich core of a graph

Share:

Description

This function finds the boundary of the rich core of a graph, based on the decreasing order of vertex degree. It also calculates the degree that corresponds to that rank, and the core size relative to the total number of vertices in the graph.

Usage

1

Arguments

g

An igraph graph object

Value

A data frame with the following components:

density

The density of the graph.

rank

The rank of the boundary for the rich core.

k.r

The degree of the vertex at the boundary.

core.size

The size of the core relative to the graph size.

Author(s)

Christopher G. Watson, cgwatson@bu.edu

References

Ma A \& Mondragon R.J. (2015) Rich-cores in networks. PLoS One, 10(3): e0119678. doi:10.1371/journal.pone.0119678

See Also

rich.club.coeff, rich.club.norm

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