BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/852
DTSTAMP:20230914T125941Z
SUMMARY:Exploration On Dynamic Networks
DESCRIPTION:Speaker: W.T.F. den Hollander (Mathematisch Instituut\nUniversi
teit Leiden\nPostbus 9512\n2300 RA Leiden\nThe Netherlands)\n\nAbstract: \
nSearch algorithms on networks are important tools for the organisation of
large data sets. A key example is Google PageRank\, which assigns a numer
ical weight to each webpage\, with the purpose of measuring its relative i
mportance. The weighting is achieved by exploration.\nNetworks are modelle
d as graphs\, complex networks as random graphs\, and search algorithms as
random walks. The mixing time of a random walk on a random graph is the t
ime it needs to approach its stationary distribution.\nMany real-world net
works are dynamic in nature. In this talk we investigate what happens when
at each unit of time a certain fraction of the edges is randomly rewired.
We investigate three regimes: fast\, moderate and slow dynamics. The mixi
ng time in these regimes exhibits surprising behaviour.\n
URL:https://www.tcs.tifr.res.in/web/events/852
DTSTART;TZID=Asia/Kolkata:20180124T160000
DTEND;TZID=Asia/Kolkata:20180124T170000
LOCATION:AG-66 (Lecture Theatre)
END:VEVENT
END:VCALENDAR