The DOI matches its Crossref record; 214 of the 214 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.
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
Items 201–214 of 214
Degree-Degree Dependencies in Random Graphs with Heavy-Tailed Degrees
van der Hofstad, R., & Litvak, N. (2014) · Internet Mathematics · doi:10.1080/15427951.2013.850455 · Cited by 37
Self-citationOn the number of sparse connected graphs
Łuczak, T. (1990) · Random Structures and Algorithms · doi:10.1002/rsa.3240010203 · Cited by 32
The probability that a random multigraph is simple. II
Janson, S. (2014) · Journal of Applied Probability · doi:10.1239/jap/1417528471 · Cited by 32
Degree Distribution of Competition-Induced Preferential Attachment Graphs
BERGER, N., Borgs, C., Chayes, J., D’Souza, R. M., & Kleinberg, R. (2005) · Combinatorics Probability Computing · doi:10.1017/s0963548305006930 · Cited by 27
Bhamidi, S., van der Hofstad, R., & Hooghiemstra, G. (2010) · Advances in Applied Probability · doi:10.1017/s0001867800050412 · Cited by 27
Self-citationLocal Limit Theorems for the Giant Component of Random Hypergraphs
Behrisch, M., Coja‐Oghlan, A., & Kang, M. (2014) · Combinatorics Probability Computing · doi:10.1017/s0963548314000017 · Cited by 24
Enumeration of graphs with a heavy-tailed degree sequence
Gao, P., & Wormald, N. (2015) · Advances in Mathematics · doi:10.1016/j.aim.2015.09.002 · Cited by 24
Proceedings of the 2nd ACM workshop on Online social networks
Crowcroft, J., & Krishnamurthy, B. (2009) · Cited by 20
Weak disorder asymptotics in the stochastic mean-field model of distance
Bhamidi, S., & Hofstad, R. R. V. D. (2010) · TU/e Research Portal · Cited by 20
Self-citationComponent Evolution in General Random Intersection Graphs
Bloznelis, M. (2010) · SIAM Journal on Discrete Mathematics · doi:10.1137/080713756 · Cited by 18
HOW LIKELY IS AN I.I.D. DEGREE SEQUENCE TO BE GRAPHICAL?Preprint
No., B., Arratia, R., & Liggett, T. M. (2005) · Cited by 17
Maximal Clusters in Non-Critical Percolation and Related Models
van der Hofstad, R., & Redig, F. (2006) · Journal of Statistical Physics · doi:10.1007/s10955-005-8012-z · Cited by 16
Self-citationConvergence properties of the degree distribution of some growing network models
Hagberg, O., & Wiuf, C. (2006) · Bulletin of Mathematical Biology · doi:10.1007/s11538-006-9085-9 · Cited by 15
The Largest Component in an Inhomogeneous Random Intersection Graph with Clustering
Bloznelis, M. (2010) · The Electronic Journal of Combinatorics · doi:10.37236/382 · Cited by 14
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
The science of science: From the perspective of complex systems
Zeng, A., Shen, Z., Zhou, J., Wu, J., Fan, Y., Wang, Y., & Stanley, H. E. (2017) · Physics Reports · doi:10.1016/j.physrep.2017.10.001 · Cited by 410
Edge-based compartmental modelling for infectious disease spread
Miller, J. C., Slim, A. C., & Volz, E. M. (2012) · Journal of The Royal Society Interface · doi:10.1098/rsif.2011.0403 · Cited by 278
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
- 214
- 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
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.