BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Jeff Kahn (Rutgers)
DTSTART:20220304T173000Z
DTEND:20220304T183000Z
DTSTAMP:20260423T005704Z
UID:PatC/52
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/PatC/52/">Li
 near cover time is exponentially unlikely</a>\nby Jeff Kahn (Rutgers) as p
 art of Probability and the City Seminar\n\n\nAbstract\nProving a 2009 conj
 ecture of Itai Benjamini\, we show:\n\nFor any $C$ there is $c > 0$ so tha
 t for any simple random walk on an $n$-vertex graph $G$\, the probability 
 that the first $Cn$ steps of the walk see every vertex is less than $\\exp
 [-cn]$.\n\nA first ingredient in the proof of this is a similar statement 
 for Markov chains in which all transition probabilities are less than a su
 itable function of $C$.\n\nJoint with Quentin Dubroff.\n
LOCATION:https://researchseminars.org/talk/PatC/52/
END:VEVENT
END:VCALENDAR