I was wondering if anyone has developed algorithms to measure the presence of structural holes in a social network (Burt 1992), like constraint, effective size and hierarchy ?
Thanks,
Tanguy
If you would like to refer to this comment somewhere else in this project, copy and paste the following link:
Your question is not clear...but unless that algorithm goes by another name, I don't believe that we have an implementation currently (and as we're trying to wrap things up for a release, this is not the best time to introduce a new piece of code). However, if the algorithm is straightforward it should not be difficult for you to put it together yourself using the JUNG APIs.
Joshua
If you would like to refer to this comment somewhere else in this project, copy and paste the following link:
Hi,
I was wondering if anyone has developed algorithms to measure the presence of structural holes in a social network (Burt 1992), like constraint, effective size and hierarchy ?
Thanks,
Tanguy
Tanguy:
Are you asking if anyone has implemented (a) particular algorithm(s) in JUNG, or whether anyone knows of an algorithm to solve this problem?
Joshua
Same quesiton.
Is there any particular algorithms for structural holes in Jung2?
Thanks in advance.
Yes. See algorithms.metrics.StructuralHoles. (in CVS, not sure if it's in jung2-alpha2.)
Joshua
Thanks.
Can I find any candidate for Bonachich Power (Bonachich, 1987)?
Your question is not clear...but unless that algorithm goes by another name, I don't believe that we have an implementation currently (and as we're trying to wrap things up for a release, this is not the best time to introduce a new piece of code). However, if the algorithm is straightforward it should not be difficult for you to put it together yourself using the JUNG APIs.
Joshua
Thanks for your answer!