Skip to content
Register Sign in Wishlist
Random Graphs

Random Graphs

2nd Edition

Part of Cambridge Studies in Advanced Mathematics

  • Author: Béla Bollobás, Trinity College, Cambridge and University of Memphis
  • Date Published: September 2001
  • availability: Available
  • format: Paperback
  • isbn: 9780521797221

Paperback

Add to wishlist

Other available formats:
Hardback, eBook


Looking for an inspection copy?

Please email academicmarketing@cambridge.edu.au to enquire about an inspection copy of this book

Description
Product filter button
Description
Contents
Resources
Courses
About the Authors
  • In this second edition of the now classic text, the already extensive treatment given in the first edition has been heavily revised by the author. The addition of two new sections, numerous new results and 150 references means that this represents a comprehensive account of random graph theory. The theory (founded by Erdös and Rényi in the late fifties) aims to estimate the number of graphs of a given degree that exhibit certain properties. It not only has numerous combinatorial applications, but also serves as a model for the probabilistic treatment of more complicated random structures. This book, written by an acknowledged expert in the field, can be used by mathematicians, computer scientists and electrical engineers, as well as people working in biomathematics. It is self-contained, and with numerous exercises in each chapter, is ideal for advanced courses or self study.

    • New edition of classic text
    • New sections and numerous additions bring the book right up to date
    • Subject with wide appeal will be useful for mathematicians, computer scientists, electrical engineers and biomathematicians
    Read more

    Reviews & endorsements

    '… contains an enormous amount of material, assembled by one who has played a leading role in the development of the area.' Zentralblatt MATH

    'This book, written by one of the leaders in the field, has become the bible of random graphs. This book is primarily for mathematicians interested in graph theory and combinatorics with probability and computing, but it could also be of interest to computer scientists. It is self-contained and lists numerous exercises in each chapter. As such, it is an excellent textbook for advanced courses or for self-study.' EMS

    'There are many beautiful results in the theory of random graphs, and the main aim of the book is to introduce the reader and extensive account of a substantial body of methods and results from the theory of random graphs. This is a classic textbook suitable not only for mathematicians. It has clearly passed the test of time.' Internationale Mathematische Nachrichten

    '… a very good and handy guidebhook for researchers.' Acta Scientiarum Mathematicarum

    'The book is very impressive in the wealth of information it offers. It is bound to become a reference material on random graphs.' SIGACT News

    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

    • Edition: 2nd Edition
    • Date Published: September 2001
    • format: Paperback
    • isbn: 9780521797221
    • length: 518 pages
    • dimensions: 227 x 154 x 23 mm
    • weight: 0.86kg
    • contains: 10 b/w illus. 8 tables
    • availability: Available
  • Table of Contents

    1. Probability theoretic preliminaries
    2. Models of random graphs
    3. The degree sequence
    4. Small subgraphs
    5. The evolution of random graphs - sparse components
    6. The evolution of random graphs-the giant component
    7. Connectivity and components
    8. Long paths and cycles
    9. The automorphism group
    10. The diameter
    11. Cliques, independent sets and colouring
    12. Ramsey theory
    13. Explicit constructions
    14. Sequences, matrices and permutations
    15. Sorting algorithms
    16. Random graphs of small order.

  • Author

    Béla Bollobás, Trinity College, Cambridge and University of Memphis
    Béla Bollobás has taught at Cambridge University's Department of Pure Maths and Mathematical Statistics for over 25 years and has been a fellow of Trinity College for 30 years. Since 1996, he has held the unique Chair of Excellence in the Department of Mathematical Sciences at the University of Memphis. Bollobás has previously written over 250 research papers in extremal and probabilistic combinatorics, functional analysis, probability theory, isoperimetric inequalities and polynomials of graphs.

Sign In

Please sign in to access your account

Cancel

Not already registered? Create an account now. ×

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 ×

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