Vous voulez voir cette page en français ? Cliquez ici.


or
Sign in to turn on 1-Click ordering.
or
Amazon Prime Free Trial required. Sign up when you check out. Learn More
More Buying Choices
Have one to sell? Sell yours here
Tell the Publisher!
I'd like to read this book on Kindle

Don't have a Kindle? Get your Kindle here, or download a FREE Kindle Reading App.

Random Graphs [Hardcover]

Svante Janson , Tomasz Luczak , Andrzej Rucinski

List Price: CDN$ 187.99
Price: CDN$ 141.76 & FREE Shipping. Details
You Save: CDN$ 46.23 (25%)
o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o
Only 1 left in stock (more on the way).
Ships from and sold by Amazon.ca. Gift-wrap available.
Want it delivered Thursday, April 24? Choose One-Day Shipping at checkout.

Formats

Amazon Price New from Used from
Hardcover CDN $141.76  
Save Up to 50% on "For Dummies" Books
Lighthearted but not lightweight, For Dummies books are great references not only for tackling new subjects but also for brushing up on subjects with which you're already familiar. Get results while saving up to 50%. See more.

Book Description

March 13 2000 0471175412 978-0471175414 1
A unified, modern treatment of the theory of random graphs-including recent results and techniques
Since its inception in the 1960s, the theory of random graphs has evolved into a dynamic branch of discrete mathematics. Yet despite the lively activity and important applications, the last comprehensive volume on the subject is Bollobas's well-known 1985 book. Poised to stimulate research for years to come, this new work covers developments of the last decade, providing a much-needed, modern overview of this fast-growing area of combinatorics. Written by three highly respected members of the discrete mathematics community, the book incorporates many disparate results from across the literature, including results obtained by the authors and some completely new results. Current tools and techniques are also thoroughly emphasized. Clear, easily accessible presentations make Random Graphs an ideal introduction for newcomers to the field and an excellent reference for scientists interested in discrete mathematics and theoretical computer science. Special features include:
* A focus on the fundamental theory as well as basic models of random graphs
* A detailed description of the phase transition phenomenon
* Easy-to-apply exponential inequalities for large deviation bounds
* An extensive study of the problem of containing small subgraphs
* Results by Bollobas and others on the chromatic number of random graphs
* The result by Robinson and Wormald on the existence of Hamilton cycles in random regular graphs
* A gentle introduction to the zero-one laws
* Ample exercises, figures, and bibliographic references

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:

Sell a Digital Version of This Book in the Kindle Store

If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store. Learn more

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: 2.0 out of 5 stars  1 review
5 of 5 people found the following review helpful
2.0 out of 5 stars 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.
ARRAY(0xa3508e28)

Look for similar items by category


Feedback