I'm not sure this would give the same kind of results, it was shown [1] that Kleinberg's HITS algorithm is PCA, and HITS gives [2] hubs (nodes linked to many ot

I'm not sure this would give the same kind of results, it was shown [1] that Kleinberg's HITS algorithm is PCA, and HITS gives [2] hubs (nodes linked to many others) and authorities (nodes linked from many hubs). I have the intuition that this would qualify the floor leaders as authorities, but I'd have to run the numbers. Anyway, in order to obtain groups from PCA (that is, groups which are not only "visual"), one would have to run some kind of clustering algorithm on the reduced data. [1] http://www.uclouvain.be/cps/ucl/doc/iag/documents/WP125_Saerens.pdf http://www.uclouvain.be/cps/ucl/doc/iag/documents/WP125_Saer... [2] http://en.wikipedia.org/wiki/HITS_algorithm http://en.wikipedia.org/wiki/HITS_algorithm