87,99 €
versandkostenfrei*

inkl. MwSt.
Versandfertig in 6-10 Tagen
Bequeme Ratenzahlung möglich!
ab 4,29 € monatlich
44 °P sammeln

    Broschiertes Buch

The study of random graphs was begun in the 1960s and now has a comprehensive literature. This excellent book by one of the top researchers in the field now joins the study of random graphs (and other random discrete objects) with mathematical logic. The methodologies involve probability, discrete structures and logic, with an emphasis on discrete structures.…mehr

Produktbeschreibung
The study of random graphs was begun in the 1960s and now has a comprehensive literature. This excellent book by one of the top researchers in the field now joins the study of random graphs (and other random discrete objects) with mathematical logic. The methodologies involve probability, discrete structures and logic, with an emphasis on discrete structures.
  • Produktdetails
  • Algorithms and Combinatorics Vol.22
  • Verlag: Springer, Berlin
  • Softcover reprint of hardcover 1st ed. 2001
  • Seitenzahl: 180
  • Erscheinungstermin: 1. Dezember 2010
  • Englisch
  • Abmessung: 235mm x 155mm x 9mm
  • Gewicht: 284g
  • ISBN-13: 9783642074998
  • ISBN-10: 3642074995
  • Artikelnr.: 32079038
Autorenporträt
JOEL H. SPENCER, PhD, is Professor of Mathematics and Computer Science at the Courant Institute of New York University. He is the cofounder and coeditor of the journal Random Structures and Algorithms and is also a Sloane Foundation Fellow.
Inhaltsangabe
I. Beginnings.- 0. Two Starting Examples.- 1. Preliminaries.- 2. The Ehrenfeucht Game.- 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 Powers of n.- III. Extras.- 9. A Dynamic View.- 10. Strings.- 11. Stronger Logics.- 12. Three Final Examples.
Rezensionen
From the reviews of the first edition: "The author ... is a leading expert in random graph theory, and reputed for his expository style. His recent book is again a well-written and exciting text, which I warmly recommend to researchers and graduate students interested in the subject. ... The book has a clear and vivid style, and the material is essentially self-contained, so it is very well-suited for self-study." (Péter Mester, Acta Scientiarum Mathematicarum, Vol. 69, 2003) "This beautifully written book deals with the fascinating world of random graphs, using a nice blend of techniques coming from combinatorics, probability and mathematical logic, while keeping the treatment self-contained." (Alessandro Berarducci, Mathematical Reviews, Issue 2003 d)