Abstract
In this note, I derive simple formulas based on the adjacency matrix of a network to compute measures associated with Ronald S. Burt’s structural holes (effective size, redundancy, local constraint, and constraint), together with the measure called improved structural holes introduced in 2017. This can help to see these measures within a unified computation framework because they can all be expressed in matricial form. These formulas can also be used to define naïve algorithms based on matrix operations for their computation. Such naïve algorithms can be used for small- and medium-sized networks, where exploiting the sparsity of the matrices and efficient triangle listing techniques are not necessary.
Funder
Italian Ministry of Research
Subject
Physics and Astronomy (miscellaneous),General Mathematics,Chemistry (miscellaneous),Computer Science (miscellaneous)
Reference24 articles.
1. Burt, R.S. (2009). Structural Holes: The Social Structure of Competition, Harvard University Press.
2. Structural holes and good ideas;Burt;Am. J. Sociol.,2004
3. Research on structural holes: An assessment on measurement issues;Saglietto;J. Econ. Surv.,2020
4. Structural holes: Unpacking Burt’s redundancy measures;Borgatti;Connections,1997
5. Unpacking Burt’s constraint measure;Everett;Soc. Netw.,2020
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Interaction Effect of Knowledge Network and Collaboration Network on Breakthrough Innovation;2023 5th International Communication Engineering and Cloud Computing Conference (CECCC);2023-10-27