Random Graphs

Front Cover
Cambridge University Press, Aug 30, 2001 - Mathematics - 498 pages
2 Reviews
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 estimates 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.
 

What people are saying - Write a review

User Review - Flag as inappropriate

Here is an interesting article concerning the growth of a giant component :
http://expertvoices.nsdl.org/cornell-info204/2008/03/06/the-formation-of-a-giant-component/

Contents

IV
1
V
5
VI
9
VII
15
VIII
25
IX
34
XI
43
XII
46
XLIX
243
L
245
LI
248
LII
251
LIII
254
LIV
264
LV
267
LVI
271

XIII
50
XIV
60
XV
65
XVI
69
XVII
72
XVIII
74
XIX
78
XX
79
XXI
85
XXII
91
XXIII
96
XXV
102
XXVI
110
XXVII
117
XXVIII
130
XXIX
138
XXX
143
XXXI
148
XXXII
153
XXXIII
160
XXXIV
161
XXXV
166
XXXVI
171
XXXVII
178
XXXVIII
189
XXXIX
195
XL
201
XLI
202
XLII
206
XLIII
212
XLIV
219
XLV
221
XLVI
224
XLVII
229
XLVIII
241
LVII
276
LVIII
282
LIX
290
LX
294
LXI
298
LXII
303
LXIII
319
LXIV
320
LXV
324
LXVI
332
LXVII
339
LXVIII
341
LXIX
348
LXX
357
LXXI
365
LXXII
373
LXXIII
376
LXXIV
383
LXXV
384
LXXVI
394
LXXVII
399
LXXVIII
408
LXXIX
412
LXXX
425
LXXXI
426
LXXXII
431
LXXXIII
435
LXXXIV
442
LXXXV
447
LXXXVI
448
LXXXVII
451
LXXXVIII
455
LXXXIX
457
XC
496
Copyright

Common terms and phrases

References to this book

All Book Search results »

About the author (2001)

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.

Bibliographic information