BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/905
DTSTAMP:20230914T125943Z
SUMMARY:Optimal Transport\, Wasserstein Distances and Random Fixed Points
DESCRIPTION:Speaker: Anand Deo\n\nAbstract: \nAbstract: Assume that we have
  to move a load of coal from source pile A to destination pile B\, both of
  whose shape we know\, and whose capacities are identical. It is known tha
 t moving a unit mass of sand from source location x to destination y requi
 res an effort of c(x\,y). The problem of optimal transport deals with perf
 orming this task in the most efficient possible way\, that is we ask for a
  transport "plan"\, u(dx\,dy)\, which tells us how much coal should be mov
 ed from x to y. Over the past two decades\, this problem has received a la
 rge amount attention\, with applications ranging from finance to meteorolo
 gy.\nIn this talk\, we will review some basic ideas about optimal transpor
 t\, and see one application in metrizing the space of probability distribu
 tions. Further\, we will see how such a metrization can be used to deriv
 e fixed points of distribution valued mappings (mappings which take one pr
 obability distribution to another).\n\nI will only assume basic familiarit
 y with linear programming for the purpose of this talk.\n
URL:https://www.tcs.tifr.res.in/web/events/905
DTSTART;TZID=Asia/Kolkata:20180921T171500
DTEND;TZID=Asia/Kolkata:20180921T181500
LOCATION:A-201 (STCS Seminar Room)
END:VEVENT
END:VCALENDAR