Gergely Palla et al 2007 New J. Phys. 9 186 doi:10.1088/1367-2630/9/6/186
Gergely Palla1, Illés J Farkas1,2, Péter Pollner1, Imre Derényi2 and Tamás Vicsek1,2
Show affiliationsPart of Focus on Complex Networked Systems: Theory and Application
A search technique locating network modules, i.e. internally densely connected groups of nodes in directed networks is introduced by extending the clique percolation method originally proposed for undirected networks. After giving a suitable definition for directed modules we investigate their percolation transition in the Erdős–Rényi graph both analytically and numerically. We also analyse four real-world directed networks, including Google's own web-pages, an email network, a word association graph and the transcriptional regulatory network of the yeast Saccharomyces cerevisiae. The obtained directed modules are validated by additional information available for the nodes. We find that directed modules of real-world graphs inherently overlap and the investigated networks can be classified into two major groups in terms of the overlaps between the modules. Accordingly, in the word-association network and Google's web-pages, overlaps are likely to contain in-hubs, whereas the modules in the email and transcriptional regulatory network tend to overlap via out-hubs.
05.50.+q Lattice theory and statistics (Ising, Potts, etc.)
89.20.Hh World Wide Web, Internet
89.75.Hc Networks and genealogical trees
Issue 6 (June 2007)
Received 15 February 2007
Published 28 June 2007
Gergely Palla et al 2007 New J. Phys. 9 186
Chris Greenhalgh 1998 Distrib. Syst. Engng. 5 129
Anatoliy Pinchuk and Uwe Kreibig 2003 New J. Phys. 5 151
Rodger Lea 1998 Distrib. Syst. Engng. 5 89
M Yalcintas et al 1995 Smart Mater. Struct. 4 207
Koji Fukao 1996 J. Phys.: Condens. Matter 8 2105
T. M. Webb et al. 2003 ApJ 582 6
G van der Laan 1991 J. Phys.: Condens. Matter 3 1015
M Holland et al 1996 Quantum Semiclass. Opt. 8 571
Josef Schriefl et al 2006 New J. Phys. 8 1