BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Date iCal//NONSGML kigkonsult.se iCalcreator 2.20.2//
METHOD:PUBLISH
X-WR-CALNAME;VALUE=TEXT:Ical
BEGIN:VTIMEZONE
TZID:Asia/Jerusalem
BEGIN:STANDARD
DTSTART:20151025T020000
TZOFFSETFROM:+0300
TZOFFSETTO:+0200
TZNAME:IST
END:STANDARD
BEGIN:DAYLIGHT
DTSTART:20160325T020000
TZOFFSETFROM:+0200
TZOFFSETTO:+0300
TZNAME:IDT
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:calendar.44820.field_date.0@mathematics.huji.ac.il
DTSTAMP:20191117T010224Z
CREATED:20171116T060001Z
DESCRIPTION:Date: \n\n12:00pm to 1:00pm\n\n\n\n\nSee also: Groups & Dynam
ics\, Events & Seminars\, SeminarsLocation: \n\nEinstein 110\n\n\nConsider
a sequence of random walks on $\mathbb{Z}/p\mathbb{Z}$ with symmetric gen
erating sets $A= A(p)$. I will describe known and new results regarding th
e mixing time and cut-off. For instance\, if the sequence $|A(p)|$ is bou
nded then the cut-off phenomenon does not occur\, and more precisely I giv
e a lower bound on the size of the cut-off window in terms of $|A(p)|$. A
natural conjecture from random walk on a graph is that the total variation
mixing time is bounded by maximum degree times diameter squared. I prove
this conjecture in the context of random walk on the Cayley graph $(\math
bb{Z}/p\mathbb{Z}\, A)$. I also study the typical and worst case behavior
of random walk with random generating set chosen uniformly from among all
sets of a given size. Time permitting I will also describe the mixing an
alysis of the walk generated by the powers of 2 less than p\, which has fe
atures similar to random walk on the hypercube. \n\n Export\n \n\n \nsu
bscribe iCal
DTSTART;TZID=Asia/Jerusalem:20151217T120000
DTEND;TZID=Asia/Jerusalem:20151217T130000
LAST-MODIFIED:20180114T202901Z
SUMMARY:Groups & dynamics: Robert Hough (IAS) - Mixing and cut-off on cycli
c groups
URL;TYPE=URI:https://mathematics.huji.ac.il/event/groups-dynamics-robert-ho
ugh-ias-mixing-and-cut-cyclic-groups
END:VEVENT
END:VCALENDAR