centr_betw_comm: Calculate communicability betweenness centrality

In brainGraph: Graph Theory Analysis of Brain MRI Data

Calculate communicability betweenness centrality

Description

centr_betw_comm calculates the communicability betweenness of the vertices of a graph. The centrality for vertex r is

\omega_r = \frac{1}{C} \sum_p \sum_q \frac{(e^{\mathbf{A}})_{pq} - (e^{\mathbf{A} + \mathbf{E}(r)})_{pq}}{(e^{\mathbf{A}})_{pq}}

where C = (n - 1)^2 - (n - 1) is a normalization factor.

Usage

centr_betw_comm(g, A = NULL)

Arguments

g	An igraph graph object
A	Numeric matrix; the adjacency matrix of the input graph. Default: NULL

Value

A numeric vector of the centrality for each vertex

Author(s)

Christopher G. Watson, [e-mail]

References

Estrada, E. and Higham, D.J. and Hatano N. (2009) Communicability betweenness in complex networks. Physica A, 388, 764–774. \Sexpr[results=rd]{tools:::Rd_expr_doi("10.1016/j.physa.2008.11.011")}

See Also

Other Centrality functions: centr_lev

brainGraph documentation built on June 22, 2024, 7:36 p.m.