***** To join INSNA, visit http://www.insna.org *****
Steve,
 
Steve Borgotti published an excellent paper on fragmentation and the key player problem.  I have horrible internet, so I won't find the paper.  His measure of fragmentation might be a good measure of group cohesiveness.  There is a ppt from Steve with the formula for fragmentation towards the end.  I am sure Steve can give you a lot better ideas.  I think the fragmentation is included in ORA and probably UCINet as well, but I haven't used it personnally.
 
http://www.analytictech.com/essex/Lectures/centrality.pdf
 
Best of luck.
 
Ian McCulloh, Ph.D.
Major, US Army

On Fri, Jan 1, 2010 at 4:18 AM, Steve Eichert <[log in to unmask]> wrote:
***** To join INSNA, visit http://www.insna.org ***** Hello,

I've been using the Newman Girvan algorithm [1] to identify communities within networks of individuals, however, I've been told by someone who I respect greatly that Newman Girvan isn't the best algorithm to use for identifying communities when dealing with human networks.  So, the question I have for the group is: what algorithm would you recommend for identifying communities when working with networks of people.  

[1] http://en.wikipedia.org/wiki/Girvan–Newman_algorithm

All the best,
Steve
_____________________________________________________________________ SOCNET is a service of INSNA, the professional association for social network researchers (http://www.insna.org). To unsubscribe, send an email message to [log in to unmask] containing the line UNSUBSCRIBE SOCNET in the body of the message.

_____________________________________________________________________ SOCNET is a service of INSNA, the professional association for social network researchers (http://www.insna.org). To unsubscribe, send an email message to [log in to unmask] containing the line UNSUBSCRIBE SOCNET in the body of the message.