Burt's Effective Network Size and Constraint index.
The next two functions below provide ways to measure the actors' access to structural holes in a network. Structural holes 
"provide opportunities to broker connections between people" (Burt 2008).

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

ens function

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

Arguments

Burt's Effective Network Size and Constraint index.
The next two functions below provide ways to measure the actors' access to structural holes in a network. Structural holes 
"provide opportunities to broker connections between people" (Burt 2008). — ens

<dl>

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

</dl>

Burt's Effective Network Size and Constraint index.
The next two functions below provide ways to measure the actors' access to structural holes in a network. Structural holes 
"provide opportunities to broker connections between people" (Burt 2008).

ens: Burt's Effective Network Size and Constraint index. The next two functions below provide ways to measure the actors' access to structural holes in a network. Structural holes "provide opportunities to broker connections between people" (Burt 2008).

Description

Usage

Value

Arguments

References

Examples