Self-avoiding walk on the complete graph (Q826469)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Self-avoiding walk on the complete graph |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Self-avoiding walk on the complete graph |
scientific article |
Statements
Self-avoiding walk on the complete graph (English)
0 references
4 January 2021
0 references
The phase transition for self-avoiding walks on the complete graph is studied. It is found that the susceptibility, i.e., the generating function that counts the number of self-avoiding walks according to their length, can be expressed explicitly in terms of the incomplete gamma function. As long as the graph is finite, the susceptibility is just a polynomial. Therefore, the asymptotic behavior of the susceptibility is of interest, which is obtained from the asymptotic behavior of the incomplete gamma function. The latter has a transition in its asymptotic behavior, which in turn yields a phase transition for the susceptibility. As main result, a critical scaling window for this phase transition is identified, and the different behaviors are described that occur below, above, and within the critical window.
0 references
self-avoiding walk
0 references
incomplete gamma function
0 references
complete graph
0 references
phase transition
0 references
transition region
0 references
susceptibility
0 references
0.8495032787322998
0 references
0.8055357933044434
0 references
0.7739924788475037
0 references
0.7660221457481384
0 references