Posted by stefan on September 18, 2014
Code Snippets from Papers, Source Code

The code provided here [] modifies the algorithm provided by Evans et al. [1] to transform a graph into a line graph and detect communities. It allows to apply the aforementioned algorithm also to large graphs that don’t fit into memory.
I have implemented it for directed graphs so far, but it is straightforward to adjust the code for the undirected case. I might add that code later on. I tested the code against the original implementation on several datasets successfully, but the code might still include some bugs.
If you have questions or suggestions for improvement, feel free to contact me.

I used this algorithm in my paper “A Framework for Validating the Merit of Properties that Predict the Influence of a Twitter user” [see here for the paper]


[1] – Evans, T. S., & Lambiotte, R. (2009). Line graphs, link partitions, and overlapping communities. Physical Review E, 80(1), 016105.

Leave a Reply

Your email address will not be published. Required fields are marked *