Connective constant for a weighted self-avoiding walk on $\mathbb{Z}^2$
Probability
2016-01-05 v2 Mathematical Physics
Combinatorics
math.MP
Abstract
We consider a self-avoiding walk on the dual lattice. This walk can traverse the same square twice but cannot cross the same edge more than once. The weight of each square visited by the walk depends on the way the walk passes through it and the weight of the whole walk is calculated as a product of these weights. We consider a family of critical weights parametrized by angle . For , this can be mapped to the self-avoiding walk on the honeycomb lattice. The connective constant in this case was proved to be equal to by Duminil-Copin and Smirnov in \cite{DS10}. We generalize their result.
Keywords
Cite
@article{arxiv.1402.5376,
title = {Connective constant for a weighted self-avoiding walk on $\mathbb{Z}^2$},
author = {Alexander Glazman},
journal= {arXiv preprint arXiv:1402.5376},
year = {2016}
}
Comments
13 pages, 5 figures