The pivot algorithm: a highly efficient Monte Carlo method for the self-avoiding walk.
From MaRDI portal
Publication:1963611
DOI10.1007/BF01022990zbMath1084.82503WikidataQ29041043 ScholiaQ29041043MaRDI QIDQ1963611
Publication date: 2 February 2000
Published in: Journal of Statistical Physics (Search for Journal in Brave)
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (65)
Critical phenomena and renormalization-group theory ⋮ Molecular mobility with respect to accessible volume in Monte Carlo lattice model for polymers ⋮ Persistence length convergence and universality for the self-avoiding random walk ⋮ Monotonicity of the number of self-avoiding walks ⋮ Vortex phase transitions in \(2\frac 12\) dimensions ⋮ Stochastic enumeration method for counting NP-hard problems ⋮ Exponential convergence to equilibrium for a class of random-walk models ⋮ Dynamic critical behavior of the Swendsen-Wang algorithm for the three-dimensional Ising model ⋮ Hubbard model with Lüscher fermions ⋮ A Markov Chain Sampler for Plane Curves ⋮ Implementation and performance analysis of bridging Monte Carlo moves for off-lattice single chain polymers in globular states ⋮ Scale-free Monte Carlo method for calculating the critical exponentγof self-avoiding walks ⋮ Accelerating polymer simulation by means of tree data-structures and a parsimonious Metropolis algorithm ⋮ Automatic differentiation for error analysis of Monte Carlo data ⋮ A python program for the implementation of the \(\varGamma\)-method for Monte Carlo simulations ⋮ pyerrors: a python framework for error analysis of Monte Carlo data ⋮ Improved model for mixtures of polymers and hard spheres ⋮ Critical slowing down and error analysis in lattice QCD simulations ⋮ On fits to correlated and auto-correlated data ⋮ The strange quark mass and Lambda parameter of two flavor QCD ⋮ Probing the fuzzy sphere regularisation in simulations of the 3d \(\lambda\phi^4\) model ⋮ Exact sampling of self-avoiding paths via discrete Schramm-Loewner evolution ⋮ A review of Monte Carlo simulations of polymers with PERM ⋮ Dynamic critical behavior of the Chayes-Machta algorithm for the random-cluster model. I: Two dimensions ⋮ An ergodic algorithm for generating knots with a prescribed injectivity radius ⋮ The QCD sign problem and dynamical simulations of random matrices ⋮ Constrained random walks and vortex filaments in turbulence theory ⋮ Nonlocal Monte Carlo algorithm for self-avoiding walks with fixed endpoints. ⋮ Lattice QCD without topology barriers ⋮ Vortex equilibria in turbulence theory and quantum analogues ⋮ Self-avoiding walk in five or more dimensions. I: The critical behaviour ⋮ Optimized analysis of the critical behavior in polymer mixtures from Monte Carlo simulations ⋮ Join-and-Cut algorithm for self-avoiding walks with variable length and free endpoints ⋮ Efficiency of the incomplete enumeration algorithm for Monte-Carlo simulation of linear and branched polymers ⋮ Polymers with spatial or topological constraints: theoretical and computational results ⋮ The generation of random equilateral polygons ⋮ The Erdős--Nagy theorem and its ramifications ⋮ Monte Carlo errors with less errors ⋮ Average crossing number of Gaussian and equilateral chains with and without excluded volume ⋮ The HP model of protein folding: a challenging testing ground for Wang-Landau sampling ⋮ Critical dynamics of the three-dimensional Ising model: a Monte Carlo study ⋮ Critical dynamics of cluster algorithms in the dilute Ising model ⋮ Application of the multicanonical multigrid Monte Carlo method to the two-dimensional \(\varphi^4\)-model: autocorrelations and interface tension ⋮ Critical behaviour of self-avoiding walk in five or more dimensions ⋮ Reconfiguring convex polygons ⋮ Monte Carlo study of four-dimensional self-avoiding walks of up to one billion steps ⋮ Efficient implementation of the Pivot algorithm for self-avoiding walks ⋮ Lattice study of infrared behaviour in \(\mathrm{SU}(3)\) gauge theory with twelve massless flavours ⋮ Statistical topology of closed curves: Some applications in polymer physics ⋮ Machine learning as a universal tool for quantitative investigations of phase transitions ⋮ Finite size scaling in the planar Lebwohl-Lasher model ⋮ Two-dimensional oriented self-avoiding walks with parallel contacts ⋮ Monte Carlo Methods for Lattice Polygons ⋮ Dynamical critical behavior of the Swendson-Wang algorithm: The two-dimensional three-state Potts model revisited ⋮ Monte Carlo study of the \(\Theta\)-point for collapsing trees ⋮ Dynamical critical behavior of a Swendsen-Wang-type algorithm for the Ashkin-Teller model ⋮ Whole-plane self-avoiding walks and radial Schramm-Loewner evolution: a numerical study ⋮ A general limitation on Monte Carlo algorithms of the Metropolis type ⋮ Critical exponents, hyperscaling, and universal amplitude ratios for two- and three-dimensional self-avoiding walks. ⋮ Monte Carlo study of the interacting self-avoiding walk model in three dimensions. ⋮ A Monte Carlo algorithm for lattice ribbons. ⋮ Operator formalism for topology-conserving crossing dynamics in planar knot diagrams ⋮ Equilibrium statistics of a vortex filament with applications ⋮ Correction-to-scaling exponents for two-dimensional self-avoiding walks ⋮ Self-avoiding walks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Critical behavior of two-dimensional spin models and charge asymmetry in the Coulomb gas
- The diffusion of self-avoiding random walk in high dimensions
- Non-negative matrices and Markov chains. 2nd ed
- Estimates with Prescribed Variance Based on Two-Stage Sampling
- Confidence Interval Estimation Using Standardized Time Series
- Shuffling Cards and Stopping Times
- Monte-Carlo approximation algorithms for enumeration problems
- Detecting Initialization Bias in Simulation Output
- Some Inequalities for Reversible Markov Chains
- On the Number of Self-Avoiding Walks. II
- On the Number of Self-Avoiding Walks
- FURTHER RESULTS ON THE RATE OF CONVERGENCE TO THE CONNECTIVE CONSTANT OF THE HYPERCUBICAL LATTICE
This page was built for publication: The pivot algorithm: a highly efficient Monte Carlo method for the self-avoiding walk.