A note on (matricial and fast) ways to compute Burt's structural holes
arXiv.org(2021)
摘要
In this note, I derive simple formulas based on the adjacency matrix of a network to compute measures associated with Burt's structural holes (effective size, local constraint and constraint). This not only can help to interpret these measures, but also the computational advantage is enormous when analyzing real-world networks, often characterized by large and sparse adjacency matrices: instead of looping over nodes, one can rely on very efficient and fast matrix operations (e.g., multiplication).
更多查看译文
AI 理解论文
溯源树
样例
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要