| Hardcover ISBN: | 978-2-37905-212-5 |
| Product Code: | COSP/31 |
| List Price: | $89.00 |
| AMS Member Price: | $71.20 |
| Hardcover ISBN: | 978-2-37905-212-5 |
| Product Code: | COSP/31 |
| List Price: | $89.00 |
| AMS Member Price: | $71.20 |
-
Book DetailsCours SpécialisésVolume: 31; 2025; 199 ppMSC: Primary 05; 60
Random graphs now stand at the forefront of modern probability and statistics, serving as powerful tools for modeling complex systems across disciplines. This course, tailored for master's and Ph.D. students, offers a rigorous and insightful introduction to the foundational models of random graph theory — among them the Bienaymé-Galton-Watson trees, the Erdős-Rényi graph, and preferential attachment models such as the Barabási-Albert graph.
The authors present short and modern proofs of landmark results, including the emergence of a giant component in Erdős-Rényi graphs and the asymptotic behavior of distances and degree distributions in preferential attachment networks. Special emphasis is placed on the core probabilistic techniques that drive these analyses—such as the method of moments, random walk theory, and Poissonization—equipping students with versatile tools that apply far beyond the scope of this course.
A publication of the Société Mathématique de France, Marseilles (SMF), distributed by the AMS in the U.S., Canada, and Mexico. Orders from other countries should be sent to the SMF. Members of the SMF receive a 30% discount from list.
ReadershipGraduate students and researchers.
-
Additional Material
-
RequestsReview Copy – for publishers of book reviews
- Book Details
- Additional Material
- Requests
Random graphs now stand at the forefront of modern probability and statistics, serving as powerful tools for modeling complex systems across disciplines. This course, tailored for master's and Ph.D. students, offers a rigorous and insightful introduction to the foundational models of random graph theory — among them the Bienaymé-Galton-Watson trees, the Erdős-Rényi graph, and preferential attachment models such as the Barabási-Albert graph.
The authors present short and modern proofs of landmark results, including the emergence of a giant component in Erdős-Rényi graphs and the asymptotic behavior of distances and degree distributions in preferential attachment networks. Special emphasis is placed on the core probabilistic techniques that drive these analyses—such as the method of moments, random walk theory, and Poissonization—equipping students with versatile tools that apply far beyond the scope of this course.
A publication of the Société Mathématique de France, Marseilles (SMF), distributed by the AMS in the U.S., Canada, and Mexico. Orders from other countries should be sent to the SMF. Members of the SMF receive a 30% discount from list.
Graduate students and researchers.
