dorsal/arxiv
View SchemaDirected network modules
| Authors | Gergely Palla, Illes J. Farkas, Peter Pollner, Imre Derenyi, Tamas Vicsek |
|---|---|
| Categories | |
| ArXiv ID | physics/0703248 |
| URL | https://arxiv.org/abs/physics/0703248 |
| DOI | 10.1088/1367-2630/9/6/186 |
| Journal | New J. Phys. 9, 186 (2007) |
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-Renyi graph both analytically and numerically. We also analyse four real-world directed networks, including Google's own webpages, 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 among Google's webpages the overlaps are likely to contain in-hubs, whereas the modules in the email and transcriptional regulatory networks tend to overlap via out-hubs.
{
"annotation_id": "366bde2d-1731-49dc-9e74-3859fca60a8b",
"date_created": "2026-03-02T18:01:18.449000Z",
"date_modified": "2026-03-02T18:01:18.449000Z",
"file_hash": "25113772ef66174994ae127c119f2e1c6d78b15bd4f861f2419395a6a1a70a39",
"private": false,
"record": {
"abstract": "A search technique locating network modules, i.e., internally densely\nconnected groups of nodes in directed networks is introduced by extending the\nClique Percolation Method originally proposed for undirected networks. After\ngiving a suitable definition for directed modules we investigate their\npercolation transition in the Erdos-Renyi graph both analytically and\nnumerically. We also analyse four real-world directed networks, including\nGoogle\u0027s own webpages, an email network, a word association graph and the\ntranscriptional regulatory network of the yeast Saccharomyces cerevisiae. The\nobtained directed modules are validated by additional information available for\nthe nodes. We find that directed modules of real-world graphs inherently\noverlap and the investigated networks can be classified into two major groups\nin terms of the overlaps between the modules. Accordingly, in the\nword-association network and among Google\u0027s webpages the overlaps are likely to\ncontain in-hubs, whereas the modules in the email and transcriptional\nregulatory networks tend to overlap via out-hubs.",
"arxiv_id": "physics/0703248",
"authors": [
"Gergely Palla",
"Illes J. Farkas",
"Peter Pollner",
"Imre Derenyi",
"Tamas Vicsek"
],
"categories": [
"physics.soc-ph",
"cond-mat.stat-mech",
"physics.bio-ph",
"physics.comp-ph"
],
"doi": "10.1088/1367-2630/9/6/186",
"journal_ref": "New J. Phys. 9, 186 (2007)",
"title": "Directed network modules",
"url": "https://arxiv.org/abs/physics/0703248"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "7beb68a9-985c-414b-b88e-5ef11a233585",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}