BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Pierre Youssef (NYU Abu Dhabi)
DTSTART:20210312T143000Z
DTEND:20210312T153000Z
DTSTAMP:20260423T022715Z
UID:MEGA/17
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/MEGA/17/">Mi
 xing time of the switch chain on regular bipartite graphs</a>\nby Pierre Y
 oussef (NYU Abu Dhabi) as part of Séminaire MEGA\n\n\nAbstract\nGiven a f
 ixed integer d\, we consider the switch chain on the set of d-regular bipa
 rtite graphs on n vertices equipped with the uniform measure. We prove a s
 harp Poincaré and log-Sobolev inequality implying that the mixing time of
  the switch chain is at most O(n log^2n) which is optimal up to a logarith
 mic term. This improves on earlier results of Kannan\, Tetali\, Vempala an
 d Dyer et al. who obtained the bounds O(n^13 log n) and O(n^7 log n) respe
 ctively. This is a joint work with Konstantin Tikhomirov.\n
LOCATION:https://researchseminars.org/talk/MEGA/17/
END:VEVENT
END:VCALENDAR