The Self-Avoiding Walk

  • Madras N
  • Slade G
N/ACitations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The self-avoiding walk is a mathematical model that has important applications in statistical mechanics and polymer science. In spite of its simple definition - a lattice path that does not visit the same site more than once - it is difficult to analyze mathematically. This largely self-contained monograph provides the first unified account of the known rigorous results for the self-avoiding walk, with particular emphasis on its critical behavior. Its goals are to give an account of the current mathematical understanding of the model, to indicate some of the applications of the concept in physics and in chemistry, and to give an introduction to some of the nonrigorous methods used in those fields. Topics covered in the book include: the lace expansion and its application to the self-avoiding walk in more than four dimensions, where most issues are now resolved; an introduction to the nonrigourous scaling theory; classical work of Hammersley and others; a new exposition of Kesten's pattern theorem and its consequences; a discussion of the decay of the two-point function and its relation to probabilistic renewal theory; analysis of Monte Carlo methods that have been used to study the self-avoiding walk; the role of the self-avoiding walk in physical and chemical applications. Methods from combinatorics, probability theory, analysis, and mathematical physics play important roles. The book is highly accessible to both professional and graduate students in mathematics, physics and chemistry.

Cite

CITATION STYLE

APA

Madras, N., & Slade, G. (1996). The Self-Avoiding Walk. The Self-Avoiding Walk. Birkhäuser Boston. https://doi.org/10.1007/978-1-4612-4132-4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free