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:Logic and Semantics Seminar (Computer Laboratory)
SUMMARY:Heat kernels in graphs: A journey from random walk
s to geometry\, and back - He Sun\, University of
Bristol
DTSTART;TZID=Europe/London:20150612T140000
DTEND;TZID=Europe/London:20150612T150000
UID:TALK59763AThttp://talks.cam.ac.uk
URL:http://talks.cam.ac.uk/talk/index/59763
DESCRIPTION:Heat kernels are one of the most fundamental conce
pts in physics and\nmathematics. In physics\, the
heat kernel is a fundamental solution of \nthe hea
t equation and connects the Laplacian operator to
the rate of \nheat dissipation. In spectral geomet
ry\, many fundamental techniques are \nbased on he
at kernels. In finite Markov chain theory\, heat k
ernels \ncorrespond to continuous-time random walk
s and constitute one of the \nmost powerful techni
ques in estimating the mixing time.\n\nIn this tal
k\, we will briefly discuss this line of research
and its\nrelation to heat kernels in graphs. In pa
rticular\, we will see how heat\nkernels can be us
ed to design the first nearly-linear time algorith
m for\nfinding clusters in real-world graphs. Some
interesting open questions \nwill be addressed as
well.\n\nThis is based on the joint work with Ric
hard Peng (MIT)\, and Luca \nZanetti (University o
f Bristol). Parts of the results of this talk are
\nto appear in COLT 2015.\n
LOCATION:FW26
CONTACT:Jonathan Hayman
END:VEVENT
END:VCALENDAR