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

Self-avoiding walk in ∞ + 1 dimensions

Add to your list(s) Download to your calendar using vCal

  • UserTom Hutchcroft (University of Cambridge)
  • ClockTuesday 16 January 2018, 15:00-16:00
  • HouseWatson 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.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

Talks@bham, University of Birmingham. Contact Us | Help and Documentation | Privacy and Publicity.
talks@bham is based on talks.cam from the University of Cambridge.