betweenness

The Betweenness centrality score of a node u is the sum over all pairs s,t of the
proportion of shortest paths between s and t that pass through u. This 
function allows the use of either the SNAP betweenness implementation (default), or 
the igraph betweenness function. The SNAP version makes use of OpenMP for 
parallelization, and may be faster in some circumstances.

Provides functionality to compute various node centrality measures on networks.
Included are functions to compute betweenness centrality (by utilizing Madduri and Bader's
SNAP library), implementations of constraint and effective network size by Burt (2000) <doi:10.1016/S0191-3085(00)22009-1>; algorithm
to identify key players by Borgatti (2006) <doi:10.1007/s10588-006-7084-x>; and the
bridging algorithm by Valente and Fujimoto (2010) <doi:10.1016/j.socnet.2010.03.003>.
On Unix systems, the betweenness, Key Players, and
bridging implementations are parallelized with OpenMP, which may run
faster on systems which have OpenMP configured.

Aditya Khanna

influenceR

Software Tools to Quantify Structural Importance of Nodes in a
Network

betweenness function

<dl><dt>g</dt>
<dd>The igraph object to analyze</dd>
<dt>snap</dt>
<dd>True to use the SNAP betweenness code, False to use igraph::betweenness</dd></dl>

Arguments

Vertex Betweenness centrality measure. — betweenness

<dl>

<dt>g</dt>
<dd>The igraph object to analyze</dd>


<dt>snap</dt>
<dd>True to use the SNAP betweenness code, False to use igraph::betweenness</dd>

</dl>

betweenness: Vertex Betweenness centrality measure.

Description

Usage

Value

Arguments

References

Examples