Random Graphs
This is a new edition of the now classic text. The already extensive treatment given in the first edition has been heavily revised by the author. The addition of two new sections, numerous new results and 150 references means that this represents an up to date and comprehensive account of random graph theory. The theory (founded by Erdos and Renyi in the late fifties) aims to estimate the number of graphs of a given degree that exhibit certain properties. It not only has numerous combinatorial applications, but also serves as a model for the probabilistic treatment of more complicated random structures. This book, written by an acknowledged e…
Mehr
CHF 271.00
Preise inkl. MwSt. und Versandkosten (Portofrei ab CHF 40.00)
V104:
Folgt in ca. 10 Arbeitstagen
Produktdetails
Weitere Autoren: Bollobas, Bela (Hrsg.) / Fulton, W. (Hrsg.)
- ISBN: 978-0-521-80920-7
- EAN: 9780521809207
- Produktnummer: 1664350
- Verlag: Cambridge University Press
- Sprache: Englisch
- Erscheinungsjahr: 2005
- Seitenangabe: 520 S.
- Masse: H23.5 cm x B15.7 cm x D3.4 cm 943 g
- Auflage: Revised
- Abbildungen: HC gerader Rücken kaschiert
- Gewicht: 943
Über den Autor
Bela Bollobas has taught at Cambridge University's Department of Pure Maths and Mathematical Statistics for over 25 years and has been a fellow of Trinity College for 30 years. Since 1996, he has held the unique Chair of Excellence in the Department of Mathematical Sciences at the University of Memphis. Bollobas has previously written over 250 research papers in extremal and probabilistic combinatorics, functional analysis, probability theory, isoperimetric inequalities and polynomials of graphs.
100 weitere Werke von Bela Bollobas:
Bewertungen
Anmelden