The Resource The strange logic of random graphs, Joel Spencer
The strange logic of random graphs, Joel Spencer
Resource Information
The item The strange logic of random graphs, Joel Spencer represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri Libraries.This item is available to borrow from 1 library branch.
Resource Information
The item The strange logic of random graphs, Joel Spencer represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri Libraries.
This item is available to borrow from 1 library branch.
 Summary

 "The study of random graphs was begun by Paul Erdos and Alfred Renyi in the 1960s and now has a comprehensive literature. A compelling element has been the threshold function, a short range in which events rapidly move from almost certainly false to almost certainly true. This book now joins the study of random graphs (and other random discrete objects) with mathematical logic. The possible threshold phenomena are studied for all statements expressible in a given language. Often there is a zeroone law, that every statement holds with probability near zero or near one. The methodologies involve probability, discrete structures and logic, with an emphasis on discrete structures
 The book will be of interest to graduate students and researchers in discrete mathematics."Jacket
 "The study of random graphs was begun by Paul Erdos and Alfred Renyi in the 1960s and now has a comprehensive literature. A compelling element has been the threshold function, a short range in which events rapidly move from almost certainly false to almost certainly true. This book now joins the study of random graphs (and other random discrete objects) with mathematical logic. The possible threshold phenomena are studied for all statements expressible in a given language. Often there is a zeroone law, that every statement holds with probability near zero or near one. The methodologies involve probability, discrete structures and logic, with an emphasis on discrete structures. The book will be of interest to graduate students and researchers in discrete mathematics."BOOK JACKET
 Language
 eng
 Extent
 x, 168 pages
 Contents

 pt. II.
 Random Graphs.
 3.
 Very Sparse Graphs.
 4.
 The Combinatorics of Rooted Graphs.
 5.
 The Janson Inequality.
 6.
 The Main Theorem.
 7.
 Countable Models.
 8.
 Near Rational Power of n
 pt. III.
 Extras.
 9.
 A Dynamic View.
 10.
 Strings.
 pt. I.
 11.
 Stronger Logics.
 12.
 Three Final Examples
 Beginnings
 Two Starting Examples.
 1.
 Preliminaries.
 2.
 The Ehrenfeucht Game
 Isbn
 9783540416548
 Label
 The strange logic of random graphs
 Title
 The strange logic of random graphs
 Statement of responsibility
 Joel Spencer
 Language
 eng
 Summary

 "The study of random graphs was begun by Paul Erdos and Alfred Renyi in the 1960s and now has a comprehensive literature. A compelling element has been the threshold function, a short range in which events rapidly move from almost certainly false to almost certainly true. This book now joins the study of random graphs (and other random discrete objects) with mathematical logic. The possible threshold phenomena are studied for all statements expressible in a given language. Often there is a zeroone law, that every statement holds with probability near zero or near one. The methodologies involve probability, discrete structures and logic, with an emphasis on discrete structures
 The book will be of interest to graduate students and researchers in discrete mathematics."Jacket
 "The study of random graphs was begun by Paul Erdos and Alfred Renyi in the 1960s and now has a comprehensive literature. A compelling element has been the threshold function, a short range in which events rapidly move from almost certainly false to almost certainly true. This book now joins the study of random graphs (and other random discrete objects) with mathematical logic. The possible threshold phenomena are studied for all statements expressible in a given language. Often there is a zeroone law, that every statement holds with probability near zero or near one. The methodologies involve probability, discrete structures and logic, with an emphasis on discrete structures. The book will be of interest to graduate students and researchers in discrete mathematics."BOOK JACKET
 Cataloging source
 DLC
 http://library.link/vocab/creatorName
 Spencer, Joel H
 Dewey number
 511/.5
 Illustrations
 illustrations
 Index
 index present
 LC call number
 QA166.17
 LC item number
 .S64 2001
 Literary form
 non fiction
 Nature of contents
 bibliography
 Series statement
 Algorithms and combinatorics,
 Series volume
 22
 http://library.link/vocab/subjectName

 Random graphs
 Logic, Symbolic and mathematical
 Label
 The strange logic of random graphs, Joel Spencer
 Bibliography note
 Includes bibliographical references (pages [165]166) and index
 Carrier category
 volume
 Carrier category code

 nc
 Carrier MARC source
 rdacarrier
 Content category
 text
 Content type code

 txt
 Content type MARC source
 rdacontent
 Contents

 pt. II.
 Random Graphs.
 3.
 Very Sparse Graphs.
 4.
 The Combinatorics of Rooted Graphs.
 5.
 The Janson Inequality.
 6.
 The Main Theorem.
 7.
 Countable Models.
 8.
 Near Rational Power of n
 pt. III.
 Extras.
 9.
 A Dynamic View.
 10.
 Strings.
 pt. I.
 11.
 Stronger Logics.
 12.
 Three Final Examples
 Beginnings
 Two Starting Examples.
 1.
 Preliminaries.
 2.
 The Ehrenfeucht Game
 Control code
 46858406
 Dimensions
 25 cm
 Extent
 x, 168 pages
 Isbn
 9783540416548
 Isbn Type
 (alk. paper)
 Lccn
 2001032235
 Media category
 unmediated
 Media MARC source
 rdamedia
 Media type code

 n
 Other physical details
 illustrations
 Label
 The strange logic of random graphs, Joel Spencer
 Bibliography note
 Includes bibliographical references (pages [165]166) and index
 Carrier category
 volume
 Carrier category code

 nc
 Carrier MARC source
 rdacarrier
 Content category
 text
 Content type code

 txt
 Content type MARC source
 rdacontent
 Contents

 pt. II.
 Random Graphs.
 3.
 Very Sparse Graphs.
 4.
 The Combinatorics of Rooted Graphs.
 5.
 The Janson Inequality.
 6.
 The Main Theorem.
 7.
 Countable Models.
 8.
 Near Rational Power of n
 pt. III.
 Extras.
 9.
 A Dynamic View.
 10.
 Strings.
 pt. I.
 11.
 Stronger Logics.
 12.
 Three Final Examples
 Beginnings
 Two Starting Examples.
 1.
 Preliminaries.
 2.
 The Ehrenfeucht Game
 Control code
 46858406
 Dimensions
 25 cm
 Extent
 x, 168 pages
 Isbn
 9783540416548
 Isbn Type
 (alk. paper)
 Lccn
 2001032235
 Media category
 unmediated
 Media MARC source
 rdamedia
 Media type code

 n
 Other physical details
 illustrations
Library Links
Embed
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.library.missouri.edu/portal/ThestrangelogicofrandomgraphsJoel/Dkjx4JxT0XU/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/portal/ThestrangelogicofrandomgraphsJoel/Dkjx4JxT0XU/">The strange logic of random graphs, Joel Spencer</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.missouri.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.missouri.edu/">University of Missouri Libraries</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data  Experimental
Data Citation of the Item The strange logic of random graphs, Joel Spencer
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.library.missouri.edu/portal/ThestrangelogicofrandomgraphsJoel/Dkjx4JxT0XU/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/portal/ThestrangelogicofrandomgraphsJoel/Dkjx4JxT0XU/">The strange logic of random graphs, Joel Spencer</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.missouri.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.missouri.edu/">University of Missouri Libraries</a></span></span></span></span></div>