Connective constant for a weighted self-avoiding walk on Z^2
From MaRDI portal
Publication:894515
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.
Recommendations
- The connective constant of the honeycomb lattice equals \(\sqrt{2+\sqrt 2}\)
- Self-avoiding walks on lattice strips
- A numerical adaptation of self-avoiding walk identities from the honeycomb to other 2D lattices
- Self-avoiding walk on \(\mathbb{Z}^2\) with Yang-Baxter weights: universality of critical fugacity and 2-point function
- Weighted self-avoiding walks
Cited in
(6)- On the probability that self-avoiding walk ends at a given point
- Weighted self-avoiding walks
- Self-avoiding walk on \(\mathbb{Z}^2\) with Yang-Baxter weights: universality of critical fugacity and 2-point function
- The connective constant of the honeycomb lattice equals \(\sqrt{2+\sqrt 2}\)
- Lectures on the Ising and Potts models on the hypercubic lattice
- Macroscopic loops in the loop \(O(n)\) model at Nienhuis' critical point
This page was built for publication: Connective constant for a weighted self-avoiding walk on \(\mathbb{Z}^2\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q894515)