***** To join INSNA, visit http://www.insna.org *****
I believe that the algorithm in Netdraw is not a modularity maximization
algorithm at all -- so it's not any of the algorithms in the papers you
mention. Rather, it is the betweenness-based clustering algorithm proposed
in M. Girvan and M. Newman, Proceedings of the National Academy of Sciences
99, 7821–7826 (2002). It does however compute modularity values for the
partitions resulting from the clustering, as a measure of partition quality.
On 04/09/2010 10:15 PM, Shermin de Silva wrote:
> ***** To join INSNA, visit http://www.insna.org ***** Dear subscribers,
> Does anyone know exactly which formulation of Q (modularity quotient) is
> implemented by the Subgroups>Girvan-Newman procedure in the Netdraw
> software (UCINET - Borgatti et al. 2002)? I've found several articles -
> Newman 2004, 2006, Clauset et al. 2006 and am not sure which to cite. I
> tried asking the developers (who may also be on this list?) a while ago,
> but got no clarification.
> Appreciate any help!
> Department of Biology
> Leidy Laboratories
> University of Pennsylvania
> Philadelphia PA 19104
> Tel: +001.215.898.0332
> email: [log in to unmask] <mailto:[log in to unmask]>
> 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.