| centrality_constraint | R Documentation |
Burt's constraint measures how much a node's ties are concentrated in
contacts that are themselves tied to each other. With p_{ij}
the proportion of the tie strength of i invested in j,
C_i = \sum_{j \ne i} \Big( p_{ij} + \sum_{q \ne i, j} p_{iq}
p_{qj} \Big)^2.
Low constraint marks access to structural holes.
centrality_constraint(x, ...)
x |
Network input accepted by |
... |
Further arguments to |
Ties are symmetrized as w_{ij} + w_{ji} before the
proportions are formed, so edge direction is ignored. With
weighted = FALSE every tie has weight one. The values match
igraph::constraint(). An isolated node returns NaN, and a
node whose only tie is a self-loop scores 0.
A named numeric vector with one score per node, in input node order.
centrality_effective_size,
centrality_bridging, centrality.
centrality_constraint(regulation_net)
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.