Random Graphs

AvBéla Bollobás,Bela Bollobas

Inbunden, Engelska, 2001

Del 73 i serien Cambridge Studies in Advanced Mathematics

2 693 kr

Beställningsvara. Skickas inom 7-10 vardagar. Fri frakt över 249 kr.

Fler format och utgåvor

Häftad

1 064 kr

Skickas inom 7-10 vardagar

Beskrivning

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.

Produktinformation

Utgivningsdatum:2001-08-30
Mått:152 x 229 x 33 mm
Vikt:930 g
Format:Inbunden
Språk:Engelska
Serie:Cambridge Studies in Advanced Mathematics
Antal sidor:520
Upplaga:2
Förlag:Cambridge University Press
ISBN:9780521809207

Utforska kategorier

Kombinatorik och grafteori inom Naturvetenskap och teknik

Mer om författaren

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.

Recensioner i media

'… contains an enormous amount of material, assembled by one who has played a leading role in the development of the area.' Zentralblatt MATH

Innehållsförteckning

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.