Network motifs in computational graphs: A case study in software architecture
The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Abstract
Complex networks in both nature and technology have been shown to display characteristic, small subgraphs (so-called motifs) which appear to be related to their underlying functionality. All these networks share a common trait: they manipulate information at different scales in order to perform some kind of computation. Here we analyze a large set of software class diagrams and show that several highly frequent network motifs appear to be a consequence of network heterogeneity and size, thus suggesting a somewhat less relevant role of functionality. However, by using a simple model of network growth by duplication and rewiring, it is shown the rules of graph evolution seem to be largely responsible for the observed motif distribution.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Network motifs: simple building blocks of complex networks.
Milo, R., Shen-Orr, S., Itzkovitz, S., Kashtan, N., Chklovskii, D., & Alon, U. (2002) · Science · doi:10.1126/science.298.5594.824 · Cited by 7,368
Dorogovtsev, S. N., & Mendes, J. F. F. (2003) · doi:10.1093/acprof:oso/9780198515906.001.0001 · Cited by 1,563
Modularity from fluctuations in random graphs and complex networks
Guimerà, R., Sales-Pardo, M., & Amaral, L. A. N. (2004) · Physical Review E · doi:10.1103/physreve.70.025101 · Cited by 894
Evolutionary Rate in the Protein Interaction Network
Fraser, H. B., Hirsh, A. E., Steinmetz, L. M., Scharfe, C., & Feldman, M. W. (2002) · Science · doi:10.1126/science.1068696 · Cited by 869
Biological networks: the tinkerer as an engineer
Alon, U. (2003) · Science · doi:10.1126/science.1089072 · Cited by 706
Topology of technology graphs: Small world patterns in electronic circuits
Cancho, R. F. I., Janssen, C., & Solé, R. V. (2001) · Physical Review E · doi:10.1103/physreve.64.046119 · Cited by 265
Self-citation
Cited by
The science of science: From the perspective of complex systems
Zeng, A., Shen, Z., Zhou, J., Wu, J., Fan, Y., Wang, Y., & Stanley, H. E. (2017) · Physics Reports · doi:10.1016/j.physrep.2017.10.001 · Cited by 410
The 2017 IEEE International Conference on Fuzzy Systems
(2016) · IEEE Computational Intelligence Magazine · doi:10.1109/mci.2016.2545826 · Cited by 308
The evolutionary ecology of technological innovations
Solée, R. V., Valverde, S., Casals, M. R., Kauffman, S. A., Farmer, D., & Eldredge, N. (2013) · Complexity · doi:10.1002/cplx.21436 · Cited by 140
Self-citationSpontaneous emergence of modularity in cellular networks
Solé, R. V., & Valverde, S. (2008) · Journal of The Royal Society Interface · doi:10.1098/rsif.2007.1108 · Cited by 102
Self-citationEvolving complexity: how tinkering shapes cells, software and ecological networks.
Solé, R., & Valverde, S. (2020) · Philosophical Transactions of the Royal Society B: Biological Sciences · doi:10.1098/rstb.2019.0325 · Cited by 37
Self-citation
Metadata
- Authors
- Valverde, S., & Solé, R. V.
- Venue
- Physical Review E
- Publisher
- American Physical Society (APS)
- Published
- 2005-08-08
- Volume
- 72
- Issue
- 2
- Pages
- 026107-026107
- ISSN
- 1539-3755 (ISSN-L)
- 1550-2376
- OpenAlex
- W1966922820
- Cited by
- 130
- References
- 6
- FWCI
- 3.83
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Network motifs in computational graphs: A case study in software architecture. https://app.cochat.ai/papers/10.1103/physreve.72.026107
- The paper
- Valverde, S., & Solé, R. V. (2005). Network motifs in computational graphs: A case study in software architecture. Physical Review E. https://doi.org/10.1103/physreve.72.026107
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.