Exploratory adaptation in large random networks
Open accessThe DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Abstract
The capacity of cells and organisms to respond to challenging conditions in a repeatable manner is limited by a finite repertoire of pre-evolved adaptive responses. Beyond this capacity, cells can use exploratory dynamics to cope with a much broader array of conditions. However, the process of adaptation by exploratory dynamics within the lifetime of a cell is not well understood. Here we demonstrate the feasibility of exploratory adaptation in a high-dimensional network model of gene regulation. Exploration is initiated by failure to comply with a constraint and is implemented by random sampling of network configurations. It ceases if and when the network reaches a stable state satisfying the constraint. We find that successful convergence (adaptation) in high dimensions requires outgoing network hubs and is enhanced by their auto-regulation. The ability of these empirically validated features of gene regulatory networks to support exploratory adaptation without fine-tuning, makes it plausible for biological implementation.
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
Maass, W., Natschläger, T., & Markram, H. (2002) · Neural Computation · doi:10.1162/089976602760407955 · Cited by 4,025
Network motifs: theory and experimental approaches
Alon, U. (2007) · Nature Reviews Genetics · doi:10.1038/nrg2102 · Cited by 3,279 · cited 1×
“Since autoregulation motifs are commonly observed in gene regulatory networks (not only in hubs) 32 , we investigated whether these motifs could also contribute to convergence when over-represented uniformly throughout the network.”
Chaos in random neural networks
Sompolinsky, H., Crisanti, A., & Sommers, H. J. (1988) · Physical Review Letters · doi:10.1103/physrevlett.61.259 · Cited by 1,061 · cited 1×
“In large homogeneous networks, this parameter determines whether the dynamics is dissipative (g0 < 1) or chaotic (g0 > 1) [22].”
Epigenetically Heritable Alteration of Fly Development in Response to Toxic Challenge
Stern, S., Fridmann-Sirkis, Y., Braun, E., & Soen, Y. (2012) · Cell Reports · doi:10.1016/j.celrep.2012.03.012 · Cited by 80
Self-citation
Cited by
Levin, M. (2019) · Frontiers in Psychology · doi:10.3389/fpsyg.2019.02688 · Cited by 297
Levin, M. (2022) · Frontiers in Systems Neuroscience · doi:10.3389/fnsys.2022.768201 · Cited by 195
“The task of determining which genes, out of the entire genome, can be transcriptionally regulated to return to an appropriate physiological regime is an example of an unconventional intelligence navigating a large-dimensional space to solve problems in real-time [142; 143; 144; 145].”
BackgroundFields, C., & Levin, M. (2022) · Entropy · doi:10.3390/e24060819 · Cited by 121
Levin, M. (2025) · BioEssays · doi:10.1002/bies.202400196 · Cited by 34
Metadata
- Authors
- Schreier, H. I., Soen, Y., & Brenner, N.
- Venue
- Nature Communications
- Published
- 2017-04-21
- Volume
- 8
- Issue
- 1
- Pages
- 14826-14826
- ISSN
- 2041-1723 (ISSN-L)
- OpenAlex
- W2410344417
- Cited by
- 53
- References
- 4
- FWCI
- 1.07
- Type
- journal article
- Language
- en
- Open access
- gold
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: Exploratory adaptation in large random networks. https://app.cochat.ai/papers/10.1038/ncomms14826
- The paper
- Schreier, H. I., Soen, Y., & Brenner, N. (2017). Exploratory adaptation in large random networks. Nature Communications. https://doi.org/10.1038/ncomms14826
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.