The DOI matches its Crossref record; 425 of the 438 references it cites were found in a registry or an index.
Introduction to Random Graphs
Abstract
From social networks such as Facebook, the World Wide Web and the Internet, to the complex interactions between proteins in the cells of our bodies, we constantly face the challenge of understanding the structure and development of networks. The theory of random graphs provides a framework for this understanding, and in this book the authors give a gentle introduction to the basic tools for understanding and applying the theory. Part I includes sufficient material, including exercises, for a one semester course at the advanced undergraduate or beginning graduate level. The reader is then well prepared for the more advanced topics in Parts II and III. A final part provides a quick introduction to the background material needed. All those interested in discrete mathematics, computer science or applied probability and their applications will find this an ideal introduction to the subject.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“From a technical perspective, we argue that the behaviour change in 2017 is termed a second-order phase transition in the language of physics and is a behaviour often seen in random graphs dynamics where the number of nodes in the graph is growing with a fixed probability34.”
From Identifying fabricated networks within authorship-for-sale enterprises (2024) · cites this paper as [34]
Citations
Cites
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb01338.x · Cited by 88,486
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
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
An introduction to probability theory and its applications
(1958) · Journal of the Franklin Institute · doi:10.1016/0016-0032(58)90688-4 · Cited by 29,269
Jeffreys, H., Moran, P. A. P., & Chatfield, C. (1922) · Nature · doi:10.1093/oso/9780198503682.001.0001 · Cited by 7,878
Probability Inequalities for sums of Bounded Random Variables
Hoeffding, W. (1994) · Springer Series in Statistics · doi:10.1007/978-1-4612-0865-5_26 · Cited by 6,666
Bollobás, B. (1985) · Cited by 6,196
College Admissions and the Stability of Marriage
Gale, D., & Shapley, L. S. (1962) · The American Mathematical Monthly · doi:10.1080/00029890.1962.11989827 · Cited by 5,985
The Evolution of Random Graphs
(1986) · CBMS Regional Conference Series in Mathematics · doi:10.1090/cbms/062/06 · Cited by 5,543
The small-world problem: (400002009-005)
Milgram, S. (1967) · PsycEXTRA Dataset · doi:10.1037/e400002009-005 · Cited by 4,790
Cited by
Networks beyond pairwise interactions: Structure and dynamics
Battiston, F., Cencetti, G., Iacopini, I., Latora, V., Lucas, M., Patania, A., Young, J.-G., & Petri, G. (2020) · Physics Reports · doi:10.1016/j.physrep.2020.05.004 · Cited by 1,602
Blum, A., Hopcroft, J., & Kannan, R. (2020) · Cambridge University Press eBooks · doi:10.1017/9781108755528 · Cited by 304
Minimizing Polarization and Disagreement in Social Networks
Musco, C., Musco, C., & Tsourakakis, C. E. (2018) · International World Wide Web Conference (WWW) · doi:10.1145/3178876.3186103 · Cited by 156
Dynamic concentration of the triangle-free process
Bohman, T., & Keevash, P. (2013) · Random Structures and Algorithms · doi:10.1002/rsa.20973 · Cited by 122
Schweinberger, M., Krivitsky, P. N., Butts, C. T., & Stewart, J. R. (2020) · Statistical Science · doi:10.1214/19-sts743 · Cited by 126
Metadata
- Authors
- Frieze, A., & Karoński, M.
- Affiliations
- Carnegie Mellon University (US)
- Adam Mickiewicz University in Poznań (PL)
- ORCID
- Frieze, Alan
- Venue
- Cambridge University Press eBooks
- Publisher
- Cambridge University Press
- Published
- 2015-10-26
- OpenAlex
- W2336317531
- Cited by
- 576
- References
- 438
- Citations by year
- 2026: 17 · 2025: 52 · 2024: 57 · 2023: 81 · 2022: 71 · 2021: 63 · 2020: 84 · 2019: 56 · 2018: 53 · 2017: 24 · 2016: 15
- FWCI
- 8.73
- Type
- book
- Language
- en
- Open access
- closed
- Locations
- Cambridge University Press eBooks (publishedVersion)
- Topics
- Physical Sciences › Mathematics › Discrete Mathematics and Combinatorics › Limits and Structures in Graph Theory
- Physical Sciences › Physics and Astronomy › Statistical and Nonlinear Physics › Complex Network Analysis Techniques
- Physical Sciences › Mathematics › Mathematical Physics › Stochastic processes and statistical mechanics
- Keywords
- random graphs, network structure, network development, social networks, World Wide Web, protein-protein interaction network, discrete mathematics, applied probability
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: Introduction to Random Graphs. https://app.cochat.ai/papers/10.1017/cbo9781316339831
- The paper
- Frieze, A., & Karoński, M. (2015). Introduction to Random Graphs. Cambridge University Press eBooks. https://doi.org/10.1017/cbo9781316339831
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.