First cycles in random directed graph processes
Open accessThe DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Abstract
Publisher Summary It is suggested that explanation of the origin of life is based on the idea of self-organization. A simple model for such a process is a random graph where the vertices represent a vast number of relatively short self-replicating ribonucleotide strands (RNA molecules), and where the directed edges represent catalytic interactions between the different RNA molecules. Given the physico-chemical conditions on how and with what frequency the catalytic formations are made, one can know when the first catalytic feedbacks appear, and how many different RNA molecules they involve. Models are described in the chapter that used to give quantitative estimates of the time of emergence of “real” genes. This is because of the fact that, as a random graph evolves, monotone properties (such as containing cycles) appear rather suddenly. For this one has to assume physico-chemical conditions for the prebiotic environment, then define which random graph model to be chosen.
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
Monod, J. (1974) · Studies in the Philosophy of Biology · doi:10.1007/978-1-349-01892-5_20 · Cited by 967
Cited by
Sudden Emergence of a Giantk-Core in a Random Graph
Pittel, B., Spencer, J., & Wormald, N. (1996) · Journal of Combinatorial Theory, Series B · doi:10.1006/jctb.1996.0036 · Cited by 437
Detecting autocatalytic, self-sustaining sets in chemical reaction systems
Hordijk, W., & Steel, M. (2004) · Journal of Theoretical Biology · doi:10.1016/j.jtbi.2003.11.020 · Cited by 251
Hordijk, W., Kauffman, S. A., & Steel, M. (2011) · International Journal of Molecular Sciences · doi:10.3390/ijms12053085 · Cited by 103
Autocatalytic networks in biology: structural theory and algorithms
Steel, M., Hordijk, W., & Xavier, J. C. (2019) · Journal of The Royal Society Interface · doi:10.1098/rsif.2018.0808 · Cited by 68
Molecular Diversity Required for the Formation of Autocatalytic Sets
Hordijk, W., Steel, M., & Kauffman, S. A. (2019) · Life · doi:10.3390/life9010023 · Cited by 24
“Thus, the study of the emergence of RAFs in elementary reaction networks is essentially equivalent to the study of the emergence of directed cycles in a random directed graph, a topic that was explored asymptotically in 1989 (motivated also by origin of life considerations) by [44].”
BackgroundResult
Metadata
- Authors
- Bollobás, B., & Rasmussen, S.
- Venue
- Discrete Mathematics
- Publisher
- Elsevier BV
- Published
- 1989-05
- Volume
- 75
- Issue
- 1-3
- Pages
- 55-68
- ISSN
- 0012-365X (ISSN-L)
- OpenAlex
- W2077478133
- Cited by
- 27
- References
- 1
- FWCI
- 10.14
- Type
- journal article
- Language
- en
- Open access
- bronze
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: First cycles in random directed graph processes. https://app.cochat.ai/papers/10.1016/0012-365x(89)90078-2
- The paper
- Bollobás, B., & Rasmussen, S. (1989). First cycles in random directed graph processes. Discrete Mathematics. https://doi.org/10.1016/0012-365x(89)90078-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.