The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Giant strongly connected component of directed networks
Open accessAbstract
We describe how to calculate the sizes of all giant connected components of a directed graph, including the strongly connected one. In particular, the World Wide Web is a directed network. The results are obtained for graphs with statistically uncorrelated vertices and an arbitrary joint in and out-degree distribution P(k(i),k(o)). We show that if P(k(i),k(o)) does not factorize, the relative size of the giant strongly connected component deviates from the product of the relative sizes of the giant in- and out-components. The calculations of the relative sizes of all the giant components are demonstrated using the simplest examples. We explain that the giant strongly connected component may be less resilient to random damage than the giant weakly connected one.
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
Emergence of Scaling in Random Networks
Barabási, A.-L., & Albert, R. (1999) · Science · doi:10.1126/science.286.5439.509 · Cited by 36,135
Error and attack tolerance of complex networks
Albert, R., Jeong, H., & Barabási, A.-L. (2000) · Nature · doi:10.1038/35019019 · Cited by 7,534
Diameter of the World-Wide Web
Albert, R., Jeong, H., & Barabási, A.-L. (1999) · Nature · doi:10.1038/43601 · Cited by 4,260
Network Robustness and Fragility: Percolation on Random Graphs
Callaway, D. S., Newman, M. E. J., Strogatz, S. H., & Watts, D. J. (2000) · Physical Review Letters · doi:10.1103/physrevlett.85.5468 · Cited by 2,480
Resilience of the Internet to Random Breakdowns
Cohen, R., Erez, K., ben-Avraham, D., & Havlin, S. (2000) · Physical Review Letters · doi:10.1103/physrevlett.85.4626 · Cited by 2,391
A critical point for random graphs with a given degree sequence
Molloy, M., & Reed, B. (1995) · Random Structures & Algorithms · doi:10.1002/rsa.3240060204 · Cited by 2,351
Łuczak, T., Janson, S., & Ruciński, A. (2000) · Cited by 2,192
Janson, S., Łuczak, T., & Rucinski, A. (2000) · Wiley eBooks · doi:10.1002/9781118032718 · Cited by 1,545
Topology of Evolving Networks: Local Events and Universality
Albert, R., & Barabási, A.-L. (2000) · Physical Review Letters · doi:10.1103/physrevlett.85.5234 · Cited by 1,308
Structure of Growing Networks with Preferential Linking
Dorogovtsev, S. N., Mendes, J. F. F., & Samukhin, A. N. (2000) · Physical Review Letters · doi:10.1103/physrevlett.85.4633 · Cited by 1,307
Self-citationConnectivity of Growing Random Networks
Krapivsky, P. L., Redner, S., & Leyvraz, F. (2000) · Physical Review Letters · doi:10.1103/physrevlett.85.4629 · Cited by 1,197
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
Degree Distributions of Growing Networks
Krapivsky, P. L., Rodgers, G. J., & Redner, S. (2001) · Physical Review Letters · doi:10.1103/physrevlett.86.5401 · Cited by 312
Scaling properties of scale-free evolving networks: Continuous approach
Dorogovtsev, S. N., & Mendes, J. F. F. (2001) · Physical Review E · doi:10.1103/physreve.63.056125 · Cited by 258
Self-citationDynamics of directed graphs: the world-wide Web
Tadić, B. (2001) · Physica A Statistical Mechanics and its Applications · doi:10.1016/s0378-4371(01)00014-0 · Cited by 125
Cited by
Statistical mechanics of complex networks
Albert, R., & Barabási, A.-L. (2002) · Reviews of Modern Physics · doi:10.1103/revmodphys.74.47 · Cited by 20,471
The Structure and Function of Complex Networks
Newman, M. E. J. (2003) · SIAM Review · doi:10.1137/s003614450342480 · Cited by 18,719
Epidemic processes in complex networks
Pastor-Satorras, R., Castellano, C., Van Mieghem, P., & Vespignani, A. (2015) · Reviews of Modern Physics · doi:10.1103/revmodphys.87.925 · Cited by 3,697
Spread of epidemic disease on networks
Newman, M. E. J. (2002) · Physical Review E · doi:10.1103/physreve.66.016128 · Cited by 3,218
Dorogovtsev, S. N., & Mendes, J. F. F. (2002) · Advances in Physics · doi:10.1080/00018730110112519 · Cited by 3,171
Self-citation
Metadata
- Authors
- Dorogovtsev, S. N., Mendes, J. F. F., & Samukhin, A. N.
- Venue
- Physical Review E
- Publisher
- American Physical Society (APS)
- Published
- 2001-07-19
- Volume
- 64
- Issue
- 2
- Pages
- 025101-025101
- ISSN
- 1063-651X (ISSN-L)
- 1095-3787
- OpenAlex
- W2069576934
- Cited by
- 303
- References
- 15
- FWCI
- 3.71
- 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
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.