Borel-type bounds for the self-avoiding walk connective constant
DOI10.1088/1751-8113/43/23/235001zbMATH Open1196.82086arXiv0911.5163OpenAlexW3103449087MaRDI QIDQ3569964FDOQ3569964
Authors: B. Graham
Publication date: 22 June 2010
Published in: Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0911.5163
Recommendations
- New lower bounds on the self-avoiding-walk connective constant
- Upper Bounds for the Connective Constant of Self-Avoiding Walks
- Lower bound on the connective constant for square lattice self-avoiding walks
- Improved upper bounds for self-avoiding walks in \(\mathbb Z^d\)
- New upper bounds for the connective constants of self-avoiding walks
Interacting random processes; statistical mechanics type models; percolation theory (60K35) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41)
Cited In (5)
- New lower bounds on the self-avoiding-walk connective constant
- A general bridge theorem for self-avoiding walks
- Expansion for the critical point of site percolation: the first three terms
- Self‐avoiding walk on the hypercube
- Expansion in high dimension for the growth constants of lattice trees and lattice animals
This page was built for publication: Borel-type bounds for the self-avoiding walk connective constant
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3569964)