Skip to main content Accessibility help
×
  1. Home
  2. Books
  3. Introduction to Random Graphs
  • Cited by 267
      • Show more authors
      • You may already have access via personal or institutional login
    • Select format
    • Publisher:
      Cambridge University Press
      Publication date:
      November 2015
      October 2015
      ISBN:
      9781316339831
      9781107118508
      DOI:
      https://doi.org/10.1017/CBO9781316339831
      Dimensions:
      (235 x 156 mm)
      Weight & Pages:
      0.85kg, 478 Pages
      Dimensions:
      Weight & Pages:
      • Subjects:
      Mathematics, Algorithmics, Complexity, Computer Algebra, Computational Geometry, Computer Science, Discrete Mathematics Information Theory and Coding
    You may already have access via personal or institutional login
    • Selected: Digital
    Add to cart View cart Buy from Cambridge.org
    Subjects:
    Mathematics, Algorithmics, Complexity, Computer Algebra, Computational Geometry, Computer Science, Discrete Mathematics Information Theory and Coding
    Information

    Book description

    From social networks such as Facebook, the World Wide Web and the Internet, to the complex interactions between proteins in the cells of our bodies, we constantly face the challenge of understanding the structure and development of networks. The theory of random graphs provides a framework for this understanding, and in this book the authors give a gentle introduction to the basic tools for understanding and applying the theory. Part I includes sufficient material, including exercises, for a one semester course at the advanced undergraduate or beginning graduate level. The reader is then well prepared for the more advanced topics in Parts II and III. A final part provides a quick introduction to the background material needed. All those interested in discrete mathematics, computer science or applied probability and their applications will find this an ideal introduction to the subject.

    Reviews

    'This is a well-planned book that is true to its title in that it is indeed accessible for anyone with just an undergraduate student’s knowledge of enumerative combinatorics and probability.'

    Miklós Bóna Source: MAA Reviews

    Refine List

    Actions for selected content:

    Select all | Deselect all
    • View selected items
    • Export citations
    • Download PDF (zip)
    • Save to Kindle
    • Save to Dropbox
    • Save to Google Drive

    Save Search

    You can save your searches here and later view and run them again in "My saved searches".

    Please provide a title, maximum of 40 characters.
    Cancel
    ×

    Contents

    Page 1 of 2

    Contents

    Page 1 of 2

    Metrics

    Altmetric attention score

    Full text views

    Total number of HTML views: 0
    Total number of PDF views: 0 *
    Loading metrics...

    Book summary page views

    Total views: 0 *
    Loading metrics...

    * Views captured on Cambridge Core between #date#. This data will be updated every 24 hours.

    Usage data cannot currently be displayed.

    Accessibility standard: Unknown

    Accessibility compliance for the PDF of this book is currently unknown and may be updated in the future.