Upper Bounds for the Connective Constant of Self-Avoiding Walks

DOI10.1017/S0963548300000547zbMath0793.60082OpenAlexW2005105063MaRDI QIDQ4290083

Sven Erick Alm

Publication date: 11 August 1994

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548300000547

zbMATH Keywords

self-avoiding walkstriangular latticenumerical application

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Statistical mechanics of polymers (82D60)

Related Items

Spatial mixing and the connective constant: optimal bounds, Unnamed Item, Matching measure, Benjamini-Schramm convergence and the monomer-dimer free energy, The Self-Avoiding-Walk and Percolation Critical Points in High Dimensions, Improved mixing condition on the grid for counting and sampling independent sets, Self-testing algorithms for self-avoiding walks, Self avoiding walk trees and laces, Phase Coexistence for the Hard-Core Model on ℤ², Several constants arising in statistical mechanics, Self-avoiding walks

Cites Work

• Lower bound for the connective constant of a self-avoiding walk on a square lattice
• Self-avoiding walks on oriented square lattices
• On the Number of Self-Avoiding Walks