The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Boolean Dynamics with Random Couplings
Abstract
This paper reviews a class of generic dissipative dynamical systems called N-K models. In these models, the dynamics of N elements, defined as Boolean variables, develop step by step, clocked by a discrete time variable. Each of the N Boolean elements at a given time is given a value which depends upon K elements in the previous time step. We review the work of many authors on the behavior of the models, looking particularly at the structure and lengths of their cycles, the sizes of their basins of attraction, and the flow of information through the systems. In the limit of infinite N, there is a phase transition between a chaotic and an ordered phase, with a critical phase in between. We argue that the behavior of this system depends significantly on the topology of the network connections. If the elements are placed upon a lattice with dimension d,the system shows correlations related to the standard percolation or directed percolation phase transition on such a lattice. On the other hand, a very different behavior is seen in the Kauffman net in which all spins are equally likely to be coupled to a given spin. In this situation, coupling loops are mostly suppressed, and the behavior of the system is much more like that of a mean field theory. We also describe possible applications of the models to, for example, genetic networks, cell differentiation, evolution, democracy in social systems and neural networks.
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
Neural networks and physical systems with emergent collective computational abilities.
Hopfield, J. J. (1982) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.79.8.2554 · Cited by 19,270
A logical calculus of the ideas immanent in nervous activity
McCulloch, W. S., & Pitts, W. (1943) · The Bulletin of Mathematical Biophysics · doi:10.1007/bf02478259 · Cited by 18,566
Spin Glass Theory and Beyond: An Introduction to the Replica Method and Its Applications
Mezard, M., Parisi, G., & Virasoro, M. (1986) · World Scientific Lecture Notes in Physics · doi:10.1142/0271 · Cited by 3,653
Computation at the edge of chaos: Phase transitions and emergent computation
Langton, C. G. (1990) · Physica D: Nonlinear Phenomena · doi:10.1016/0167-2789(90)90064-v · Cited by 1,527
Neural organization for the long-term memory of paired associates
Sakai, K., & Miyashita, Y. (1991) · Nature · doi:10.1038/354152a0 · Cited by 743
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
Introduction to Random Boolean Networks
Gershenson, C. (2004) · arXiv · doi:10.48550/arxiv.nlin/0408006 · Cited by 125
Guiding the self-organization of random Boolean networks
Gershenson, C. (2012) · Theory in Biosciences · doi:10.1007/s12064-011-0144-x · Cited by 68
Cell–cell interaction and diversity of emergent behaviours
Damiani, C., Serra, R., Villani, M., Kauffman, S. A., & Colacci, A. (2011) · IET Systems Biology · doi:10.1049/iet-syb.2010.0039 · Cited by 38
Information Measures of Complexity, Emergence, Self-organization, Homeostasis, and Autopoiesis
Fernandez, N., Maldonado, C., & Gershenson, C. (2013) · arXiv · doi:10.48550/arxiv.1304.1842 · Cited by 1
Metadata
- Authors
- Aldana, M., Coppersmith, S., & Kadanoff, L. P.
- Venue
- Perspectives and Problems in Nolinear Science
- Publisher
- Springer New York
- Published
- 2003
- Pages
- 23-89
- OpenAlex
- W2156335342
- Cited by
- 313
- References
- 6
- FWCI
- 31.62
- Type
- book chapter
- 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: Boolean Dynamics with Random Couplings. https://app.cochat.ai/papers/10.1007/978-0-387-21789-5_2
- The paper
- Aldana, M., Coppersmith, S., & Kadanoff, L. P. (2003). Boolean Dynamics with Random Couplings. Perspectives and Problems in Nolinear Science. https://doi.org/10.1007/978-0-387-21789-5_2
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.