brainGraph (version 0.72.0)

rich.club.attrs: Assign graph attributes based on rich-club analysis

Description

This function will assign vertex- and edge-level attributes based on the results of a rich-club analysis, based on a range of vertex degrees in which the rich-club coefficient was determined to be significantly greater than that of a set of random graphs (see rich.club.norm).

Usage

rich.club.attrs(g, deg.range = NULL, adj.vsize = FALSE)

Arguments

g

An igraph graph object

deg.range

An integer vector of the range of degrees indicating inclusion in the rich-club; if the default NULL, it will be from 1 to the maximum degree in the graph

adj.vsize

A logical indicating whether to adjust vertex size proportional to degree (default: FALSE)

Value

An igraph graph object with additional attributes:

Details

Vertices which are in the rich club will be assigned an attribute rich, taking on a binary value. Their colors (attribute color.rich) will be either red or gray. Their sizes (attribute size.rich) will either be 10 or will be proportional to their degree.

Edge attribute type.rich takes on three values: rich-club (if it connects two rich-club vertices), feeder (if it connects a rich- to a non-rich-club vertex), and local (if it connects two non-rich-club vertices). They will also be given a color.rich attribute (either red, orange, or green). Edge sizes (size.rich) will be largest for rich-club connections, then smaller for feeder, and smallest for local.

See Also

rich.club.norm, rich.club.coeff

Examples

## Not run: 
# g <- rich.club.attrs(g, rich.dt[density == densities[N] & p.fdr < .01,
#                                 range(k)])
# ## End(Not run)