Buch, Englisch, 168 Seiten, Previously published in hardcover, Format (B × H): 155 mm x 235 mm, Gewicht: 283 g
Reihe: Algorithms and Combinatorics
Buch, Englisch, 168 Seiten, Previously published in hardcover, Format (B × H): 155 mm x 235 mm, Gewicht: 283 g
Reihe: Algorithms and Combinatorics
ISBN: 978-3-642-07499-8
Verlag: Springer
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.
Zielgruppe
Research
Autoren/Hrsg.
Fachgebiete
- Mathematik | Informatik EDV | Informatik Informatik Theoretische Informatik
- Mathematik | Informatik Mathematik Mathematik Allgemein Mathematische Logik
- Mathematik | Informatik Mathematik Operations Research Graphentheorie
- Mathematik | Informatik Mathematik Mathematik Allgemein Diskrete Mathematik, Kombinatorik
- Mathematik | Informatik Mathematik Stochastik Wahrscheinlichkeitsrechnung
- Mathematik | Informatik EDV | Informatik Informatik Logik, formale Sprachen, Automaten
Weitere Infos & Material
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.
