Random Graphs - Béla Bollobás

Random Graphs

(Autor)

Buch | Hardcover
520 Seiten
2001 | 2nd Revised edition
Cambridge University Press (Verlag)
978-0-521-80920-7 (ISBN)
239,95 inkl. MwSt
In this second edition of a now classic text, the addition of two new sections, numerous new results and over 150 references mean that this represents a comprehensive account of random graph theory. Suitable for mathematicians, computer scientists and electrical engineers, as well as people working in biomathematics.
In this second 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 a comprehensive account of random graph theory. The theory (founded by Erdös and Rényi 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 expert in the field, can be used by mathematicians, computer scientists and electrical engineers, as well as people working in biomathematics. It is self-contained, and with numerous exercises in each chapter, is ideal for advanced courses or self study.

Béla Bollobás 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. Bollobás has previously written over 250 research papers in extremal and probabilistic combinatorics, functional analysis, probability theory, isoperimetric inequalities and polynomials of graphs.

1. Probability theoretic preliminaries; 2. Models of random graphs; 3. The degree sequence; 4. Small subgraphs; 5. The evolution of random graphs - sparse components; 6. The evolution of random graphs-the giant component; 7. Connectivity and components; 8. Long paths and cycles; 9. The automorphism group; 10. The diameter; 11. Cliques, independent sets and colouring; 12. Ramsey theory; 13. Explicit constructions; 14. Sequences, matrices and permutations; 15. Sorting algorithms; 16. Random graphs of small order.

Erscheint lt. Verlag 30.8.2001
Reihe/Serie Cambridge Studies in Advanced Mathematics
Zusatzinfo 8 Tables, unspecified; 10 Line drawings, unspecified
Verlagsort Cambridge
Sprache englisch
Maße 152 x 229 mm
Gewicht 930 g
Themenwelt Mathematik / Informatik Mathematik Graphentheorie
ISBN-10 0-521-80920-7 / 0521809207
ISBN-13 978-0-521-80920-7 / 9780521809207
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich
Numbers and Counting, Groups, Graphs, Orders and Lattices

von Volker Diekert; Manfred Kufleitner; Gerhard Rosenberger …

Buch | Softcover (2023)
De Gruyter (Verlag)
59,95