The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Dynamics of Complex Systems: Scaling Laws for the Period of Boolean Networks
Abstract
Boolean networks serve as models for complex systems, such as social or genetic networks, where each vertex, based on inputs received from selected vertices, makes its own decision about its state. Despite their simplicity, little is known about the dynamical properties of these systems. Here we propose a method to calculate the period of a finite Boolean system, by identifying the mechanisms determining its value. The proposed method can be applied to systems of arbitrary topology, and can serve as a roadmap for understanding the dynamics of large interacting systems in general.
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
Social Network Analysis: Methods and Applications
Wasserman, S., & Faust, K. (1994) · doi:10.1017/cbo9780511815478 · Cited by 17,557
The Origins of Order: Self-Organization and Selection in Evolution
Kauffman, S. A. (1993) · doi:10.1093/oso/9780195079517.001.0001 · Cited by 7,855
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
The Structure and Function of Complex Networks
Newman, M. E. J. (2003) · SIAM Review · doi:10.1137/s003614450342480 · Cited by 18,719
Controllability and observability of Boolean control networks
Cheng, D., & Qi, H. (2009) · Automatica · doi:10.1016/j.automatica.2009.03.006 · Cited by 770
A Linear Representation of Dynamics of Boolean Networks
Cheng, D., & Qi, H. (2010) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2010.2043294 · Cited by 697
Control of Boolean networks: Hardness results and algorithms for tree structured networks
Akutsu, T., Hayashida, M., Ching, W.-K., & Ng, M. K. (2007) · Journal of Theoretical Biology · doi:10.1016/j.jtbi.2006.09.023 · Cited by 572
Boolean Dynamics with Random Couplings
Aldana, M., Coppersmith, S., & Kadanoff, L. P. (2003) · Perspectives and Problems in Nolinear Science · doi:10.1007/978-0-387-21789-5_2 · Cited by 313
Metadata
- Authors
- Albert, R., & Barabási, A.-L.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2000-06-12
- Volume
- 84
- Issue
- 24
- Pages
- 5660-5663
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W2014737124
- Cited by
- 252
- References
- 3
- FWCI
- 3.22
- 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: Dynamics of Complex Systems: Scaling Laws for the Period of Boolean Networks. https://app.cochat.ai/papers/10.1103/physrevlett.84.5660
- The paper
- Albert, R., & Barabási, A.-L. (2000). Dynamics of Complex Systems: Scaling Laws for the Period of Boolean Networks. Physical Review Letters. https://doi.org/10.1103/physrevlett.84.5660
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.
