The Strange Logic of Random Graphs:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Berlin, Heidelberg
Springer Berlin Heidelberg
2001
|
| Schriftenreihe: | Algorithms and Combinatorics
22 |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Beschreibung: | 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 zero-one 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 |
| Beschreibung: | 1 Online-Ressource (X, 168 p) |
| ISBN: | 9783662045381 9783642074998 |
| ISSN: | 0937-5511 |
| DOI: | 10.1007/978-3-662-04538-1 |
Internformat
MARC
| LEADER | 00000nmm a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV042423311 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 150317s2001 |||| o||u| ||||||eng d | ||
| 020 | |a 9783662045381 |c Online |9 978-3-662-04538-1 | ||
| 020 | |a 9783642074998 |c Print |9 978-3-642-07499-8 | ||
| 024 | 7 | |a 10.1007/978-3-662-04538-1 |2 doi | |
| 035 | |a (OCoLC)863948162 | ||
| 035 | |a (DE-599)BVBBV042423311 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-384 |a DE-703 |a DE-91 |a DE-634 | ||
| 082 | 0 | |a 511.6 |2 23 | |
| 084 | |a MAT 000 |2 stub | ||
| 100 | 1 | |a Spencer, Joel |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a The Strange Logic of Random Graphs |c by Joel Spencer |
| 264 | 1 | |a Berlin, Heidelberg |b Springer Berlin Heidelberg |c 2001 | |
| 300 | |a 1 Online-Ressource (X, 168 p) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a Algorithms and Combinatorics |v 22 |x 0937-5511 | |
| 500 | |a 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 zero-one 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 | ||
| 650 | 4 | |a Mathematics | |
| 650 | 4 | |a Information theory | |
| 650 | 4 | |a Computer science | |
| 650 | 4 | |a Combinatorics | |
| 650 | 4 | |a Theory of Computation | |
| 650 | 4 | |a Mathematics of Computing | |
| 650 | 4 | |a Informatik | |
| 650 | 4 | |a Mathematik | |
| 650 | 0 | 7 | |a Mathematische Logik |0 (DE-588)4037951-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Zufallsgraph |0 (DE-588)4277661-2 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Zufallsgraph |0 (DE-588)4277661-2 |D s |
| 689 | 0 | 1 | |a Mathematische Logik |0 (DE-588)4037951-6 |D s |
| 689 | 0 | |8 1\p |5 DE-604 | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-3-662-04538-1 |x Verlag |3 Volltext |
| 912 | |a ZDB-2-SMA |a ZDB-2-BAE | ||
| 940 | 1 | |q ZDB-2-SMA_Archive | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-027858728 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
Datensatz im Suchindex
| _version_ | 1804153098881466368 |
|---|---|
| any_adam_object | |
| author | Spencer, Joel |
| author_facet | Spencer, Joel |
| author_role | aut |
| author_sort | Spencer, Joel |
| author_variant | j s js |
| building | Verbundindex |
| bvnumber | BV042423311 |
| classification_tum | MAT 000 |
| collection | ZDB-2-SMA ZDB-2-BAE |
| ctrlnum | (OCoLC)863948162 (DE-599)BVBBV042423311 |
| dewey-full | 511.6 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511.6 |
| dewey-search | 511.6 |
| dewey-sort | 3511.6 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| doi_str_mv | 10.1007/978-3-662-04538-1 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02557nmm a2200529zcb4500</leader><controlfield tag="001">BV042423311</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">150317s2001 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783662045381</subfield><subfield code="c">Online</subfield><subfield code="9">978-3-662-04538-1</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783642074998</subfield><subfield code="c">Print</subfield><subfield code="9">978-3-642-07499-8</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-3-662-04538-1</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)863948162</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV042423311</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-384</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-634</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.6</subfield><subfield code="2">23</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 000</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Spencer, Joel</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">The Strange Logic of Random Graphs</subfield><subfield code="c">by Joel Spencer</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin, Heidelberg</subfield><subfield code="b">Springer Berlin Heidelberg</subfield><subfield code="c">2001</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (X, 168 p)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Algorithms and Combinatorics</subfield><subfield code="v">22</subfield><subfield code="x">0937-5511</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">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 zero-one 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</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Information theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Combinatorics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Theory of Computation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematics of Computing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Informatik</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematik</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Mathematische Logik</subfield><subfield code="0">(DE-588)4037951-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Zufallsgraph</subfield><subfield code="0">(DE-588)4277661-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Zufallsgraph</subfield><subfield code="0">(DE-588)4277661-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Mathematische Logik</subfield><subfield code="0">(DE-588)4037951-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-3-662-04538-1</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-SMA</subfield><subfield code="a">ZDB-2-BAE</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-2-SMA_Archive</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-027858728</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield></record></collection> |
| id | DE-604.BV042423311 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T01:21:13Z |
| institution | BVB |
| isbn | 9783662045381 9783642074998 |
| issn | 0937-5511 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-027858728 |
| oclc_num | 863948162 |
| open_access_boolean | |
| owner | DE-384 DE-703 DE-91 DE-BY-TUM DE-634 |
| owner_facet | DE-384 DE-703 DE-91 DE-BY-TUM DE-634 |
| physical | 1 Online-Ressource (X, 168 p) |
| psigel | ZDB-2-SMA ZDB-2-BAE ZDB-2-SMA_Archive |
| publishDate | 2001 |
| publishDateSearch | 2001 |
| publishDateSort | 2001 |
| publisher | Springer Berlin Heidelberg |
| record_format | marc |
| series2 | Algorithms and Combinatorics |
| spelling | Spencer, Joel Verfasser aut The Strange Logic of Random Graphs by Joel Spencer Berlin, Heidelberg Springer Berlin Heidelberg 2001 1 Online-Ressource (X, 168 p) txt rdacontent c rdamedia cr rdacarrier Algorithms and Combinatorics 22 0937-5511 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 zero-one 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 Mathematics Information theory Computer science Combinatorics Theory of Computation Mathematics of Computing Informatik Mathematik Mathematische Logik (DE-588)4037951-6 gnd rswk-swf Zufallsgraph (DE-588)4277661-2 gnd rswk-swf Zufallsgraph (DE-588)4277661-2 s Mathematische Logik (DE-588)4037951-6 s 1\p DE-604 https://doi.org/10.1007/978-3-662-04538-1 Verlag Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Spencer, Joel The Strange Logic of Random Graphs Mathematics Information theory Computer science Combinatorics Theory of Computation Mathematics of Computing Informatik Mathematik Mathematische Logik (DE-588)4037951-6 gnd Zufallsgraph (DE-588)4277661-2 gnd |
| subject_GND | (DE-588)4037951-6 (DE-588)4277661-2 |
| title | The Strange Logic of Random Graphs |
| title_auth | The Strange Logic of Random Graphs |
| title_exact_search | The Strange Logic of Random Graphs |
| title_full | The Strange Logic of Random Graphs by Joel Spencer |
| title_fullStr | The Strange Logic of Random Graphs by Joel Spencer |
| title_full_unstemmed | The Strange Logic of Random Graphs by Joel Spencer |
| title_short | The Strange Logic of Random Graphs |
| title_sort | the strange logic of random graphs |
| topic | Mathematics Information theory Computer science Combinatorics Theory of Computation Mathematics of Computing Informatik Mathematik Mathematische Logik (DE-588)4037951-6 gnd Zufallsgraph (DE-588)4277661-2 gnd |
| topic_facet | Mathematics Information theory Computer science Combinatorics Theory of Computation Mathematics of Computing Informatik Mathematik Mathematische Logik Zufallsgraph |
| url | https://doi.org/10.1007/978-3-662-04538-1 |
| work_keys_str_mv | AT spencerjoel thestrangelogicofrandomgraphs |