<p><p>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 path on a lattice that does not visit the same site more than onceβit is difficult to analyze mathematically. <i>The Self-Avoiding Wa
The Self-Avoiding Walk
β Scribed by Neal Madras, Gordon Slade (auth.)
- Publisher
- BirkhΓ€user Basel
- Year
- 1996
- Tongue
- English
- Leaves
- 433
- Series
- Probability and Its Applications
- Edition
- 1
- Category
- Library
No coin nor oath required. For personal study only.
β¦ Synopsis
A self-avoiding walk is a path on a lattice that does not visit the same site more than once. In spite of this simple definition, many of the most basic questions about this model are difficult to resolve in a mathematically rigorous fashion. In particular, we do not know much about how far an nΒ step self-avoiding walk typically travels from its starting point, or even how many such walks there are. These and other important questions about the self-avoiding walk remain unsolved in the rigorous mathematical sense, although the physics and chemistry communities have reached consensus on the answers by a variety of nonrigorous methods, including computer simulations. But there has been progress among mathematicians as well, much of it in the last decade, and the primary goal of this book is to give an account of the current state of the art as far as rigorous results are concerned. A second goal of this book is to discuss some of the applications of the self-avoiding walk in physics and chemistry, and to describe some of the nonrigorous methods used in those fields. The model originated in chemΒ istry several decades ago as a model for long-chain polymer molecules. Since then it has become an important model in statistical physics, as it exhibits critical behaviour analogous to that occurring in the Ising model and related systems such as percolation.
β¦ Table of Contents
Front Matter....Pages i-xiv
Introduction....Pages 1-33
Scaling, polymers and spins....Pages 35-55
Some combinatorial bounds....Pages 57-76
Decay of the two-point function....Pages 77-117
The lace expansion....Pages 119-169
Above four dimensions....Pages 171-228
Pattern theorems....Pages 229-255
Polygons, slabs, bridges and knots....Pages 257-279
Analysis of Monte Carlo methods....Pages 281-364
Related topics....Pages 365-374
Back Matter....Pages 375-425
β¦ Subjects
Probability Theory and Stochastic Processes
π SIMILAR VOLUMES
Preface.- Introduction.- Scaling, polymers and spins.- Some combinatorial bounds.- Decay of the two-point function.- The lace expansion.- Above four dimensions.- Pattern theorems.- Polygons, slabs, bridges and knots.- Analysis of Monte Carlo methods.- Related Topics.- Random walk.- Proof of the ren
The connective constant of a quasi-transitive infinite graph is a measure for the asymptotic growth rate of the number of self-avoiding walks of length n from a given starting vertex. On edge-labelled graphs the formal language of self-avoiding walks is generated by a formal grammar, which can be us
356 pages : 21 cm
Helping teachers to counter challengning behavior, absenteeism and bullying, this book shows how Transactional Analysis can benefit the individual, class and whole school across the early years, primary and secondary phases. Walk the Talk includes an itnor duction to TA concepts and a map to direct