degree_centr: Calculate degree centrality for a single graph.

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 single graph.

Usage

degree_centr(graph)

Arguments

graph

A network as an igraph object or connectivity matrix.

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 vector of centrality scores for each node.

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_mult strength_signed strength

Examples

# degree = degree_centr(graph)

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