The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Random Graphs and Complex Networks
Abstract
This rigorous introduction to network science presents random graphs as models for real-world networks. Such networks have distinctive empirical properties and a wealth of new models have emerged to capture them. Classroom tested for over ten years, this text places recent advances in a unified framework to enable systematic study. Designed for a master's-level course, where students may only have a basic background in probability, the text covers such important preliminaries as convergence of random variables, probabilistic bounds, coupling, martingales, and branching processes. Building on this base - and motivated by many examples of real-world networks, including the Internet, collaboration networks, and the World Wide Web - it focuses on several important models for complex networks and investigates key properties, such as the connectivity of nodes. Numerous exercises allow students to develop intuition and experience in working with the models.
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
The anatomy of a large-scale hypertextual Web search engine
Brin, S., & Page, L. (1998) · Computer Networks and ISDN Systems · doi:10.1016/s0169-7552(98)00110-x · Cited by 16,004
Fortunato, S. (2010) · Physics Reports · doi:10.1016/j.physrep.2009.11.002 · Cited by 11,293
Embrechts, P., Klüppelberg, C., & Mikosch, T. (1997) · doi:10.1007/978-3-642-33483-2 · Cited by 4,402
Classes of small-world networks
Amaral, L. A. N., Scala, A., Barthélémy, M., & Stanley, H. E. (2000) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.200327197 · Cited by 3,051
Rich-club organization of the human connectome
van den Heuvel, M. P., & Sporns, O. (2011) · The Journal of Neuroscience · doi:10.1523/jneurosci.3539-11.2011 · Cited by 2,354
A Review of Facebook Research in the Social Sciences
Wilson, R. E., Gosling, S. D., & Graham, L. T. (2012) · Perspectives on Psychological Science · doi:10.1177/1745691612442904 · Cited by 1,226
Bose-Einstein Condensation in Complex Networks
Bianconi, G., & Barabási, A.-L. (2001) · Physical Review Letters · doi:10.1103/physrevlett.86.5632 · Cited by 808
Cited by
Recent advances in percolation theory and its applications
Saberi, A. A. (2015) · Physics Reports · doi:10.1016/j.physrep.2015.03.003 · Cited by 438
Metadata
- Authors
- Hofstad, R. V. D.
- Venue
- Cambridge University Press eBooks
- Publisher
- Cambridge University Press
- Published
- 2016-11-30
- OpenAlex
- W2290127356
- Cited by
- 840
- References
- 8
- FWCI
- 24.78
- Type
- book
- 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: Random Graphs and Complex Networks. https://app.cochat.ai/papers/10.1017/9781316779422
- The paper
- Hofstad, R. V. D. (2016). Random Graphs and Complex Networks. Cambridge University Press eBooks. https://doi.org/10.1017/9781316779422
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.