The Statistical Mechanics Of Interacting Walks Polygons Animals And Vesicles

The self-avoiding walk is a classical model in statistical mechanics, probability theory and mathematical physics. It is also a simple model of polymer entropy which is useful in modelling phase behaviour in polymers. This monograph provides an authoritative examination of interacting self-avoiding walks, presenting aspects of the thermodynamic limit, phase behaviour, scaling and critical exponents for lattice polygons, lattice animals and surfaces. It also includes a comprehensive account of constructive methods in models of adsorbing, collapsing, and pulled walks, animals and networks, and for models of walks in confined geometries. Additional topics include scaling, knotting in lattice polygons, generating function methods for directed models of walks and polygons, and an introduction to the Edwards model. This essential second edition includes recent breakthroughs in the field, as well as maintaining the older but still relevant topics. New chapters include an expanded presentation of directed models, an exploration of methods and results for the hexagonal lattice, and a chapter devoted to the Monte Carlo methods.

The self-avoiding walk is a classical model in statistical mechanics, probability theory and mathematical physics. It is also a simple model of polymer entropy which is useful in modelling phase behaviour in polymers. This monograph provides an authoritative examination of interacting self-avoiding walks, presenting aspects of the thermodynamic limit, phase behaviour, scaling and critical exponents for lattice polygons, lattice animals and surfaces. It also includes a comprehensive account of constructive methods in models of adsorbing, collapsing, and pulled walks, animals and networks, and for models of walks in confined geometries. Additional topics include scaling, knotting in lattice polygons, generating function methods for directed models of walks and polygons, and an introduction to the Edwards model. This essential second edition includes recent breakthroughs in the field, as well as maintaining the older but still relevant topics. New chapters include an expanded presentation of directed models, an exploration of methods and results for the hexagonal lattice, and a chapter devoted to the Monte Carlo methods.

The problem of counting the number of self-avoiding polygons on a square grid, - therbytheirperimeterortheirenclosedarea,is aproblemthatis soeasytostate that, at ?rst sight, it seems surprising that it hasn’t been solved. It is however perhaps the simplest member of a large class of such problems that have resisted all attempts at their exact solution. These are all problems that are easy to state and look as if they should be solvable. They include percolation, in its various forms, the Ising model of ferromagnetism, polyomino enumeration, Potts models and many others. These models are of intrinsic interest to mathematicians and mathematical physicists, but can also be applied to many other areas, including economics, the social sciences, the biological sciences and even to traf?c models. It is the widespread applicab- ity of these models to interesting phenomena that makes them so deserving of our attention. Here however we restrict our attention to the mathematical aspects. Here we are concerned with collecting together most of what is known about polygons, and the closely related problems of polyominoes. We describe what is known, taking care to distinguish between what has been proved, and what is c- tainlytrue,but has notbeenproved. Theearlierchaptersfocusonwhatis knownand on why the problems have not been solved, culminating in a proof of unsolvability, in a certain sense. The next chapters describe a range of numerical and theoretical methods and tools for extracting as much information about the problem as possible, in some cases permittingexactconjecturesto be made.

This is a book written primarily for graduate students and early researchers in the fields of Analysis and Partial Differential Equations (PDEs). Coverage of the material is essentially self-contained, extensive and novel with great attention to details and rigour. The strength of the book primarily lies in its clear and detailed explanations, scope and coverage, highlighting and presenting deep and profound inter-connections between different related and seemingly unrelated disciplines within classical and modern mathematics and above all the extensive collection of examples, worked-out and hinted exercises. There are well over 700 exercises of varying level leading the reader from the basics to the most advanced levels and frontiers of research. The book can be used either for independent study or for a year-long graduate level course. In fact it has its origin in a year-long graduate course taught by the author in Oxford in 2004-5 and various parts of it in other institutions later on. A good number of distinguished researchers and faculty in mathematics worldwide have started their research career from the course that formed the basis for this book.

Polymer chains that interact with themselves and/or with their environment are fascinating objects, displaying a range of interesting physical and chemical phenomena. The focus in this monograph is on the mathematical description of some of these phenomena, with particular emphasis on phase transitions as a function of interaction parameters, associated critical behavior and space-time scaling. Topics include: self-repellent polymers, self-attracting polymers, polymers interacting with interfaces, charged polymers, copolymers near linear or random selective interfaces, polymers interacting with random substrate and directed polymers in random environment. Different techniques are exposed, including the method of local times, large deviations, the lace expansion, generating functions, the method of excursions, ergodic theory, partial annealing estimates, coarse-graining techniques and martingales. Thus, this monograph offers a mathematical panorama of polymer chains, which even today holds plenty of challenges.

The lace expansion is a powerful and flexible method for understanding the critical scaling of several models of interest in probability, statistical mechanics, and combinatorics, above their upper critical dimensions. These models include the self-avoiding walk, lattice trees and lattice animals, percolation, oriented percolation, and the contact process. This volume provides a unified and extensive overview of the lace expansion and its applications to these models.