The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Evolution of overlaps between configurations in random Boolean networks
Open accessAbstract
Random Boolean nets are systems of randomly connected binary units (or spins). Each spin σi can take two possible values (σ i = 0 or 1). It receives, at time t, K binary input signals coming from K connected spins and updates its state according to a deterministic Boolean function of the K inputs. We compare the time evolution of the overlaps between different configurations for the two following models : Kauffman's model, for which the connections and Boolean function of each spin are randomly chosen at time t = 0 and remain unchanged at later times; the annealed model, for which these parameters are randomly reset at each time step. The numerical simulations for both models agree remarkably well with the theoretical predictions available for the second model.
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
The large scale structure and dynamics of gene control circuits
Kauffman, S. (1974) · Journal of Theoretical Biology · doi:10.1016/s0022-5193(74)80037-8 · Cited by 232
Cited by
Real-Time Computation at the Edge of Chaos in Recurrent Neural Networks
Bertschinger, N., & Natschläger, T. (2004) · Neural Computation · doi:10.1162/089976604323057443 · Cited by 833
Random Boolean network models and the yeast transcriptional network
Kauffman, S., Peterson, C., Samuelsson, B., & Troein, C. (2003) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.2036429100 · Cited by 553
Haldeman, C., & Beggs, J. M. (2005) · Physical Review Letters · doi:10.1103/physrevlett.94.058101 · Cited by 469
Genetic networks with canalyzing Boolean rules are always stable
Kauffman, S., Peterson, C., Samuelsson, B., & Troein, C. (2004) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0407783101 · Cited by 340
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
- Derrida, B., & Weisbuch, G.
- Venue
- Journal de Physique
- Publisher
- EDP Sciences
- Published
- 1986
- Volume
- 47
- Issue
- 8
- Pages
- 1297-1303
- ISSN
- 0302-0738 (ISSN-L)
- OpenAlex
- W2154749468
- Cited by
- 177
- References
- 2
- FWCI
- 17.18
- 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: Evolution of overlaps between configurations in random Boolean networks. https://app.cochat.ai/papers/10.1051/jphys:019860047080129700
- The paper
- Derrida, B., & Weisbuch, G. (1986). Evolution of overlaps between configurations in random Boolean networks. Journal de Physique. https://doi.org/10.1051/jphys%3A019860047080129700
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.
