communicability {brainGraph} | R Documentation |
Calculate communicability
Description
communicability
calculates the communicability of a network, a measure
which takes into account all possible paths (including non-shortest paths)
between vertex pairs.
Usage
communicability(g, weights = NULL)
Arguments
g |
An |
weights |
Numeric vector of edge weights; if |
Details
The communicability is a weighted sum of the number of walks
from vertex p to q and is calculated by taking the exponential
of the adjacency matrix A:
where is walk length.
For weighted graphs with a diagonal matrix of vertex
strength,
Value
A numeric matrix of the communicability
Author(s)
Christopher G. Watson, cgwatson@bu.edu
References
Estrada, E. and Hatano, N. (2008) Communicability in complex networks. Physical Review E. 77, 036111. doi: 10.1103/PhysRevE.77.036111
Crofts, J.J. and Higham, D.J. (2009) A weighted communicability measure applied to complex brain networks. J. R. Soc. Interface. 6, 411–414. doi: 10.1098/rsif.2008.0484