'This is a very concise, highly informative introduction to the theory of random graphs and networks ... Essential.' M. Bona, Choice
Conventions/Notation; Part I. Preliminaries: 1. Introduction; 2. Basic tools; Part II. Erdos–Rényi–Gilbert Model: 3. Uniform and binomial random graphs; 4. Evolution; 5. Vertex degrees; 6. Connectivity; 7. Small subgraphs; 8. Large subgraphs; 9. Extreme characteristics; Part III. Modeling Complex Networks: 10. Inhomogeneous graphs; 11. Small world; 12. Network processes; 13. Intersection graphs; 14. Weighted graphs; References; Author index; Main index.