Finding the KTH collaboration network : A comparative analysis of Girvan-Newman andRosvall-Bergstrom's community detectionalgorithms on KTH's scientist collaborationnetwork

University essay from KTH/Skolan för datavetenskap och kommunikation (CSC)

Abstract: Using DiVAs data on published works and their authors, a database was constructed on which Girvan-Newmans (2002) and Rosvall-Bergstroms (2007) community finding algorithms were applied. The results were compared in an effort to evaluate the current allocation of researchers at KTH's divisions and the performance of said algorithms on the collaboration network. Rosvall-Bergstrom performed better than Girvan-Newman both in result and performance. The results of both algorithms are similar, and illustrate that the current allocation of researchers forces work across school borders.

  AT THIS PAGE YOU CAN DOWNLOAD THE WHOLE ESSAY. (follow the link to the next page)