centrality_constraint: Burt's Constraint

View source: R/centrality.R

centrality_constraintR Documentation

Burt's Constraint

Description

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.

Usage

centrality_constraint(x, ...)

Arguments

x

Network input accepted by centrality.

...

Further arguments to centrality, such as normalized.

Details

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.

Value

A named numeric vector with one score per node, in input node order.

See Also

centrality_effective_size, centrality_bridging, centrality.

Examples

centrality_constraint(regulation_net)

cograph documentation built on Nov. 19, 2026, 5:07 p.m.