𝔖 Scriptorium
✦   LIBER   ✦

πŸ“

The Self-Avoiding Walk

✍ Scribed by Neal Madras, Gordon Slade (auth.)


Publisher
BirkhΓ€user Basel
Year
2013
Tongue
English
Leaves
435
Series
Modern BirkhΓ€user Classics
Edition
1
Category
Library

⬇  Acquire This Volume

No coin nor oath required. For personal study only.

✦ Synopsis


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. The Self-Avoiding Walk 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 nonrigorous 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 professionals and graduate students in mathematics, physics, and chemistry.​

✦ Table of Contents


Front Matter....Pages i-xvi
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; Combinatorics; Mathematical Applications in the Physical Sciences; Mathematical Physics


πŸ“œ SIMILAR VOLUMES


The Self-Avoiding Walk
✍ Neal Madras, Gordon Slade (auth.) πŸ“‚ Library πŸ“… 1996 πŸ› BirkhΓ€user Basel 🌐 English

<p>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Β­

Self-avoiding walk
✍ Neal Madras πŸ“‚ Library πŸ“… 1996, 2013 πŸ› Birkhauser 🌐 English

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 Language of Self-Avoiding Walks Conn
✍ Lindorfer, Christian πŸ“‚ Library πŸ“… 2018 πŸ› Springer 🌐 English

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

Walking the Talk: How Transactional Anal
✍ Giles Barrow, Trudi Newton πŸ“‚ Library πŸ“… 2006 🌐 English

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