Random Graphs

Bollobás, B. (2001). Random Graphs. Cambridge University Press.

Type

Book

Intellectual base

Review or monograph

Year

2001

Link

https://doi.org/10.1017/cbo9780511814068matched

Cited from

mathematics

Cited by

2 citations across 2 artifacts.

Each citation links to the sentence it supports in the citing article.

Primes

• Network
  • Mathematics (graph theory) → nodes: vertices → edges: edges / arcs → directed edge: arc / directed arrow → weighted edge: weight function → degree: vertex degree → path: walk / path / trail → cluster: community / block → centrality: centrality measures → cascade: percolation / connectivity under edge removal

    This sourceDefinitive modern treatment of random graph theory, spanning ER models and phase transitions in network connectivity.

Domain-specific

• Random graph
  • A random graph is a probability distribution on graphs, often generated by randomized inclusion of edges or vertices.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:2ba98b77e8e3 · see in the full table