The DOI matches its Crossref record.
The transitive closure of a random digraph
Abstract
In a random n‐vertex digraph, each arc is present with probability p, independently of the presence or absence of other arcs. We investigate the structure of the strong components of a random digraph and present an algorithm for the construction of the transitive closure of a random digraph. We show that, when n is large and np is equal to a constant c greater than 1, it is very likely that all but one of the strong components are very small, and that the unique large strong component contains about Θ2 n vertices, where Θ is the unique root in [0, 1] of the equation 1 − x − e−ex = 0. Nearly all the vertices outside the large strong component line in strong components of size 1. Provided that the expected degree of a vertex is bounded away from 1, our transitive closure algorithm runs in expected time O(n). for all choices of n and p, the expected execution time of the algorithm is O(w(n) (n log n)4/3), where w(n) is an arbitrary nondecreasing unbounded function. To circumvent the fact that the size of the transitive closure may be Ω(n 2) the algorithm presents the transitive closure in the compact form (A × B)U C, where A and B are sets of vertices, and C is a set of arcs.
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
Cited by
Structural Properties of the Caenorhabditis elegans Neuronal Network
Varshney, L. R., Chen, B. L., Paniagua, E., Hall, D. H., & Chklovskii, D. B. (2011) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1001066 · Cited by 867
Random Graphs and Complex Networks
Hofstad, R. V. D. (2016) · Cambridge University Press eBooks · doi:10.1017/9781316779422 · Cited by 840
The Size of the Giant Component of a Random Graph with a Given Degree Sequence
MOLLOY, M., & REED, B. (1998) · Combinatorics, Probability and Computing · doi:10.1017/s0963548398003526 · Cited by 831
Frieze, A., & Karoński, M. (2015) · doi:10.1017/cbo9781316339831 · Cited by 576
The phase transition in inhomogeneous random graphs
Bollobás, B., Janson, S., & Riordan, O. (2007) · Random Structures & Algorithms · doi:10.1002/rsa.20168 · Cited by 545
Metadata
- Authors
- Karp, R. M.
- Venue
- Random Structures & Algorithms
- Publisher
- Wiley
- Published
- 1990-03
- Volume
- 1
- Issue
- 1
- Pages
- 73-93
- ISSN
- 1042-9832 (ISSN-L)
- 1098-2418
- OpenAlex
- W2109767783
- Cited by
- 215
- References
- 0
- FWCI
- 9.59
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: The transitive closure of a random digraph. https://app.cochat.ai/papers/10.1002/rsa.3240010106
- The paper
- Karp, R. M. (1990). The transitive closure of a random digraph. Random Structures & Algorithms. https://doi.org/10.1002/rsa.3240010106
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.