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 $\mathbb{Z}^d$ in dimensions $d>4$.

MSC Classifications:

82B41, 60K35 show english descriptions Random walks, random surfaces, lattice animals, etc. [See also 60G50, 82C41]
Interacting random processes; statistical mechanics type models; percolation theory [See also 82B43, 82C43] 82B41 - Random walks, random surfaces, lattice animals, etc. [See also 60G50, 82C41]
60K35 - Interacting random processes; statistical mechanics type models; percolation theory [See also 82B43, 82C43]

top of page | contact us | social media | privacy | site map