Skip to main content

All Questions

Filter by
Sorted by
Tagged with
3 votes
1 answer
108 views

Has this random process been studied on grid graphs?

As an offshoot of a different discussion I got curious about (uniform) random spanning trees on grid graphs (torus graphs in particular, to avoid having to think about edge effects) and what their ...
Steven Stadnicki's user avatar
3 votes
1 answer
853 views

Transience of self avoiding random walks on $\mathbb{Z}^d$

I'm finishing up a masters thesis in computer science and want to say a bit in the introduction about self-avoiding walks. My thesis looks at a random process which arose in computer science and my ...
David White's user avatar
  • 30.3k
11 votes
3 answers
665 views

Limit shape for fixed-perimeter lattice polygons

Let $P$ be a simple polygon defined by $n$ unit-length segments connecting lattice points of $\mathbb{Z}^2$. I have two operations that preserve the perimeter of $P$. The first is the "pop" of a ...
Joseph O'Rourke's user avatar
14 votes
1 answer
781 views

Perimeters of random-walk polygons

I have a random walk on $\mathbb{Z}^2$ that takes a step with equal probability in the three directions that avoid retracing the previous step. The walk proceeds until it returns to a lattice point ...
Joseph O'Rourke's user avatar