Books.org participates in affiliate programs including Bookshop.org and the Amazon Services LLC Associates Program. We may earn a commission from qualifying purchases made through links on this page, at no additional cost to you.
Overview
A unified, modern treatment of the theory of random graphs-including recent results and techniquesSince 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
Synopsis
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
SciTech Book News
Details developments in the theory of random graphs over the past decade, providing a much-needed overview of this area of combinatorics.
Editorials
SciTech Book News
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
Details developments in the theory of random graphs over the past decade, providing a much-needed overview of this area of combinatorics.Booknews
Details developments in the theory of random graphs over the past decade, providing a much-needed overview of this area of combinatorics. Covers fundamental theory as well as basic models of random graphs, and describes the phase transition phenomenon and the problem of containing small subgraphs. Incorporates many disparate results from across the literature, including results obtained by authors and some completely new results. Includes chapter exercises. Useful as an introduction for newcomers to the field and as a reference for scientists interested in discrete mathematics and theoretical computer science. Janson teaches mathematics at Uppsala University, Sweden. Annotation c. Book News, Inc., Portland, OR (booknews.com)From the Publisher
"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)