Skip to content
Register Sign in Wishlist

Random Graphs and Complex Networks

$61.99 (C)

Part of Cambridge Series in Statistical and Probabilistic Mathematics

  • Date Published: December 2016
  • availability: In stock
  • format: Hardback
  • isbn: 9781107172876

$ 61.99 (C)

Add to cart Add to wishlist

Other available formats:

Looking for an examination copy?

If you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact providing details of the course you are teaching.

Product filter button
About the Authors
  • 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.

    • Classroom-tested over several years and written with students in mind
    • Details the empirical properties of networks through in-depth, real-world examples
    • Numerous exercises provide familiarity and experience with the theory and properties of network models
    Read more

    Reviews & endorsements

    "… a modern and deep, yet accessible, introduction to the models that make up [the] basis for the theoretical study of random graphs and complex networks. The book strikes a balance between providing broad perspective and analytic rigor that is a pleasure for the reader."
    Adam Wierman, California Institute of Technology

    "This text builds a bridge between the mathematical world of random graphs and the real world of complex networks. It combines techniques from probability theory and combinatorics to analyze the structural properties of large random graphs. Accessible to network researchers from different disciplines, as well as masters and graduate students, the material is suitable for a one-semester course, and is laced with exercises that help the reader grasp the content. The exposition focuses on a number of core models that have driven recent progress in the field, including the Erdős–Rényi random graph, the configuration model, and preferential attachment models. A detailed description is given of all their key properties. This is supplemented with insightful remarks about properties of related models so that a full panorama unfolds. As the presentation develops, the link to complex networks provides constant motivation for the routes that are being chosen."
    Frank den Hollander, Leiden University

    "The first volume of Remco van der Hofstad's Random Graphs and Complex Networks is the definitive introduction into the mathematical world of random networks. Written for students with only a modest background in probability theory, it provides plenty of motivation for the topic and introduces the essential tools of probability at a gentle pace. It covers the modern theory of Erdős–Rényi graphs, as well as the most important models of scale-free networks that have emerged in the last fifteen years. This is a truly wonderful first volume; the second volume, leading up to current research topics, is eagerly awaited."
    Peter Mörters, University of Bath

    "This new book on random graph models for complex networks is a wonderful addition to the field. It takes the uninitiated reader from the basics of graduate probability to the classical Erdős–Rényi random graph before terminating at some of the fundamental new models in the discipline. The author does an exemplary job of both motivating the models of interest and building all the necessary mathematical tools required to give a rigorous treatment of these models. Each chapter is complemented by a comprehensive set of exercises allowing the reader ample scope to actively master the techniques covered in the chapter."
    Shankar Bhamidi, University of North Carolina, Chapel Hill

    "This book is invaluable for anybody who wants to learn or teach the modern theory of random graphs and complex networks. I have used it as a textbook for long and short courses at different levels. Students always like the book because it has all they need: exciting high-level ideas, motivating examples, very clear proofs, and an excellent set of exercises. Easy to read, extremely well structured, and self-contained, the book builds proficiency with random graph models essential for state-of-the-art research."
    Nelly Litvak, University of Twente

    'What makes the book particularly interesting is that it provides all important preliminaries for readers not having the basic background knowledge of random graphs. … The book is well-suited for a graduate course on random graphs, where students may only have minimal background in probability theory, as the book provides plenty of motivation for the topic and covers all important preliminaries. All the chapters are supplemented by extensive exercises to develop better intuition and to progressively master the models covered in the book. In a nutshell, the book is easy to follow and well-organized for developing proficiency in random graph models necessary for state of the art research.' Ghulam Abbas, Complex Adaptive Systems Modeling

    'The writing is of a high standard. I would certainly recommend it to a starting graduate student, even if their first degree was not mathematics.' Tobias Muller, Nieuw Archief voor Weskunde

    See more reviews

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity


    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?


    Product details

    • Date Published: December 2016
    • format: Hardback
    • isbn: 9781107172876
    • length: 236 pages
    • dimensions: 262 x 184 x 22 mm
    • weight: 0.79kg
    • contains: 58 b/w illus. 5 tables
    • availability: In stock
  • Table of Contents

    Course outline
    1. Introduction
    Part I. Preliminaries:
    2. Probabilistics methods
    3. Branching processes
    Part II. Basic Models:
    4. Phase transition for the Erdos–Renyi random graph
    5. Erdos–Renyi random graph revisited
    Part III. Models for Complex Networks:
    6. Generalized random graphs
    7. Configuration model
    8. Preferential attachment models

  • Resources for

    Random Graphs and Complex Networks

    Remco van der Hofstad

    Instructor Resources

    Find resources associated with this title

    Type Name Unlocked * Format Size

    Showing of

    Back to top

    This title is supported by one or more locked resources. Access to locked resources is granted exclusively by Cambridge University Press to instructors whose faculty status has been verified. To gain access to locked resources, instructors should sign in to or register for a Cambridge user account.

    Please use locked resources responsibly and exercise your professional discretion when choosing how you share these materials with your students. Other instructors may wish to use locked resources for assessment purposes and their usefulness is undermined when the source files (for example, solution manuals or test banks) are shared online or via social networks.

    Supplementary resources are subject to copyright. Instructors are permitted to view, print or download these resources for use in their teaching, but may not change them or use them for commercial gain.

    If you are having problems accessing these resources please contact

  • Author

    Remco van der Hofstad, Technische Universiteit Eindhoven, The Netherlands
    Remco van der Hofstad is Full Professor of Probability at Eindhoven University of Technology and Acting Scientific Director of the European Institute for Statistics, Probability, Stochastic Operations Research and their Applications (Eurandom). He has authored over 100 research articles and has taught courses on random graphs at over ten institutions. He received the 2003 Prix Henri Poincaré (jointly with Gordon Slade) and the 2007 Rollo Davidson Prize, and he is a laureate of the 2003 Innovative Research VIDI Scheme and the 2008 Innovative Research VICI Scheme.

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email

Register Sign in
Please note that this file is password protected. You will be asked to input your password on the next screen.

» Proceed

You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner Please see the permission section of the catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Continue ×
warning icon

Turn stock notifications on?

You must be signed in to your Cambridge account to turn product stock notifications on or off.

Sign in Create a Cambridge account arrow icon

Find content that relates to you

Join us online

This site uses cookies to improve your experience. Read more Close

Are you sure you want to delete your account?

This cannot be undone.


Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

Please fill in the required fields in your feedback submission.