The Eureka Repository is closing down and will not be available after the end of 2020. All publications from current Faculty have now been migrated to Symplectic Elements. See the Sainsbury Library Blog for more information. ×

Finding community structure in directed networks

Leicht, Elizabeth and Newman, Mark (2008) Finding community structure in directed networks. Physical Review Letters, 100 (11). p. 118703.


We consider the problem of finding communities or modules in directed networks. In the past, the most common approach to this problem has been to ignore edge direction and apply methods developed for community discovery in undirected networks, but this approach discards potentially useful information contained in the edge directions. Here we show how the widely used community finding technique of modularity maximization can be generalized in a principled fashion to incorporate information contained in edge directions. We describe an explicit algorithm based on spectral optimization of the modularity and show that it gives demonstrably better results than previous methods on a variety of test networks, both real and computer generated.

Item Type: Article
Keywords: Data Analysis; Statistics and Probability; Physics and Society
Subject(s): Complexity
Centre: CABDyN Complexity Centre
Date Deposited: 26 Jan 2012 20:48
Last Modified: 23 Oct 2015 14:07

Actions (login required)

Edit View Edit View