High-dimensional graphical networks of self-avoiding walks

M Holmes, Antal A. Jarai, A Sakai, G Slade

Research output: Contribution to journalArticle

6 Citations (Scopus)

Abstract

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.
Original languageEnglish
Pages (from-to)77-114
Number of pages38
JournalCanadian Journal of Mathematics - Journal Canadien de Mathematiques
Volume56
Publication statusPublished - Feb 2004

Fingerprint Dive into the research topics of 'High-dimensional graphical networks of self-avoiding walks'. Together they form a unique fingerprint.

Cite this