01756pam a2200289 a 4500001000700000003000800007005001700015008004100032010001700073020003100090040002600121050002400147082001500171100002100186245009400207260003100301300003500332490005500367500076400422500004001186500002201226504003001248650001901278942001201297999001501309952014201324952856BD-DhUL20190107101229.0841030s1985    nyu      b    001 0 eng    a   84025695   a0471815772 c$32.50 (est.)  aDLCcBD-DhULdBD-DhUL00aQA166.17b.P35 198500a511.5bPAG1 aPalmer, Edgar M.10aGraphical evolution :cEdgar M. Palmer.ban introduction to the theory of random graphs /  aNew York :bWiley,cc1985.  axvii, 177 p. ;bill. ;c26 cm. 0aWiley-Interscience series in discrete mathematics;  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.  a"A Wiley-Interscience publication."  aIncludes indexes.  aBibliography: p. 163-171. 0aRandom graphs.  2ddccBK  c5342d5342  00102ddc406511_500000000000000_PAG708NFIC99290aDUSLbDUSLcGENd2014-08-23eGifto511.5 PAGp321508r2014-08-23t1w2014-08-23yBK