14 comments

[ 5.2 ms ] story [ 51.8 ms ] thread
Neat! I'm attempting to generate a ranking for Seattle now. [Edit: Nevermind, this Java newbie got bored trying to figure out jars and classpaths.] I also didn't realize before that you could find users by their most-used language:

http://github.com/search?type=Users&language=python&...

...and GitHub's own results are ranked by total number of followers, which gives a simpler version of this article's "connectedness" measurement.

great, it's a popularity contest for programmers. Imagine if Ashton Kutcher started blogging via Github. I'd want to hire him immediately.
It's not a requirement to do it in Java. Just saying...
I meant that I was attempting to install and run the code from the article, which is written in JRuby+Java and depends on a couple of third-party Java libraries.
Ah, I totally missed that he published the code. Thanks!
This led me to the JUNG Java library, which looks pretty cool. Thinking it could be fun to play with this in Clojure.
Why betweenness centrality and not eigenvector centrality?
(comment deleted)
It's way easier to compute betweenness centrality? Eigenvector centrality requires inverting a potentially giant link matrix -- a notoriously expensive operation, which says nothing of the additional code complexity needed to do it properly.
betweenness centrality also has a nice interpretation that might make some sense for this application. or so.
You can get the first eigenvector through power iteration, just take some random vector then repeatedly normalize it and multiply by the adjacency matrix. So no giant matrix inversion needed.
If it becomes more common, we might see GitHub being gamed or spammed by people trying to create artificial networks.