Unpacking Burt’s Constraint MeasureCitation formats

Standard

Unpacking Burt’s Constraint Measure. / Everett, Martin; Borgatti, Stephen.

In: Social Networks, Vol. 62, 07.2020, p. 50-57.

Research output: Contribution to journal › Article › peer-review

Harvard

Everett, M & Borgatti, S 2020, 'Unpacking Burt’s Constraint Measure', Social Networks, vol. 62, pp. 50-57. https://doi.org/10.1016/j.socnet.2020.02.001

APA

Everett, M., & Borgatti, S. (2020). Unpacking Burt’s Constraint Measure. Social Networks, 62, 50-57. https://doi.org/10.1016/j.socnet.2020.02.001

Vancouver

Everett M, Borgatti S. Unpacking Burt’s Constraint Measure. Social Networks. 2020 Jul;62:50-57. https://doi.org/10.1016/j.socnet.2020.02.001

Author

Everett, Martin ; Borgatti, Stephen. / Unpacking Burt’s Constraint Measure. In: Social Networks. 2020 ; Vol. 62. pp. 50-57.

Bibtex

@article{644afa9f77f34ecaa3835065b3c0977a,
title = "Unpacking Burt{\textquoteright}s Constraint Measure",
abstract = "Burt (1992) proposed two principal measures of structural holes, effective size and constraint. However, the formulas describing the measures are somewhat opaque and have led to a certain amount of confusion. Borgatti (1997) showed that, for binary data, the effective size formula could be written very simply as degree (ego network size) minus average degree of alters within the ego network. The present paper presents an analogous reformulation of the constraint measure. We also derive minima and maxima for constraint, showing that, for small ego networks, constraint can be larger than one, and for larger ego networks, constraint cannot get as large as one. We also show that for networks with more than seven alters, the maximum constraint does not occur in a maximally dense or closed network, but rather in a relatively sparse “shadow ego network”, which is a network that contains an alter (the shadow ego) that is connected to every other alter, and where no other alter-alter ties exist.",
keywords = "Constraint, Egonetworks, Structural holes",
author = "Martin Everett and Stephen Borgatti",
year = "2020",
month = jul,
doi = "10.1016/j.socnet.2020.02.001",
language = "English",
volume = "62",
pages = "50--57",
journal = "Social Networks",
issn = "0378-8733",
publisher = "Elsevier BV",

}

RIS

TY - JOUR

T1 - Unpacking Burt’s Constraint Measure

AU - Everett, Martin

AU - Borgatti, Stephen

PY - 2020/7

Y1 - 2020/7

N2 - Burt (1992) proposed two principal measures of structural holes, effective size and constraint. However, the formulas describing the measures are somewhat opaque and have led to a certain amount of confusion. Borgatti (1997) showed that, for binary data, the effective size formula could be written very simply as degree (ego network size) minus average degree of alters within the ego network. The present paper presents an analogous reformulation of the constraint measure. We also derive minima and maxima for constraint, showing that, for small ego networks, constraint can be larger than one, and for larger ego networks, constraint cannot get as large as one. We also show that for networks with more than seven alters, the maximum constraint does not occur in a maximally dense or closed network, but rather in a relatively sparse “shadow ego network”, which is a network that contains an alter (the shadow ego) that is connected to every other alter, and where no other alter-alter ties exist.

AB - Burt (1992) proposed two principal measures of structural holes, effective size and constraint. However, the formulas describing the measures are somewhat opaque and have led to a certain amount of confusion. Borgatti (1997) showed that, for binary data, the effective size formula could be written very simply as degree (ego network size) minus average degree of alters within the ego network. The present paper presents an analogous reformulation of the constraint measure. We also derive minima and maxima for constraint, showing that, for small ego networks, constraint can be larger than one, and for larger ego networks, constraint cannot get as large as one. We also show that for networks with more than seven alters, the maximum constraint does not occur in a maximally dense or closed network, but rather in a relatively sparse “shadow ego network”, which is a network that contains an alter (the shadow ego) that is connected to every other alter, and where no other alter-alter ties exist.

KW - Constraint

KW - Egonetworks

KW - Structural holes

U2 - 10.1016/j.socnet.2020.02.001

DO - 10.1016/j.socnet.2020.02.001

M3 - Article

AN - SCOPUS:85079889145

VL - 62

SP - 50

EP - 57

JO - Social Networks

JF - Social Networks

SN - 0378-8733

ER -