Metraipolis › archive › dc_dafcbf30acb7
SAWs, trails, kites, patterns — arXiv:2611.00816
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.00816
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-03T11:35:17.263Z
- SHA-256 of the archived text
be0d870057ab6fe0f1744d78ff8b52d8ffada218bb37114ee6159c81902770fd- Stable URL of this page
https://metraipolis.com/documento/dc_dafcbf30acb7
How to cite
SAWs, trails, kites, patterns — arXiv:2611.00816 — arXiv (en), https://arxiv.org/abs/2611.00816 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_dafcbf30acb7 (Metraipolis archive dc_dafcbf30acb7, sha256 be0d870057ab6fe0f1744d78ff8b52d8ffada218bb37114ee6159c81902770fd)
BibTeX
@misc{dcdafcbf30acb7,
title = {SAWs, trails, kites, patterns — arXiv:2611.00816},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.00816},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_dafcbf30acb7; sha256 be0d870057ab6fe0f1744d78ff8b52d8ffada218bb37114ee6159c81902770fd},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.00816. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
A self-avoiding walk (SAW) on a vertex-transitive graph $G$ is a path that visits no vertex more than once; a trail is a path that traverses no edge more than once. The number of $n$-step self-avoiding walks (respectively, trails) starting at a given vertex has order $\mu(G)^n$ (respectively, $\mu_{\text{T}}(G)^n$), where $\mu(G)$ is called the connective constant and $\mu_{\text{T}}(G)$ is the trail constant. It is immediate that $\mu=\mu_{\text{T}}$ if $G$ either has degree $3$ or less, or is a tree. We prove a necessary and sufficient condition for the strict inequality $\mu < \mu_{\text{T}}$ if $G$ has degree $4$ or more and is not a tree, and in addition $G$ possesses a so-called height function. This condition is satisfied whenever the height function is transitive. The core of the proof is a pattern theorem for graphs possessing height functions, and this is achieved using an unpublished argument for ${\Bbb Z}^d$ by Hammersley, reported by Janse van Rensburg et al. (J. Stat. Phys. 85, 1996, 103--130). Some ancillary results are included concerning SAWs on the line graph of $G$.
Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.PR, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO) ; Mathematical Physics (math-ph); Probability (math.PR).
Pagina del lavoro: https://arxiv.org/abs/2611.00816 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-03T11:04:52.291Z dalla pagina https://arxiv.org/list/math.PR/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).