Self-avoiding walks

From MaRDI portal





Self-avoiding walks are discrete paths without self-intersections, and play an important role in polymer science and statistical mechanics. This introductory review paper discusses the basic properties of self-avoiding walks on the integer lattice \(\mathbb{Z}^ d\), with emphasis on the asymptotic behaviour of the number of \(n\)-step self-avoiding walks and of the mean-square displacement. The critical exponents governing this asymptotic behaviour are described. Monte Carlo methods for analyzing self-avoiding walks are discussed. Lattice trees, lattice animals and percolation are briefly mentioned.




Cited in
(46)








This page was built for publication: Self-avoiding walks

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