The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
A natural class of robust networks
Open accessAbstract
As biological studies shift from molecular description to system analysis we need to identify the design principles of large intracellular networks. In particular, without knowing the molecular details, we want to determine how cells reliably perform essential intracellular tasks. Recent analyses of signaling pathways and regulatory transcription networks have revealed a common network architecture, termed scale-free topology. Although the structural properties of such networks have been thoroughly studied, their dynamical properties remain largely unexplored. We present a prototype for the study of dynamical systems to predict the functional robustness of intracellular networks against variations of their internal parameters. We demonstrate that the dynamical robustness of these complex networks is a direct consequence of their scale-free topology. By contrast, networks with homogeneous random topologies require fine-tuning of their internal parameters to sustain stable dynamical activity. Considering the ubiquity of scale-free networks in nature, we hypothesize that this topology is not only the result of aggregation processes such as preferential attachment; it may also be the result of evolutionary selective processes.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Error and attack tolerance of complex networks
Albert, R., Jeong, H., & Barabási, A.-L. (2000) · Nature · doi:10.1038/35019019 · Cited by 7,534
Hierarchical Organization of Modularity in Metabolic Networks
Ravasz, E., Somera, A. L., Mongru, D. A., Oltvai, Z. N., & Barabási, A.-L. (2002) · Science · doi:10.1126/science.1073374 · Cited by 4,224
From molecular to modular cell biology.
Hartwell, L. H., Hopfield, J. J., Leibler, S., & Murray, A. W. (1999) · Nature · doi:10.1038/35011540 · Cited by 3,632
Phase transitions in random networks: Simple analytic determination of critical points
Luque, B., & Solé, R. V. (1997) · Physical Review E · doi:10.1103/physreve.55.257 · Cited by 111
Cited by
Cell Fates as High-Dimensional Attractor States of a Complex Gene Regulatory Network
Huang, S., Eichler, G., Bar-Yam, Y., & Ingber, D. E. (2005) · Physical Review Letters · doi:10.1103/physrevlett.94.128701 · Cited by 775
Kell, D. B. (2009) · BMC Medical Genomics · doi:10.1186/1755-8794-2-2 · Cited by 554
Espinosa-Soto, C., Padilla-Longoria, P., & Alvarez-Buylla, E. R. (2004) · The Plant Cell · doi:10.1105/tpc.104.021725 · Cited by 410
Robustness can evolve gradually in complex regulatory gene networks with varying topology
Ciliberti, S., Martin, O. C., & Wagner, A. (2007) · PLoS Computational Biology · doi:10.1371/journal.pcbi.0030015 · Cited by 390
Boolean network models of cellular regulation: prospects and limitations
Bornholdt, S. (2008) · Journal of The Royal Society Interface · doi:10.1098/rsif.2008.0132.focus · Cited by 394
Metadata
- Authors
- Aldana, M., & Cluzel, P.
- Venue
- Proceedings of the National Academy of Sciences
- Published
- 2003-07-09
- Volume
- 100
- Issue
- 15
- Pages
- 8710-8714
- ISSN
- 0027-8424 (ISSN-L)
- 1091-6490
- OpenAlex
- W2165641442
- Cited by
- 251
- References
- 4
- FWCI
- 10.20
- Type
- journal article
- Language
- en
- Open access
- green
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: A natural class of robust networks. https://app.cochat.ai/papers/10.1073/pnas.1536783100
- The paper
- Aldana, M., & Cluzel, P. (2003). A natural class of robust networks. Proceedings of the National Academy of Sciences. https://doi.org/10.1073/pnas.1536783100
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.