Buch, Englisch, Band 22, 168 Seiten, Format (B × H): 160 mm x 241 mm, Gewicht: 448 g
Reihe: Algorithms and Combinatorics
Buch, Englisch, Band 22, 168 Seiten, Format (B × H): 160 mm x 241 mm, Gewicht: 448 g
Reihe: Algorithms and Combinatorics
ISBN: 978-3-540-41654-8
Verlag: Springer Berlin Heidelberg
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 EDV | Informatik Informatik Logik, formale Sprachen, Automaten
- Mathematik | Informatik Mathematik Mathematik Allgemein Mathematische Logik
- Mathematik | Informatik Mathematik Mathematik Allgemein Diskrete Mathematik, Kombinatorik
- Mathematik | Informatik Mathematik Operations Research Graphentheorie
- Mathematik | Informatik Mathematik Stochastik Wahrscheinlichkeitsrechnung
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.
