000			02116nam a22003618i 4500
001			CR9780511814068
003			UkCbUP
005			20200124160220.0
006			m|||||o||d||||||||
007			cr||||||||||||
008			101021s2001||||enk o ||1 0|eng|d
020			_a9780511814068 (ebook)
020			_z9780521809207 (hardback)
020			_z9780521797221 (paperback)
040			_aUkCbUP _beng _erda _cUkCbUP
050	0	0	_aQA166.17 _b.B66 2001
082	0	0	_a511/.5 _221
100	1		_aBollobás, Béla, _eauthor.
245	1	0	_aRandom graphs / _cBéla Bollobás.
250			_aSecond edition.
264		1	_aCambridge : _bCambridge University Press, _c2001.
300			_a1 online resource (xviii, 498 pages) : _bdigital, PDF file(s).
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
490	1		_aCambridge studies in advanced mathematics ; _v73
500			_aTitle from publisher's bibliographic system (viewed on 05 Oct 2015).
520			_aIn 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.
650		0	_aRandom graphs.
776	0	8	_iPrint version: _z9780521809207
830		0	_aCambridge studies in advanced mathematics ; _v73.
856	4	0	_uhttps://doi.org/10.1017/CBO9780511814068
999			_c516656 _d516654