Other available formats:
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 email@example.com providing details of the course you are teaching.
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.Read more
- 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
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
Not yet reviewed
Be the first to review
Review was not posted due to profanity×
- 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
Part I. Basic Models:
1. Random graphs
3. Vertex degrees
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
Part III. Other Models:
17. Real-world networks
18. Weighted graphs
19. Brief notes on uncovered topics
Part IV. Tools and Methods:
22. Differential equations method
23. Branching processes
Sorry, this resource is locked
Please register or sign in to request access. If you are having problems accessing these resources please email firstname.lastname@example.orgRegister Sign in
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 ×
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.×