<?xml version="1.0" encoding="UTF-8"?>
<mods xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" version="3.1" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-1.xsd">
  <titleInfo>
    <title>Graphical evolution</title>
    <subTitle>an introduction to the theory of random graphs</subTitle>
  </titleInfo>
  <name type="personal">
    <namePart>Palmer, Edgar M.</namePart>
    <role>
      <roleTerm authority="marcrelator" type="text">creator</roleTerm>
    </role>
  </name>
  <typeOfResource>text</typeOfResource>
  <genre authority="marc">bibliography</genre>
  <originInfo>
    <place>
      <placeTerm type="code" authority="marccountry">nyu</placeTerm>
    </place>
    <place>
      <placeTerm type="text">New York</placeTerm>
    </place>
    <publisher>Wiley</publisher>
    <dateIssued>c1985</dateIssued>
    <dateIssued encoding="marc">1985</dateIssued>
    <issuance>monographic</issuance>
  </originInfo>
  <language>
    <languageTerm authority="iso639-2b" type="code">eng</languageTerm>
  </language>
  <physicalDescription>
    <form authority="marcform">print</form>
    <extent>xvii, 177 p. ; ill. ; 26 cm.</extent>
  </physicalDescription>
  <note type="statement of responsibility">Edgar M. Palmer.</note>
  <note>Subtitle: 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.</note>
  <note>"A Wiley-Interscience publication."</note>
  <note>Includes indexes.</note>
  <note>Bibliography: p. 163-171.</note>
  <subject authority="lcsh">
    <topic>Random graphs</topic>
  </subject>
  <classification authority="lcc">QA166.17 .P35 1985</classification>
  <classification authority="ddc">511.5 PAG</classification>
  <identifier type="isbn">0471815772 </identifier>
  <identifier type="lccn">84025695</identifier>
  <recordInfo>
    <recordContentSource authority="marcorg">DLC</recordContentSource>
    <recordCreationDate encoding="marc">841030</recordCreationDate>
    <recordChangeDate encoding="iso8601">20190107101229.0</recordChangeDate>
    <recordIdentifier source="BD-DhUL">952856</recordIdentifier>
  </recordInfo>
</mods>
