BEGIN:VCALENDAR VERSION:2.0 PRODID:researchseminars.org CALSCALE:GREGORIAN X-WR-CALNAME:researchseminars.org BEGIN:VEVENT SUMMARY:Pierre Yousseff (NYU Abu Dhabi) DTSTART:20201215T153000Z DTEND:20201215T163000Z DTSTAMP:20260423T035816Z UID:OAGAS/44 DESCRIPTION:Title: M ixing time of the switch chain on regular bipartite graphs\nby Pierre Yousseff (NYU Abu Dhabi) as part of Online asymptotic geometric analysis s eminar\n\n\nAbstract\nGiven a fixed integer d\, we consider the switch cha in on the set of d-regular bipartite graphs on n vertices equipped with th e uniform measure. We prove a sharp Poincar� and log-Sobolev inequality implying that the mixing time of the switch chain is at most O(n log^2n) w hich is optimal up to a logarithmic term. This improves on earlier results of Kannan\, Tetali\, Vempala and Dyer et al. who obtained the bounds O(n^ 13 log n) and O(n^7 log n) respectively. This is a joint work with Konstan tin Tikhomirov.\n LOCATION:https://researchseminars.org/talk/OAGAS/44/ END:VEVENT END:VCALENDAR