search

noblenenye / Sub-graph-degree-Information-Centrality-and-Sub-graph-degree-and-Structural-Hole-centrality

This is a repository to hold new centrality metrics namely: Sub graph degree Information centrality and Sub graph degree and Structural hole centrality
GNU General Public License v3.0
0 stars 0 forks source link

Is the code useful to count the structural holes of every node in ego network? #1

Open yuliangru opened 2 years ago

yuliangru commented 2 years ago

Hi noblenenye,

I'm learning networkx, and find some algorithms it provide to caculate indexs of structural hole are at whole network. Is your code useful to count the structural holes of every node in ego network? And which index (effisize, efficiency or constraint) you use to count strutural hole?

noblenenye commented 2 years ago

Hello Yuliangru! The code does not compute structural holes explicitly. Rather, it computes the combination of a node's sub_graph degree and the number of structural holes that exist on that node.

Perhaps, you may want to have a look at the published paper to enhance your understanding of what the algorithm does and how it works. https://jit.ndhu.edu.tw/article/view/2572/2591