Connective constant for a weighted self-avoiding walk on Z2

Abstract

We consider a self-avoiding walk on the dual Z2 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 θ∈[π3,2π3]. For θ=π3, 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 2+2 by Duminil-Copin and Smirnov in DS10. We generalize their result.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…