High-dimensional graphical networks of self-avoiding walks
Holmes, M., Jarai, A. A., Sakai, A. and Slade, G., 2004. High-dimensional graphical networks of self-avoiding walks. Canadian Journal of Mathematics - Journal Canadien de Mathematiques, 56, pp. 77-114.
Related documents:This repository does not currently have the full-text of this item.
You may be able to access a copy if URLs are provided below.
We use the lace expansion to analyse networks of mutually-avoiding self-avoiding walks, having the topology of a graph. The networks are defined in terms of spread-out self-avoiding walks that are permitted to take large steps. We study the asymptotic behaviour of networks in the limit of widely separated network branch points, and prove Gaussian behaviour for sufficiently spread-out networks on Zd in dimensions d>4.
|Creators||Holmes, M., Jarai, A. A., Sakai, A. and Slade, G.|
|Departments||Faculty of Science > Mathematical Sciences|
Actions (login required)