dorsal/arxiv
View SchemaCoarse-Graining and Self-Dissimilarity of Complex Networks
| Authors | Shalev Itzkovitz, Reuven Levitt, Nadav Kashtan, Ron Milo, Michael Itzkovitz, Uri Alon |
|---|---|
| Categories | |
| ArXiv ID | q-bio/0405011 |
| URL | https://arxiv.org/abs/q-bio/0405011 |
| DOI | 10.1103/PhysRevE.71.016127 |
| Journal | Phys. Rev. E 71, 016127 (2005) |
Abstract
Can complex engineered and biological networks be coarse-grained into smaller and more understandable versions in which each node represents an entire pattern in the original network? To address this, we define coarse-graining units (CGU) as connectivity patterns which can serve as the nodes of a coarse-grained network, and present algorithms to detect them. We use this approach to systematically reverse-engineer electronic circuits, forming understandable high-level maps from incomprehensible transistor wiring: first, a coarse-grained version in which each node is a gate made of several transistors is established. Then, the coarse-grained network is itself coarse-grained, resulting in a high-level blueprint in which each node is a circuit-module made of multiple gates. We apply our approach also to a mammalian protein-signaling network, to find a simplified coarse-grained network with three main signaling channels that correspond to cross-interacting MAP-kinase cascades. We find that both biological and electronic networks are 'self-dissimilar', with different network motifs found at each level. The present approach can be used to simplify a wide variety of directed and nondirected, natural and designed networks.
{
"annotation_id": "ce05910a-18a7-4e6c-a97e-a0b4d536d502",
"date_created": "2026-03-02T18:01:31.021000Z",
"date_modified": "2026-03-02T18:01:31.021000Z",
"file_hash": "56c54a48deac461c1954365ce4e8d73c1b8ca10a8a23cdefdb09e2481849387f",
"private": false,
"record": {
"abstract": "Can complex engineered and biological networks be coarse-grained into smaller\nand more understandable versions in which each node represents an entire\npattern in the original network? To address this, we define coarse-graining\nunits (CGU) as connectivity patterns which can serve as the nodes of a\ncoarse-grained network, and present algorithms to detect them. We use this\napproach to systematically reverse-engineer electronic circuits, forming\nunderstandable high-level maps from incomprehensible transistor wiring: first,\na coarse-grained version in which each node is a gate made of several\ntransistors is established. Then, the coarse-grained network is itself\ncoarse-grained, resulting in a high-level blueprint in which each node is a\ncircuit-module made of multiple gates. We apply our approach also to a\nmammalian protein-signaling network, to find a simplified coarse-grained\nnetwork with three main signaling channels that correspond to cross-interacting\nMAP-kinase cascades. We find that both biological and electronic networks are\n\u0027self-dissimilar\u0027, with different network motifs found at each level. The\npresent approach can be used to simplify a wide variety of directed and\nnondirected, natural and designed networks.",
"arxiv_id": "q-bio/0405011",
"authors": [
"Shalev Itzkovitz",
"Reuven Levitt",
"Nadav Kashtan",
"Ron Milo",
"Michael Itzkovitz",
"Uri Alon"
],
"categories": [
"q-bio.MN",
"cond-mat.stat-mech"
],
"doi": "10.1103/PhysRevE.71.016127",
"journal_ref": "Phys. Rev. E 71, 016127 (2005)",
"title": "Coarse-Graining and Self-Dissimilarity of Complex Networks",
"url": "https://arxiv.org/abs/q-bio/0405011"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "c1f4a692-20c8-4ba6-8e38-6d89813f4bbe",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}