Enumeration of closed random walks in the square lattice according to their areas

preprint2010arXivOpen access

Abstract

We study the area distribution of closed walks of length nn, beginning and ending at the origin. The concept of area of a walk in the square lattice is generalized and the usefulness of the new concept is demonstrated through a simple argument. It is concluded that the number of walks of length nn and area ss equals to the coefficient of zsz^s in the expression (x+x−1+y+y−1)n(x+x^{-1}+y+y^{-1})^n, where the calculations are performed in a special group ring R[x,y,z]R[x,y,z]. A polynomial time algorithm for calculating these values, is then concluded. Finally, the provided algorithm and the results of implementation are compared with previous works.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.