加载中…
We consider spread-out models of the self-avoiding walk and its finite-memory version, known as the memory- walk, which prohibits loops whose length is at most , in dimensions . The critical point is defined as the radius of convergence of the generating function for each model. It is known that the critical point of the memory- walk is non-decreasing in and converges to that of the self-avoiding walk as tends to infinity. In this paper, we study the rate at which the critical point of the memory- walk converges to that of the self-avoiding walk and show that the order is . The proof relies on the lace expansion, introduced by Brydges and Spencer.

生成讲解博客的中文版本

生成AI智能校验的中文版本