BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/38
DTSTAMP:20230914T125907Z
SUMMARY:How Hard is it to Marry at Random?
DESCRIPTION:Speaker: Girish Varma\nSchool of Technology and Computer Scienc
 e\nTata Institute of Fundamental Research\nHomi Bhabha Road\n\nAbstract: \
 nMarkov chain Monte Carlo (MCMC) methods (which include random walk Monte 
 Carlo methods)\, are a class of algorithms for sampling from probability d
 istributions based on constructing a Markov chain that has the desired dis
 tribution as its equilibrium distribution. The state of the chain after a 
 large number of steps is then used as a sample from the desired distributi
 on. The quality of the sample improves as a function of the number of step
 s. We will use such a thing for generating a random perfect matching.\n\nR
 eference :\n\nApproximating the permanent M Jerrum\, A Sinclair - SIAM jou
 rnal on computing\, 1989 - link.aip.org\n\nHow hard is it to marry at rand
 om? AZ Broder - Proceedings of the eighteenth annual ACM symposium …
 \, 1986 - portal.acm.org\n
URL:https://www.tcs.tifr.res.in/web/events/38
DTSTART;VALUE=DATE:20091023
LOCATION:A-212 (STCS Seminar Room)
END:VEVENT
END:VCALENDAR