Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
Home
Hostname: page-component-59b7f5684b-s82fj Total loading time: 0.302 Render date: 2022-09-30T03:02:31.903Z Has data issue: true Feature Flags: { "shouldUseShareProductTool": true, "shouldUseHypothesis": true, "isUnsiloEnabled": true, "useRatesEcommerce": false, "displayNetworkTab": true, "displayNetworkMapGraph": false, "useSa": true } hasContentIssue true
  • English
Canadian Journal of Mathematics Canadian Journal of Mathematics

Article contents

High-Dimensional Graphical Networks of Self-Avoiding Walks

Published online by Cambridge University Press:  20 November 2018

Mark Holmes ,
Antal A. Járai ,
Akira Sakai  and
Gordon Slade
Mark Holmes
Affiliation:
Department of Mathematics, University of British Columbia, Vancouver, BC, V6T 1Z2 e-mail: holmes@math.ubc.ca, tetsu@math.ubc.ca, slade@math.ubc.ca
Antal A. Járai
Affiliation:
Centrum voor Wiskunde en Informatica, P. O. Box 94079, NL-1090 GB Amsterdam, The Netherlands e-mail: Antal.Jarai@cwi.nl
Akira Sakai
Affiliation:
Centrum voor Wiskunde en Informatica, P. O. Box 94079, NL-1090 GB Amsterdam, The Netherlands e-mail: Antal.Jarai@cwi.nl
Gordon Slade
Affiliation:
Department of Mathematics, University of British Columbia, Vancouver, BC, V6T 1Z2 e-mail: holmes@math.ubc.ca, tetsu@math.ubc.ca, slade@math.ubc.ca
Rights & Permissions[Opens in a new window]

Abstract

HTML view is not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

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$.

Keywords

82B4160K35
Type
Research Article
Information
Canadian Journal of Mathematics , Volume 56 , Issue 1 , 01 February 2004 , pp. 77 - 114
Copyright
Copyright © Canadian Mathematical Society 2004

References

[1] Brydges, D. C. and Spencer, T., Self-avoiding walk in 5 or more dimensions. Commun. Math. Phys. 97(1985), 125–148.CrossRefGoogle Scholar
[2] Duplantier, B., Statistical mechanics of polymer networks of any topology. J. Statist. Phys. 54(1989), 581–680.CrossRefGoogle Scholar
[3] Hara, T., Critical two-point functions for nearest-neighbour high-dimensional self-avoiding walk and percolation. In preparation.Google Scholar
[4] Hara, T., van der Hofstad, R. and G. Slade, Critical two-point functions and the lace expansion for spread-out high-dimensional percolation and related models. Ann. Probab. 31(2003), 349–408.Google Scholar
[5] van der Hofstad, R. and Slade, G., The lace expansion on a tree with application to networks of self-avoiding walks. Adv. Appl. Math. 30(2003), 471–528.CrossRefGoogle Scholar
You have Access
4
Cited by

Save article to Kindle

To save this article to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

High-Dimensional Graphical Networks of Self-Avoiding Walks
Available formats
×

Save article to Dropbox

To save this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you used this feature, you will be asked to authorise Cambridge Core to connect with your Dropbox account. Find out more about saving content to Dropbox.

High-Dimensional Graphical Networks of Self-Avoiding Walks
Available formats
×

Save article to Google Drive

To save this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you used this feature, you will be asked to authorise Cambridge Core to connect with your Google Drive account. Find out more about saving content to Google Drive.

High-Dimensional Graphical Networks of Self-Avoiding Walks
Available formats
×
×

Reply to: Submit a response

Please enter your response.

Your details

Please enter a valid email address.

Conflicting interests

Do you have any conflicting interests? *