BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//University of California\, Berkeley//UCB Events Calendar//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VTIMEZONE
TZID:America/Los_Angeles
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
DTSTART:19701029T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
BEGIN:DAYLIGHT
DTSTART:19700402T020000
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20171102T035135Z
DTSTART;TZID=America/Los_Angeles:20171108T151000
DTEND;TZID=America/Los_Angeles:20171108T160000
TRANSP:OPAQUE
SUMMARY:Self-avoiding polygons and walks: counting\, joining and closing.
UID:113106-ucb-events-calendar@berkeley.edu
ORGANIZER;CN="UC Berkeley Calendar Network":
LOCATION:1011 Evans Hall
DESCRIPTION:Alan Hammond\, U.C. Berkeley\n\nSelf-avoiding walk of length n on the integer lattice Z^d is the uniform measure on nearest-neighbour walks in Z^d that begin at the origin and are of length n. If such a walk closes\, which is to say that the walk's endpoint neighbours the origin\, it is natural to complete the missing edge connecting this endpoint and the origin. The result of doing so is a self-avoiding polygon. We investigate the numbers of self-avoiding walks\, polygons\, and in particular the "closing" probability that a length n self-avoiding walk is closing. Developing a method (the "snake method") employed in joint work with Hugo Duminil-Copin\, Alexander Glazman and Ioan Manolescu that provides closing probability upper bounds by constructing sequences of laws on self-avoiding walks conditioned on increasing severe avoidance constraints\, we show that the closing probability is at most n^{-1/2 + o(1)} in any dimension at least two. Developing a quite different method of polygon joining employed by Madras in 1995 to show a lower bound on the deviation exponent for polygon number\, we also provide new bounds on this exponent. We further make use of the snake method and polygon joining technique at once to prove an upper bound\, valid subsequentially\, on the closing probability of the form n^{-4/7 + o(1)} in the two-dimensional setting.
URL:http://events.berkeley.edu/index.php/calendar/sn/pubaff.html?event_ID=113106&view=preview
SEQUENCE:0
CLASS:PUBLIC
CREATED:20171102T035135Z
LAST-MODIFIED:20171102T035135Z
X-MICROSOFT-CDO-BUSYSTATUS:BUSY
X-MICROSOFT-CDO-INSTTYPE:0
X-MICROSOFT-CDO-IMPORTANCE:1
X-MICROSOFT-CDO-OWNERAPPTID:-1
END:VEVENT
END:VCALENDAR