BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//132.216.98.100//NONSGML kigkonsult.se iCalcreator 2.20.4//
BEGIN:VEVENT
UID:20260610T052357EDT-5180g7w3x9@132.216.98.100
DTSTAMP:20260610T092357Z
DESCRIPTION:Three favorite sites occurs infinitely often for one-dimensiona
 l simple random walk.\n\nFor a one-dimensional simple random walk (S_t)\, 
 for each time t we say a site x is a favorite site if it has the maximal l
 ocal time. In this talk\, I will present a joint work with Jianfei Shen\, 
 which states that with probability 1 three favorite sites occurs infinitel
 y often. Our work is inspired by Tóth (2001)\, and disproves a conjecture 
 of Erdős and Révész (1984) and of Tóth (2001). I will try to explain the p
 roof steps.\n
DTSTART:20170323T203000Z
DTEND:20170323T213000Z
LOCATION:room 1205\, Burnside Hall\, CA\, QC\, Montreal\, H3A 0B9\, 805 rue
  Sherbrooke Ouest
SUMMARY:Jian Ding\, Chicago
URL:https://www.mcgill.ca/mathstat/channels/event/jian-ding-chicago-267237
END:VEVENT
END:VCALENDAR