000			01624pam a2200289 a 4500
001			952856
005			20170822175057.0
008			841030s1985 nyu b 001 0 eng
010			_a 84025695
020			_a0471815772 : _c$32.50 (est.)
040			_aDLC _cDLC _dBSU
050	0	0	_aQA166.17 _b.P35 1985
082	0	0	_a511.5PAL _219
100	1		_aPalmer, Edgar M. _918772
245	1	0	_aGraphical evolution / _cEdgar M. Palmer.
260			_aNew York : _bWiley, _cc1985.
300			_axvii, 177 p. ; _c26 cm.
440		0	_aWiley-Interscience series in discrete mathematics _918773
500			_aSubtitle: An introduction to the theory of random graphs, wherein the most relevant probability models for graphs are described together with certain threshold functions which facilitate the careful study of the structure of a graph as it grows and specifically reveal the mysterious circumstances surrounding the abrupt appearance of the unique giant component which systematically absorbs its neighbors, devouring the larger first and ruthlessly continuing until the last isolated vertices have been swallowed up, whereupon the giant is suddenly brought under control by a spanning cycle. The text is laced with challenging exercises especially designed to instruct, and its accompanied by an appendix stuffed with useful formulas that everyone should know.
500			_a"A Wiley-Interscience publication."
500			_aIncludes indexes.
504			_aBibliography: p. 163-171.
650		0	_aRandom graphs. _918774
658			_aMathematics
906			_a7 _bcbc _corignew _d1 _eocip _f19 _gy-gencatlg
942			_2ddc _cBK
999			_c9085 _d9085