BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//talks.cam.ac.uk//v3//EN
BEGIN:VTIMEZONE
TZID:Europe/London
BEGIN:DAYLIGHT
TZOFFSETFROM:+0000
TZOFFSETTO:+0100
TZNAME:BST
DTSTART:19700329T010000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0100
TZOFFSETTO:+0000
TZNAME:GMT
DTSTART:19701025T020000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
CATEGORIES:Computer Laboratory Wednesday Seminars
SUMMARY:Models of large-scale real-life networks - Bela Bo
llobas - University of Cambridge and University of
Memphis
DTSTART;TZID=Europe/London:20100120T141500
DTEND;TZID=Europe/London:20100120T151500
UID:TALK22080AThttp://talks.cam.ac.uk
URL:http://talks.cam.ac.uk/talk/index/22080
DESCRIPTION:In the last fifty years or so\, much research has
been done on various models\nof random graphs in m
athematics\, computer science and physics. Among t
he\nfamilies of models that mathematicians have wo
rked on over the years\, two\nstand out: the mean-
field models\, whose study was started by Erd˝os a
nd R´enyi\nin the late 1950s\, and the percolation
models\, based on lattices and lattice-like\ninfi
nite graphs\, introduced by Broadbent and Hammersl
ey at about the same\ntime. By now\, we have elabo
rate and deep theories of random subgraphs of\ncom
plete graphs and of percolation on lattices.\n\nIt
was realized only fairly recently that random gra
ph models may be very\nimportant in the study of m
assive graphs that occur in real life\, like the g
raph\nof the World Wide Web\, or various biologica
l networks. These graphs are too\nbig to describe
precisely\, and even if we could get all the infor
mation about\nthem\, this information could not be
handled efficiently. It seems that the best\nwe c
an do is model them as well as we can\, and study
the model. At the first\nsight it is surprising th
at the best models seem to be random graphs\, alth
ough\nthis is much less surprising if we realize t
hat many of these graphs arise by a\nmixture of de
terministic constructions and random decisions.\n\
nIn the talk we shall review a number of these mod
els\, and present several results\nabout them\, in
cluding some I have obtained jointly with Oliver R
iordan and\nSvante Janson.
LOCATION:Lecture Theatre 1\, Computer Laboratory
CONTACT:Mateja Jamnik
END:VEVENT
END:VCALENDAR