What is ... a self-avoiding random walk?

This page hosts information on Giovanni Conforti's talk "What is ... a self-avoiding random walk?" at the "What is ...?" seminar. The talk will take place on Friday, July 5, 1:00pm at the BMS Loft at Urania. This talk will help you better understand the talk by Mireille Bousquet-Melou, which will start at 2pm.

Abstract

In this talk we will give an informal introduction to random walks on graphs and see how typical quantities of interest can be computed with the help of the Markov property.

We will also see how, in the case of the self avoiding random walk, very basic questions remain unanswered and the Markov property, in the usual sense, is lost.

Motivating examples from polymer science and particular graphs and lattices where the self avoiding random walks have been intensively studied will be presented.

Comments

 
Topic revision: r1 - 03 Jul 2013, MimiTsuruga
 
  • Printable version of this topic (p) Printable version of this topic (p)