University of Birmingham > Talks@bham > Combinatorics and Probability Seminar > Self-avoiding walk in ∞ + 1 dimensions

## Self-avoiding walk in ∞ + 1 dimensionsAdd to your list(s) Download to your calendar using vCal - Tom Hutchcroft (University of Cambridge)
- Tuesday 16 January 2018, 15:00-16:00
- Watson LTA.
If you have a question about this talk, please contact Allan Lo. A self-avoiding walk in a graph is a path that visits each vertex at most once. Given an infinite, vertex-transitive graph, we are interested in the following questions: 1. How does the number of length-n self-avoiding walks started at the origin grow as a function of n? 2. What does a typical length-n self-avoiding walk look like? In this talk, I will show how these questions can be addressed for certain nonamenable graphs, with emphasis on the product T x Z of a 3-regular tree T with the integers Z. This talk is part of the Combinatorics and Probability Seminar series. ## This talk is included in these lists:Note that ex-directory lists are not shown. |
## Other listsVirtual Harmonic Analysis Seminar Human Computer Interaction seminars Computer Science Distinguished Seminars## Other talksMachine Learning and Dynamical Systems meet in Reproducing Kernel Hilbert Spaces School Seminar From 2nd to 3rd generation GW detectors The imprint of their explosions: Using supernova remnants to understand stellar death |