Monte Carlo study of four-dimensional self-avoiding walks of up to one billion steps

DOI10.1007/S10955-018-2049-2MaRDI QIDQ1785584zbMATH OpenOpenAlexWikidataFDO

Authors Nathan Clisby

Publication date 1 October 2018

Published in Journal of Statistical Physics (Search for Journal in Brave)

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

zbMATH Keywords

Monte Carlopivot algorithmpolymerself-avoiding walk

Mathematics Subject Classification ID

Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Renormalization group methods in equilibrium statistical mechanics (82B28) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41) Statistical mechanics of polymers (82D60)

Abstract: We study self-avoiding walks on the four-dimensional hypercubic lattice via Monte Carlo simulations of walks with up to one billion steps. We study the expected logarithmic corrections to scaling, and find convincing evidence in support the scaling form predicted by the renormalization group, with an estimate for the power of the logarithmic factor of 0.2516(14), which is consistent with the predicted value of 1/4. We also characterize the behaviour of the pivot algorithm for sampling four-dimensional self-avoiding walks, and conjecture that the probability of a pivot move being successful for an $N$-step walk is $O([logN{]}^{-1/4})$.

Recommendations

• Scaling of self-avoiding walks in high dimensions.
• The pivot algorithm: a highly efficient Monte Carlo method for the self-avoiding walk.
• Critical exponents, hyperscaling, and universal amplitude ratios for two- and three-dimensional self-avoiding walks.
• Correction-to-scaling exponents for two-dimensional self-avoiding walks
• On continuous-time self-avoiding random walk in dimension four

Cites work

• A faster implementation of the pivot algorithm for self-avoiding walks
• Critical two-point function of the 4-dimensional weakly self-avoiding walk
• Efficient implementation of the Pivot algorithm for self-avoiding walks
• Finite-order correlation length for four-dimensional weakly self-avoiding walk and \({|\varphi|^4}\) spins
• scientific article; zbMATH DE number 201032 (Why is no real title available?)
• Lectures on self-avoiding walks
• Logarithmic correction for the susceptibility of the 4-dimensional weakly self-avoiding walk: a renormalisation group analysis
• Monte Carlo study of the interacting self-avoiding walk model in three dimensions.
• Scale-free Monte Carlo method for calculating the critical exponent \(\gamma\) of self-avoiding walks
• Scaling of self-avoiding walks in high dimensions.
• Self-avoiding walk enumeration via the lace expansion
• Self-avoiding walk in five or more dimensions. I: The critical behaviour
• Self-avoiding walks in four dimensions: logarithmic corrections
• THE LACE EXPANSION FOR SELF-AVOIDING WALK IN FIVE OR MORE DIMENSIONS
• The pivot algorithm: a highly efficient Monte Carlo method for the self-avoiding walk.

Cited in

(2)

• Scaling of self-avoiding walks in high dimensions.
• Monte Carlo studies of three-dimensional two-step restricted self-avoiding walks

This page was built for publication: Monte Carlo study of four-dimensional self-avoiding walks of up to one billion steps

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