arXiv · 1906.06126
The length of self-avoiding walks on the complete graph
Abstract
We study the variable-length ensemble of self-avoiding walks on the complete graph. We obtain the leading order asymptotics of the mean and variance of the walk length, as the number of vertices goes to infinity. Central limit theorems for the walk length are also established, in various regimes of fugacity. Particular attention is given to sequences of fugacities that converge to the critical point, and the effect of the rate of convergence of these fugacity sequences on the limiting walk length is studied in detail. Physically, this corresponds to studying the asymptotic walk length on a general class of pseudocritical points.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Youjin Deng, Timothy M Garoni, Jens Grimm, Abrahim Nasrawi, Zongzheng Zhou. 2019-06-14. The length of self-avoiding walks on the complete graph. https://doi.org/10.1088/1742-5468%2Fab3da3
Cite the original work for its findings. Save a collection to share your selection of sources.