Self-avoiding walk on the complete graph

From MaRDI portal
Publication:826469

DOI10.2969/JMSJ/82588258zbMATH Open1456.82451arXiv1904.11149OpenAlexW3012133888MaRDI QIDQ826469FDOQ826469


Authors: Gordon Slade Edit this on Wikidata


Publication date: 4 January 2021

Published in: Journal of the Mathematical Society of Japan (Search for Journal in Brave)

Abstract: There is an extensive literature concerning self-avoiding walk on infinite graphs, but the subject is relatively undeveloped on finite graphs. The purpose of this paper is to elucidate the phase transition for self-avoiding walk on the simplest finite graph: the complete graph. We make the elementary observation that the susceptibility of the self-avoiding walk on the complete graph is given exactly in terms of the incomplete gamma function. The known asymptotic behaviour of the incomplete gamma function then yields a complete description of the finite-size scaling of the self-avoiding walk on the complete graph. As a basic example, we compute the limiting distribution of the length of a self-avoiding walk on the complete graph, in subcritical, critical, and supercritical regimes. This provides a prototype for more complex unsolved problems such as the self-avoiding walk on the hypercube or on a high-dimensional torus.


Full work available at URL: https://arxiv.org/abs/1904.11149




Recommendations




Cites Work


Cited In (11)





This page was built for publication: Self-avoiding walk on the complete graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q826469)