Login The Centiserver on OMICTools |
Burt's ConstraintDefinition
Essentially a measure of the extent to which v is invested in people who are invested in other of v's alters (neighbors). The "constraint" is characterized by a lack of primary holes around each neighbor. Formally:
![]() Burt's constraint is higher if ego has less, or mutually stronger related (i.e. more redundant) contacts. Burt's measure of constraint, Ci, of vertex i's ego network Vi, is defined for directed and valued graphs, ![]() ![]() Requirements
Require directed and weigthed network.
SoftwareReferences
|