degree_mult: Calculate degree centrality for multiple graphs.

In abnormally-distributed/rsfcNet: Analyze resting state functional connectivity networks

Description

This function calculates the number of non-zero connections each node in a network has for a list of graphs.

Usage

degree_mult(graphs, col.names = NULL, row.names = NULL)

Arguments

graphs	a list of igraph objects.
col.names	The names of each column (node labels).
row.names	The names of each row (subject).

Details

Degree centrality is simply the sum of present connections of node i to each other jth node:

D_i= ∑_{j \neq i}^N e_{ij}

For the weighted version of degree, see the functions for calculating strength.

Value

A matrix of the degree centralities of each node for each subject.

Author(s)

Brandon Vaughan

References

Fornito, A., Zalesky, A., & Bullmore, E. (2016). Node Degree and Strength. Chapter 4. Fundamentals of Brain Network Analysis, 115-136. doi:10.1016/B978-0-12-407908-3.00004-2

See Also

degree_centr strength_multiple

Examples

# degree = degree_mult(graphs,row.names = subj_numbers,col.names = node_labels)

abnormally-distributed/rsfcNet documentation built on March 8, 2020, 5:32 p.m.