Self-Avoiding Walks on Hyperbolic Graphs

From MaRDI portal





The authors study self-avoiding walks (SAW) on hyperbolic graphs \({\mathcal H}(v,f)\) [cf. \textit{E. Swierczak} and \textit{A. J. Guttmann}, J. Phys. A. Math. Gen. 25, No. 23, 7485--7500 (1996; Zbl 0905.60043)]. Define the connective constant for SAWs as \(\mu_w =\limsup_{N\to\infty}(c_N)^{1/N}\) where \(c_N\) is the number of \(N\)-step SAWs starting from the origin. It is proved here that on all graphs with \((v-2)(f-2)>4\): (1) there are exponentially fewer \(N\)-step self avoiding polygons (SAPs) than there are \(N\)-step SAWs; (2) \(c_N\sim A\mu_w{}^N\,N^{\gamma-1}\) and \(\gamma = 1\); and (3) the average end-to-end distance of an \(N\)-step SAW is approximately proportional to \(N\), which means that another critical exponent \(\nu =1\). These results are in good agreement with the numerical results given in the literature cited above.




Cited in
(27)








This page was built for publication: Self-Avoiding Walks on Hyperbolic Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5696362)