CDN$ 150.39
  • List Price: CDN$ 187.99
  • You Save: CDN$ 37.60 (20%)
Only 1 left in stock (more on the way).
Ships from and sold by Amazon.ca.
Gift-wrap available.
Quantity:1
Have one to sell?
Flip to back Flip to front
Listen Playing... Paused   You're listening to a sample of the Audible audio edition.
Learn more
See all 2 images

Random Graphs Hardcover – Mar 13 2000


See all 2 formats and editions Hide other formats and editions
Amazon Price New from Used from
Hardcover
"Please retry"
CDN$ 150.39
CDN$ 149.81 CDN$ 200.53

Up to 90% Off Textbooks

Special Offers and Product Promotions

  • Join Amazon Student in Canada


Customers Who Bought This Item Also Bought



Product Details


Product Description

Review

"Details developments in the theory of random graphs over the past decade, providing a much-needed overview of this area of combinatorics." (SciTech Book News, Vol. 24, No. 4, December 2000)

The book is well written, and the material is well chosen. (Bulletin of the London Mathematical Society, Volume 33, 2001)

"It is fifteen years since Bollobas's monograph appeared, and this new definitive work should take us through the next fifteen. Such is the importance and appeal of this book that is should find its way onto the shelves no only of those working directly in the area of random graphs, but also anyone with a more general interest in combinatorics, probability theory, or certain aspects of computer science." (Mathematical Reviews, Issue 2001k)

"...a beautiful presentation of new developments in the asymptotic theory of random graphs." (Zentralblatt MATH, Vol. 968, 2001/18)

"An introduction to the subject as well as a resource for those working in the field." (American Mathematical Monthly, January 2002)

From the Publisher

Presents refereed papers by international experts regarding such diverse areas of interest as: random mappings and permutations, quasirandom graphs, random walks on trees, degree sequences, random matroids, central limit theorems, percolations and random subgraphs of the n-cube. Features an appendix of open problems from the conference. --This text refers to an alternate Hardcover edition.

Inside This Book (Learn More)
First Sentence
The notion of a random graph originated in a paper of Erdos (1947), which is considered by some as the first conscious application of the probabilistic method. Read the first page
Explore More
Concordance
Browse Sample Pages
Front Cover | Copyright | Table of Contents | Excerpt | Index | Back Cover
Search inside this book:

Customer Reviews

There are no customer reviews yet on Amazon.ca
5 star
4 star
3 star
2 star
1 star

Most Helpful Customer Reviews on Amazon.com (beta)

Amazon.com: 1 review
5 of 5 people found the following review helpful
No Match for Bollobas' Book on the same Subject Dec 30 2007
By PST - Published on Amazon.com
Format: Hardcover
The book claims to be a successor of Prof. Bollobas' book of the same title. Unlike Prof. Bollobas' book, I do not think this one is a very good textbook: The proofs of many theorems are not given, but the reader is directed to some source; these theorems are not of some unrelated subject, but their topic is random graphs. These unproven theorems are then used in the sequel to prove other theorems.
Furthermore, many proofs are delegated to "Excercises!", but no solutions are given.
Thirdly (at least for me, I am not a professional mathematician), the presentation is at very uneven levels: Very easy derivations and extremely hard derivations are mixed together, it seems the authors have little feel for the difficulty of their exposition.

On the positive side: The book is vitually typo-free, and the section on inequalities is much clearer -actually very good!- than the one in Prof. Bollobas's book.

A curious aside: two pages (pages 180, 181) were simply missing, and they were also missing in a second copy I ordered. Neither Amazon, nor the publisher (Wiley) were of any help getting those two pages.


Feedback