






















The connective constant $μ(G)$ of a graph $G$ is the asymptotic growth rate of the number $σ_{n}$ of self-avoiding walks of length $n$ in $G$ from a given vertex. We prove a formula for the connective constant for free products of quasi-transitive graphs and show that $σ_{n}\sim A_{G} μ(G)^{n}$ for some constant $A_{G}$ that depends on $G$. In the case of finite products $μ(G)$ can be calculated explicitly and is shown to be an algebraic number.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。