We review results concerning the critical behavior of spin systems at equilibrium. We
consider the Ising and the general O (N)-symmetric universality classes, including the N→ 0 …

This article reviews various methods for the Monte Carlo simulation of models for long
flexible polymer chains, namely self-avoiding random walks at various lattices. This problem …

The pivot algorithm is a dynamic Monte Carlo algorithm, first invented by Lal, which
generates self-avoiding walks (SAWs) in a canonical (fixed-N) ensemble with free endpoints …

We make a high-precision Monte Carlo study of two-and three-dimensional self-avoiding
walks (SAWs) of length up to 80,000 steps, using the pivot algorithm and the Karp-Luby …

Short single-stranded nucleic acids are ubiquitous in biological processes; understanding
their physical properties provides insights to nucleic acid folding and dynamics. We used …

We introduce a new Monte Carlo algorithm for the self-avoiding walk (SAW), and show that it
is particularly efficient in the critical region (long chains). We also introduce new and more …

hep-lat/9405016 17 May 1994 Contents Page 1 hep-lat/9405016 17 May 1994 MONTE
CARLO METHODS FOR THE SELF-AVOIDING WALK ALAN D. SOKAL Department of Physics …

We present explicit values of the mean square end‐to‐end distance< R 2> of a linear
flexible chain for all values of the excluded volume parameter z> 0 in space dimension 3 …

Establishing the degree of collapse of unfolded or disordered proteins is a fundamental
problem in biophysics, because of its relation to protein folding and to the function of …

The cell is a crowded environment where a relevant fraction of the available space is
occupied by proteins, nucleic acids, and metabolites. Here we discuss recent advancements …