Search Images Maps Play YouTube News Gmail Drive More »
My library | Help | Advanced Book Search | Web History | Sign in

Books

Random Graphs

Front Cover
Béla Bollobás
4 Reviews
Cambridge University Press, Aug 30, 2001 - Mathematics - 498 pages
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/

Review: Random Graphs

User Review  - Joecolelife - Goodreads

This is the second book by Dr. Bollobas that I have read, and it is clear, that Dr. Bollobas is a master in the field. It is amazing, how few lines he needs to motivate the subject matter completely ... Read full review

Related books

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

Other editions - View all

Common terms and phrases

Popular passages

Page 489 - Tables of series products and integrals (VEB Deutscher Verlag der Wissenschaften, Berlin, 1957).

References to this book

From other books

Introduction To Algorithms
Six Degrees: The Science of a Connected Age
All Book Search results »

From Google Scholar

The structure and function of complex networks
MEJ Newman - 2003 - Arxiv preprint cond-mat/0303516
The large-scale organization of metabolic networks
H Jeong, B Tombor, R Albert, ZN Oltvai, A-L Barabási
Random Graphs
Svante Janson
Greedy Randomized Adaptive Search Procedures
Thomas A Feo, Mauricio GC Resende - 1995 - Journal of Global Optimization
All Scholar search results »

References from web pages

Random Graphs
Random Graphs. ●. Key difference with percolation models: ... Janson, Luczak, Rucinski: Random Graphs, Wiley, 2000. ●. Selected topics, good intuition ...
icawww1.epfl.ch/ class-nooc/ nooc2006_rg.pdf

Large Scale Random Graphs Methods for Modeling Mesoscopic Behavior ...
Inhomogeneous Random Graphs. Bela Bollobas (University of Cambridge, ... Session: Theory of Random Graphs and Networks. 14:00 - 14:30 pm ...
www.renyi.hu/ conferences/ 2006/ largescale/ nsfws_large06_program.pdf

The Choice Number of Dense Random Graphs
Colouring properties of random graphs have attracted a great deal of ... random graphs still remain unsolved, the main problem in this direction can be ...
journals.cambridge.org/ article_S0963548399004101

Orders of Induced Subgraphs Sparse Random Graphs
be dealing only with sparse random graphs. Notice that one can find many ... classic result in the theory of random graphs due to Erdos and Rtnyi. THEOREM ...
www.blackwell-synergy.com/ doi/ pdf/ 10.1111/ j.1749-6632.1989.tb16427.x

Braess’s Paradox in Large Random Graphs
condition in random graphs does not appear to be easy. In .... over to models of sparse or non-uniform random graphs is. an interesting open question. ...
www.eecs.berkeley.edu/ ~gvaliant/ papers/ rbp.pdf

JSTOR: Quasi-Random Graphs
969-970, February 1988 Mathematics Quasi-random graphs frk chungt, rl GRAHAMS, AND rm WILSON tbell Communications Research, Morristown, NJ 07960; ...
links.jstor.org/ sici?sici=0027-8424(19880215)85%3A4%3C969%3AQG%3E2.0.CO%3B2-2

Bisecting sparse random graphs
random graphs. We consider the standard random graph G , with vertices ... following result concerning the components of random graphs Erdos and Renyi ...
www.stats.ox.ac.uk/ ~cstone/ Prof.%20C.%20McDiarmid%20Publications/ 2001/ bisectrsa.pdf

arxiv:cond-mat/0312028 v2 30 May 2004
On the uniform generation of random graphs with prescribed degree sequences. R. Milo, ... ation of random graphs with single edges. We will refer to ...
arxiv.org/ pdf/ cond-mat/ 0312028

Random Graphs, Random Triangle-Free Graphs, and Random Partial Orders
theory of random graphs.Among the many sights worth seeing there, ... density as a control or time parameter, and study the structure of random graphs ...
www.springerlink.com/ index/ 7Y5C5D4NAMN3XCDN.pdf

NSF US-HUNGARIAN WORKSHOP ON LARGE SCALE RANDOM GRAPHS
Hamiltonian Cycles in Sparse Random Graphs. 11:30 - 12:30 pm, Panel A: Challenges in Large Scale Random Network Theory. . 12:30 - 14:00 pm, Lunch Break ...
cnd.memphis.edu/ ~nsfworkshop06/ Program.htm

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