- Publisher: Cambridge University Press
- Online publication date: March 2011
- Print publication year: 2001
- Online ISBN: 9780511814068
- DOI: https://doi.org/10.1017/CBO9780511814068
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.
Source: Zentralblatt MATH
Source: Internationale Mathematische Nachrichten
Source: Acta Scientiarum Mathematicarum
Source: SIGACT News
* Views captured on Cambridge Core between #date#. This data will be updated every 24 hours.
Usage data cannot currently be displayed.