The DOI matches its Crossref record; 21 of the 21 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.
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
Emergence of Scaling in Random Networks
Barabási, A.-L., & Albert, R. (1999) · Science · doi:10.1126/science.286.5439.509 · Cited by 36,135
Self-citationSocial 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
Introduction to Percolation Theory
Stauffer, D., Aharony, A., & Redner, S. (1993) · Physics Today · doi:10.1063/1.2808877 · Cited by 6,666
Bollobás, B. (1985) · Cited by 6,196
(2017) · The SAGE Encyclopedia of Communication Research Methods · doi:10.4135/9781483381411.n575 · Cited by 6,008
Metabolic stability and epigenesis in randomly constructed genetic nets
Kauffman, S. A. (1969) · Journal of Theoretical Biology · doi:10.1016/0022-5193(69)90015-0 · Cited by 4,819
Diameter of the World-Wide Web
Albert, R., Jeong, H., & Barabási, A.-L. (1999) · Nature · doi:10.1038/43601 · Cited by 4,260
Self-citationMean-field theory for scale-free random networks
Barabási, A.-L., Albert, R., & Jeong, H. (1999) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/s0378-4371(99)00291-5 · Cited by 2,255
Self-citationAn Introduction To Percolation Theory
Hughes, B. D. (1996) · Random Walks and Random Environments · doi:10.1093/oso/9780198537892.003.0002 · Cited by 1,731
Emergent Properties of Networks of Biological Signaling Pathways
Bhalla, U. S., & Iyengar, R. (1999) · Science · doi:10.1126/science.283.5400.381 · Cited by 1,686
Scaling and criticality in a stochastic multi-agent model of a financial market
Lux, T., & Marchesi, M. (1999) · Nature · doi:10.1038/17290 · Cited by 1,526
Robustness in bacterial chemotaxis
Alon, U., Surette, M. G., Barkai, N., & Leibler, S. (1999) · Nature · doi:10.1038/16483 · Cited by 1,129
Phase Transitions in Two-Dimensional Kauffman Cellular Automata
Derrida, B., & Stauffer, D. (1986) · Europhysics Letters (EPL) · doi:10.1209/0295-5075/2/10/001 · Cited by 213
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
Random Boolean networks: Analogy with percolation
Stauffer, D. (1987) · Philosophical Magazine B · doi:10.1080/13642818708215325 · Cited by 71
On temporal characteristics of behavior in certain complex systems
Walker, C. C., & Ashby, W. R. (1966) · Kybernetik · doi:10.1007/bf00299903 · Cited by 61
Atlan, H., Soulié, F. F., Salomon, J. A., & Weisbuch, G. (1981) · Cybernetics & Systems · doi:10.1080/01969728108927667 · Cited by 50
Threshold phenomena in random structures
Cohen, J. E. (1988) · Discrete Applied Mathematics · doi:10.1016/0166-218x(88)90008-x · Cited by 31
Frustration and stability in random boolean networks
Fogelman‐Soulié, F. (1984) · Discrete Applied Mathematics · doi:10.1016/0166-218x(84)90015-5 · Cited by 23
Walker, C. C., & Gelfand, A. E. (1979) · Systems Research and Behavioral Science · doi:10.1002/bs.3830240205 · Cited by 16
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
- 21
- 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
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.