Directed network modules

Gergely Palla, I. Farkas, Péter Pollner, I. Derényi, T. Vicsek

Research output: Contribution to journalArticle

88 Citations (Scopus)

Abstract

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 Erdos-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.

Original languageEnglish
Article number186
JournalNew Journal of Physics
Volume9
DOIs
Publication statusPublished - Jun 28 2007

Fingerprint

modules
hubs
saccharomyces
yeast

ASJC Scopus subject areas

  • Physics and Astronomy(all)

Cite this

Directed network modules. / Palla, Gergely; Farkas, I.; Pollner, Péter; Derényi, I.; Vicsek, T.

In: New Journal of Physics, Vol. 9, 186, 28.06.2007.

Research output: Contribution to journalArticle

@article{ea231a148c774dcd9691d309517ce6f8,
title = "Directed network modules",
abstract = "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 Erdos-R{\'e}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.",
author = "Gergely Palla and I. Farkas and P{\'e}ter Pollner and I. Der{\'e}nyi and T. Vicsek",
year = "2007",
month = "6",
day = "28",
doi = "10.1088/1367-2630/9/6/186",
language = "English",
volume = "9",
journal = "New Journal of Physics",
issn = "1367-2630",
publisher = "IOP Publishing Ltd.",

}

TY - JOUR

T1 - Directed network modules

AU - Palla, Gergely

AU - Farkas, I.

AU - Pollner, Péter

AU - Derényi, I.

AU - Vicsek, T.

PY - 2007/6/28

Y1 - 2007/6/28

N2 - 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 Erdos-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.

AB - 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 Erdos-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.

UR - http://www.scopus.com/inward/record.url?scp=34547375803&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=34547375803&partnerID=8YFLogxK

U2 - 10.1088/1367-2630/9/6/186

DO - 10.1088/1367-2630/9/6/186

M3 - Article

AN - SCOPUS:34547375803

VL - 9

JO - New Journal of Physics

JF - New Journal of Physics

SN - 1367-2630

M1 - 186

ER -