Skip to content

All SAP systems will be unavailable on Saturday 10th December 2022 from 0800-1800 UK Time.

If you can’t place an order, please contact Customer Services to complete your order.

UK/ROW directcs@cambridge.org +44 (0) 1223 326050 | US customer_service@cambridge.org 1 800 872 7423 or 1 212 337 5000 | Australia/New Zealand enquiries@cambridge.edu.au 61 3 86711400 or 1800 005 210, New Zealand 0800 023 520

Register Sign in Wishlist

Introduction to Random Graphs

$80.99 (C)

  • Date Published: February 2016
  • availability: Available
  • format: Hardback
  • isbn: 9781107118508

$ 80.99 (C)
Hardback

Add to cart Add to wishlist

Other available formats:
eBook


Looking for an examination copy?

This title is not currently available for examination. However, if you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact collegesales@cambridge.org providing details of the course you are teaching.

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

    • Brings the reader up to date with modern developments, including matchings in hypergraphs, containers and interpolation
    • Covers many basic tools that will be useful in all aspects of probabilistic combinatorics
    • Over 180 exercises test students' grasp of the material
    Read more

    Reviews & endorsements

    "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, MAA 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: February 2016
    • format: Hardback
    • isbn: 9781107118508
    • length: 478 pages
    • dimensions: 235 x 156 x 30 mm
    • weight: 0.81kg
    • contains: 25 b/w illus. 190 exercises
    • availability: Available
  • Table of Contents

    Preface
    Part I. Basic Models:
    1. Random graphs
    2. Evolution
    3. Vertex degrees
    4. Connectivity
    5. Small subgraphs
    6. Spanning subgraphs
    7. Extreme characteristics
    8. Extremal properties
    Part II. Basic Model Extensions:
    9. Inhomogeneous graphs
    10. Fixed degree sequence
    11. Intersection graphs
    12. Digraphs
    13. Hypergraphs
    Part III. Other Models:
    14. Trees
    15. Mappings
    16. k-out
    17. Real-world networks
    18. Weighted graphs
    19. Brief notes on uncovered topics
    Part IV. Tools and Methods:
    20. Moments
    21. Inequalities
    22. Differential equations method
    23. Branching processes
    24. Entropy
    References
    Author index
    Main index.

  • Authors

    Alan Frieze, Carnegie Mellon University, Pennsylvania
    Alan Frieze is a Professor in the Department of Mathematical Sciences at Carnegie Mellon University, Pennsylvania. He has authored more than 300 publications in top journals and was invited to be a plenary speaker at the Seoul ICM 2014. In 1991 he received the Fulkerson prize in discrete mathematics.

    Michał Karoński, Uniwersytet im. Adama Mickiewicza w Poznaniu, Poland
    Michał Karoński is a founder of the Discrete Mathematics Research group at Adam Mickiewicz University in Poznan, Poland. He has authored over 50 publications and currently serves as co-Editor-in-Chief of Random Structures and Algorithms.

Sorry, this resource is locked

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

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 www.ebooks.com. Please see the permission section of the www.ebooks.com 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.

Cancel

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.
×