DiscoverCombinatorics and Statistical MechanicsPrudent and quasi-prudent self-avoiding walks and polygons
Prudent and quasi-prudent self-avoiding walks and polygons

Prudent and quasi-prudent self-avoiding walks and polygons

Update: 2008-05-08
Share

Description

Prudent self-avoiding walks and quasi-prudent self-avoiding walks are proper subsets of self-avoiding walks in dimension 2 or greater. Prudent SAW are not allowed to take a step in a direction which, if continued, would encounter a previously visited vertex. Quasi-prudent walks are self-avoiding walks where a step to a neighbouring vertex v can only be taken if there is a prudent way to escape from v (in other words, if v can be seen from infinity). Polygon versions of the walks can be defined as walks (prudent or quasi-prudent) which end at a vertex adjacent to their starting point.

A variety of results, both rigorous and numerical, will be given for these models, mainly for two-dimensional walks, but we also have some preliminary results for walks on a three-dimensional lattice.
Comments 
00:00
00:00
x

0.5x

0.8x

1.0x

1.25x

1.5x

2.0x

3.0x

Sleep Timer

Off

End of Episode

5 Minutes

10 Minutes

15 Minutes

30 Minutes

45 Minutes

60 Minutes

120 Minutes

Prudent and quasi-prudent self-avoiding walks and polygons

Prudent and quasi-prudent self-avoiding walks and polygons

Steve Greenham