A self-avoiding walk with attractive interactions (Q1849670): Difference between revisions

The author studies a self-avoiding walk in \(\mathbb{Z}^d\) with small attractions. The main objective is to show that the lace expansion can also be used for the self-avoiding walk when the walk experiences small nearest-neighbor attractions. The model is given by random walks \(w=(w_1,\dots,w_n)\) with \( w_t\in\mathbb{Z}^d \), where their connectivity \(C_n(x) \) between \(0\) and \(x\) is given with an additional attractive nearest-neighbor interaction term. The first result of the article gives bounds for the total sum \(c_n=\sum_{x}C_n(x) \) for small enough nearest-neighbor interactions, i.e. it is shown that \( (c_n)^{1/n} \) is convergent, and bounds on the limit are given. The proof of this is given in Section 2 and provides first bounds on lace expansion terms and then uses the tools of \textit{R. van der Hofstad} and \textit{G. Slade} [Probab. Theory Relat. Fields 122, No.~3, 389-430 (2002; Zbl 1002.60095)]. The second result gives under the assumptions of the first one and for \( d\geq 5 \) the behavior of the mean-square displacement and an explicit expression for the diffusion constant. Sections 3 and 4 are devoted to the proof of this second result. The proof uses the lace expansion, which is introduced in detail in Section 3, and results of van der Hofstad and Slade (loc. cit.).