BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//talks.bham.ac.uk//v3//EN
BEGIN:VEVENT
CATEGORIES:Combinatorics and Probability Seminar
SUMMARY:Self-avoiding walk in ∞ + 1 dimensions - Tom Hutc
hcroft (University of Cambridge)
DTSTART:20180116T150000Z
DTEND:20180116T160000Z
UID:TALK3045AT
URL:/talk/index/3045
DESCRIPTION:A self-avoiding walk in a graph is a path that vis
its each vertex at most once. Given an infinite\,
vertex-transitive graph\, we are interested in the
following questions: \n\n1. How does the number o
f length-n self-avoiding walks started at the orig
in grow as a function of n?\n\n2. What does a typi
cal length-n self-avoiding walk look like?\n\nIn t
his talk\, I will show how these questions can be
addressed for certain nonamenable graphs\, with em
phasis on the product T x Z of a 3-regular tree T
with the integers Z.\n
LOCATION:Watson LTA
CONTACT:Allan Lo
END:VEVENT
END:VCALENDAR