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:Isaac Newton Institute Seminar Series
SUMMARY:Matchings and rank for random diluted graphs - Lel
arge\, M (ENS)
DTSTART;TZID=Europe/London:20100325T140000
DTEND;TZID=Europe/London:20100325T150000
UID:TALK23837AThttp://talks.cam.ac.uk
URL:http://talks.cam.ac.uk/talk/index/23837
DESCRIPTION:We study matchings on a sequence of random graphs
that converge locally to trees. Inspired by techni
ques from random matrix theory\, we rigorously pro
ve the validity of the cavity method for the compu
tation of the entropy. At a positive temperature\,
the cavity equations are interpreted as equations
for the local marginals of the Boltzmann Gibbs di
stribution in the space of matchings on a (possibl
y) infinite tree. These equations also appear in t
he computation of the asymptotic rank of the adjac
ency matrices of the random graphs. We also define
a determinantal process on the tree which is the
limit at positive temperature of the matchings on
the sequence of graphs. (joint work with Charles B
ordenave and Justin Salez)
LOCATION:Seminar Room 1\, Newton Institute
CONTACT:Mustapha Amrani
END:VEVENT
END:VCALENDAR