Natural Connectivity

Share:

Description

Compute the natural connectivity of a graph

Usage

1

Arguments

G

a p*p adjacency matrix (dense or sparse) of a graph. Ignored if eig is given

eig

precomputed list of eigen vals/vectors (output from eigen). If NULL, compute for G.

norm

should the natural connectivity score be normalized

Details

The natural connectivity of a graph is a useful robustness measure of complex networks, corresponding to the average eigenvalue of the adjacency matrix.

Value

numeric natural connectivity score

References

Jun, W., Barahona, M., Yue-Jin, T., & Hong-Zhong, D. (2010). Natural Connectivity of Complex Networks. Chinese Physics Letters, 27(7), 78902. doi:10.1088/0256-307X/27/7/078902