Random Graphs

Informationen zum Autor 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. Klappentext This is a revised and updated version of the classic first edition. Zusammenfassung 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. Inhaltsverzeichnis 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.

Dettagli sul prodotto

• Autori: Bela Bollobas, Bollobas Bela, B. La Bollob?'s, Béla Bollobás
• Con la collaborazione di: Bela Bollobas (Editore)
• Editore: Cambridge University Press Academic
• Contenuto: Libro
• Forma del prodotto: Tascabile
• Data pubblicazione: 30.08.2001
• Categoria: Libri scolastici > Didattica > Formazione professionale
• EAN: 9780521797221
• ISBN: 978-0-521-79722-1
• Dimensioni (della confezione): 15.1 x 22.7 x 2.4 cm
• Serie: Cambridge Studies in Advanced Mathematics; Cambridge Studies in Advanced > 73