Upper bounds for the connective constant of weighted self-avoiding walks

Fuente: arXiv
Saved in:
Bibliographic Details
Main Author: He, Qidong
Format: Preprint
Published: 2025
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866908754417549312
author He, Qidong
author_facet He, Qidong
contents Building on a work by Alm, we consider a model of weighted self-avoiding walks on a lattice and develop a method for computing upper bounds on the corresponding weighted connective constant, which we implement in a publicly available software package. The upper bounds are obtained as the dominant eigenvalues of certain matrices and provide detailed information about the convergence of the model's multivariate generating function. We discuss potential applications of our results to developing Peierls-type estimates for anisotropic contour models in statistical physics, generalizing a technique recently introduced by Fahrbach--Randall.
format Preprint
id arxiv_https___arxiv_org_abs_2508_01993
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Upper bounds for the connective constant of weighted self-avoiding walks
He, Qidong
Probability
Statistical Mechanics
Building on a work by Alm, we consider a model of weighted self-avoiding walks on a lattice and develop a method for computing upper bounds on the corresponding weighted connective constant, which we implement in a publicly available software package. The upper bounds are obtained as the dominant eigenvalues of certain matrices and provide detailed information about the convergence of the model's multivariate generating function. We discuss potential applications of our results to developing Peierls-type estimates for anisotropic contour models in statistical physics, generalizing a technique recently introduced by Fahrbach--Randall.
title Upper bounds for the connective constant of weighted self-avoiding walks
topic Probability
Statistical Mechanics
url https://arxiv.org/abs/2508.01993