We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure [email protected]
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
Providing a detailed and pedagogical account of the rapidly-growing field of computational statistical physics, this book covers both the theoretical foundations of equilibrium and non-equilibrium statistical physics, and also modern, computational applications such as percolation, random walks, magnetic systems, machine learning dynamics, and spreading processes on complex networks. A detailed discussion of molecular dynamics simulations is also included, a topic of great importance in biophysics and physical chemistry. The accessible and self-contained approach adopted by the authors makes this book suitable for teaching courses at graduate level, and numerous worked examples and end of chapter problems allow students to test their progress and understanding.
Complex networks datasets often come with the problem of missing information: interactions data that have not been measured or discovered, may be affected by errors, or are simply hidden because of privacy issues. This Element provides an overview of the ideas, methods and techniques to deal with this problem and that together define the field of network reconstruction. Given the extent of the subject, the authors focus on the inference methods rooted in statistical physics and information theory. The discussion is organized according to the different scales of the reconstruction task, that is, whether the goal is to reconstruct the macroscopic structure of the network, to infer its mesoscale properties, or to predict the individual microscopic connections.
In the preceding chapters we have dealt extensively with equilibrium properties of a wide variety of models and materials. We have emphasized the importance of insuring that equilibrium has been reached, and we have discussed the manner in which the system may approach the correct distribution of states, i.e. behavior before it comes to equilibrium. This latter topic has been treated from the perspective of helping us understand the difficulties of achieving equilibrium. The theory of equilibrium behavior is well developed and in many cases there is extensive, reliable experimental information available.
In this chapter we want to introduce simple importance sampling Monte Carlo techniques as applied in statistical physics and which can be used for the study of phase transitions at finite temperature. We shall discuss details, algorithms, and potential sources of difficulty using the Ising model as a paradigm. It should be understood, however, that virtually all of the discussion of the application to the Ising model is relevant to other models as well, and a few such examples will also be discussed. Other models as well as sophisticated approaches to the Ising model will be discussed in later chapters. The Ising model is one of the simplest lattice models which one can imagine, and its behavior has been studied for a century. The simple Ising model consists of spins which are confined to the sites of a lattice and which may have only the values +1 or −1.
Lattice gauge theories have played an important role in the theoretical description of phenomena in particle physics, and Monte Carlo methods have proven to be very effective in their study. In the lattice gauge approach a field theory is defined on a lattice by replacing partial derivatives in the Lagrangian by finite difference operators. For physical systems a quantum field theory on a four-dimensional space–time lattice is used, but simpler models in lower dimensions have also been studied in the hope of gaining some understanding of more complicated models as well as for the development of computational techniques. The present chapter is not at all intended to give a thorough treatment, but rather to convey the flavor of the subject to the non-expert.
In a Monte Carlo simulation we attempt to follow the ‘time dependence’ of a model for which change, or growth, does not proceed in some rigorously predefined fashion (e.g. according to Newton’s equations of motion) but rather in a stochastic manner which depends on a sequence of random numbers which is generated during the simulation. With a second, different sequence of random numbers the simulation will not give identical results but will yield values which agree with those obtained from the first sequence to within some ‘statistical error’. A very large number of different problems fall into this category: in percolation an empty lattice is gradually filled with particles by placing a particle on the lattice randomly with each ‘tick of the clock’. Lots of questions may then be asked about the resulting ‘clusters’ which are formed of neighboring occupied sites. Particular attention has been paid to the determination of the ‘percolation threshold’, i.e. the critical concentration of occupied sites for which an ‘infinite percolating cluster’ first appears. A percolating cluster is one which reaches from one boundary of a (macroscopic) system to the opposite one. The properties of such objects are of interest in the context of diverse physical problems such as conductivity of random mixtures, flow through porous rocks, behavior of dilute magnets, etc. Another example is diffusion limited aggregation (DLA), where a particle executes a random walk in space, taking one step at each time interval, until it encounters a ‘seed’ mass and sticks to it. The growth of this mass may then be studied as many random walkers are turned loose. The ‘fractal’ properties of the resulting object are of real interest, and while there is no accepted analytical theory of DLA to date, computer simulation is the method of choice. In fact, the phenomenon of DLA was first discovered by Monte Carlo simulation.
In the preceding chapters we described the application of Monte Carlo methods in numerous areas that can be clearly identified as belonging to physics. Although the exposition was far from complete, it should have sufficed to give the reader an appreciation of the broad impact that Monte Carlo studies has already had in statistical physics. A more recent occurrence is the application of these methods in non-traditional areas of physics related research. More explicitly, we mean subject areas that are not normally considered to be physics at all but which make use of physics principles at their core. In some cases physicists have entered these arenas by introducing quite simplified models that represent a ‘physicist’s view’ of a particular problem. Often such descriptions are oversimplified, but the hope is that some essential insight can be gained as is the case in many traditional physics studies. (A provocative perspective of the role of statistical physics outside physics has been presented by Stauffer (2004).) In other cases, however, Monte Carlo methods are being applied by non-physicists (or ‘recent physicists’) to problems that, at best, have a tenuous relationship to physics. This chapter is to serve as a brief glimpse of applications of Monte Carlo methods ‘outside’ physics. The number of such studies will surely grow rapidly; and even now, we wish to emphasize that we will make no attempt to be complete in our treatment.
The concepts of scaling and universality presented in Chapter 2 can be given a concrete foundation through the use of renormalization group (RG) theory. The fundamental physical ideas underlying RG theory were introduced by Kadanoff (1971) in terms of a simple coarse-graining approach, and a mathematical basis for this viewpoint was completed by Wilson (1971). Kadanoff divided the system up into cells of characteristic size ba, where a is the nearest neighbor spacing, and ba < ξ , where ξ is the correlation length of the system (see Fig. 9.1). The singular part of the free energy of the system can then be expressed in terms of cell variables instead of the original site variables, i.e.
Within this book we have attempted to elucidate the essential features of Monte Carlo simulations and their application to problems in statistical physics. We have attempted to give the reader practical advice as well as to present theoretically based background for the methodology of the simulations as well as the tools of analysis. New Monte Carlo methods will be devised and will be used with more powerful computers, but we believe that the advice given to the reader in Section 4.8 will remain valid.
In the previous chapters of this text we have examined a wide variety of Monte Carlo methods in depth. Although these are exceedingly useful for many different problems in statistical physics, there are some circumstances in which the systems of interest are not well suited to Monte Carlo study. Indeed there are some problems which may not be treatable by stochastic methods at all, since the time-dependent properties as constrained by deterministic equations of motion are the subject of the study. The purpose of this chapter is thus to provide a very brief overview of some of the other important simulation techniques in statistical physics. Our goal is not to present a complete list of other methods or even a thorough discussion of these methods which are included, but rather to offer sufficient background to enable the reader to compare some of the different approaches and better understand the strengths and limitations of Monte Carlo simulations.
In this chapter we shall review some of the basic features of thermodynamics and statistical mechanics which will be used later in this book when devising simulation methods and interpreting results. Many good books on this subject exist and we shall not attempt to present a complete treatment. This chapter is hence not intended to replace any textbook for this important field of physics but rather to ‘refresh’ the reader’s knowledge and to draw attention to notions in thermodynamics and statistical mechanics which will henceforth be assumed to be known throughout this book.
In most of the discussion presented so far in this book, the quantum character of atoms and electrons has been ignored. The Ising spin models have been an exception, but since the Ising Hamiltonian is diagonal (in the absence of a transverse magnetic field), all energy eigenvalues are known and the Monte Carlo sampling can be carried out just as in the case of classical statistical mechanics. Furthermore, the physical properties are in accord with the third law of thermodynamics for Ising-type Hamiltonians (e.g. entropy S and specific heat vanish for temperature T → 0, etc.) in contrast to the other truly classical models dealt with in previous chapters (e.g. classical Heisenberg spin models, classical fluids and solids, etc.) which have many unphysical low temperature properties.
Advances in simulational methods sometimes have their origin in unusual places; such is the case with an entire class of methods which attempt to beat critical slowing down in spin models on lattices by flipping correlated clusters of spins in an intelligent way instead of simply attempting single spin-flips. The first steps were taken by Fortuin and Kasteleyn (Kasteleyn and Fortuin, 1969; Fortuin and Kasteleyn, 1972), who showed that it was possible to map a ferromagnetic Potts model onto a corresponding percolation model. The reason that this observation is so important is that in the percolation problem states are produced by throwing down particles, or bonds, in an uncorrelated fashion; hence there is no critical slowing down. In contrast, as we have already mentioned, the q-state Potts model when treated using standard Monte Carlo methods suffers from slowing down. (Even for large q where the transition is first order, the time scales can become quite long.) The Fortuin–Kasteleyn transformation thus allows us to map a problem with slow critical relaxation into one where such effects are largely absent. (As we shall see, not all slowing down is eliminated, but the problem is reduced quite dramatically.)
The combination of improved experimental capability, great advances in computer performance, and the development of new algorithms from computer science have led to quite sophisticated methods for the study of certain biomolecules, in particular of folded protein structures. One such technique, called ‘threading’, picks out small pieces of the primary structure of a protein whose structure is unknown and examines extensive databases of known protein structures to find similar pieces of primary structure. One then guesses that this piece will have the same folded structure as that in the known structure. Since pieces do not all fit together perfectly, an effective force field is used to ‘optimize’ the resultant structure, and Monte Carlo methods have already begun to play a role in this approach. (There are substantial similarities to ‘homology modeling’ approaches to the same, or similar, problems.) Of course, the certainty that the structure is correct comes primarily from comparison with experimental structure determination of crystallized proteins. One limitation is thus that not all proteins can be crystallized, and, even if they can, there is no assurance that the structure will be the same in vivo. Threading algorithms have, in some cases, been extraordinarily successful, but since they do not make use of the interactions between atoms it would be useful to complement this approach by atomistic simulations. (For an introductory overview of protein structure prediction, see Wooley and Ye (2007).) Biological molecules are extremely large and complex; moreover, they are usually surrounded by a large number of water molecules. Thus, realistic simulations that include water explicitly and take into account polarization effects are inordinately difficult. There have also been many attempts to handle this task by means of molecular dynamics simulations, but the necessity of performing very long runs of very large systems makes it very difficult to reach equilibrium. A possible advance is the use of so-called accelerated molecular dynamics (Miao et al., ), and it has been suggested that this may help to understand ‘genetic engineering’ mechanisms (Palermo et al., ). However, there are many phenomena that involve large spatial and temporal scales so that the use of coarse-grained models may often be necessary (Hyeon and Thirumalai, ).