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

Neal Madras, Alan D. Sokal

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 theoryMolecular mobility with respect to accessible volume in Monte Carlo lattice model for polymersPersistence length convergence and universality for the self-avoiding random walkMonotonicity of the number of self-avoiding walksVortex phase transitions in \(2\frac 12\) dimensionsStochastic enumeration method for counting NP-hard problemsExponential convergence to equilibrium for a class of random-walk modelsDynamic critical behavior of the Swendsen-Wang algorithm for the three-dimensional Ising modelHubbard model with Lüscher fermionsA Markov Chain Sampler for Plane CurvesImplementation and performance analysis of bridging Monte Carlo moves for off-lattice single chain polymers in globular statesScale-free Monte Carlo method for calculating the critical exponentγof self-avoiding walksAccelerating polymer simulation by means of tree data-structures and a parsimonious Metropolis algorithmAutomatic differentiation for error analysis of Monte Carlo dataA python program for the implementation of the \(\varGamma\)-method for Monte Carlo simulationspyerrors: a python framework for error analysis of Monte Carlo dataImproved model for mixtures of polymers and hard spheresCritical slowing down and error analysis in lattice QCD simulationsOn fits to correlated and auto-correlated dataThe strange quark mass and Lambda parameter of two flavor QCDProbing the fuzzy sphere regularisation in simulations of the 3d \(\lambda\phi^4\) modelExact sampling of self-avoiding paths via discrete Schramm-Loewner evolutionA review of Monte Carlo simulations of polymers with PERMDynamic critical behavior of the Chayes-Machta algorithm for the random-cluster model. I: Two dimensionsAn ergodic algorithm for generating knots with a prescribed injectivity radiusThe QCD sign problem and dynamical simulations of random matricesConstrained random walks and vortex filaments in turbulence theoryNonlocal Monte Carlo algorithm for self-avoiding walks with fixed endpoints.Lattice QCD without topology barriersVortex equilibria in turbulence theory and quantum analoguesSelf-avoiding walk in five or more dimensions. I: The critical behaviourOptimized analysis of the critical behavior in polymer mixtures from Monte Carlo simulationsJoin-and-Cut algorithm for self-avoiding walks with variable length and free endpointsEfficiency of the incomplete enumeration algorithm for Monte-Carlo simulation of linear and branched polymersPolymers with spatial or topological constraints: theoretical and computational resultsThe generation of random equilateral polygonsThe Erdős--Nagy theorem and its ramificationsMonte Carlo errors with less errorsAverage crossing number of Gaussian and equilateral chains with and without excluded volumeThe HP model of protein folding: a challenging testing ground for Wang-Landau samplingCritical dynamics of the three-dimensional Ising model: a Monte Carlo studyCritical dynamics of cluster algorithms in the dilute Ising modelApplication of the multicanonical multigrid Monte Carlo method to the two-dimensional \(\varphi^4\)-model: autocorrelations and interface tensionCritical behaviour of self-avoiding walk in five or more dimensionsReconfiguring convex polygonsMonte Carlo study of four-dimensional self-avoiding walks of up to one billion stepsEfficient implementation of the Pivot algorithm for self-avoiding walksLattice study of infrared behaviour in \(\mathrm{SU}(3)\) gauge theory with twelve massless flavoursStatistical topology of closed curves: Some applications in polymer physicsMachine learning as a universal tool for quantitative investigations of phase transitionsFinite size scaling in the planar Lebwohl-Lasher modelTwo-dimensional oriented self-avoiding walks with parallel contactsMonte Carlo Methods for Lattice PolygonsDynamical critical behavior of the Swendson-Wang algorithm: The two-dimensional three-state Potts model revisitedMonte Carlo study of the \(\Theta\)-point for collapsing treesDynamical critical behavior of a Swendsen-Wang-type algorithm for the Ashkin-Teller modelWhole-plane self-avoiding walks and radial Schramm-Loewner evolution: a numerical studyA general limitation on Monte Carlo algorithms of the Metropolis typeCritical 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 diagramsEquilibrium statistics of a vortex filament with applicationsCorrection-to-scaling exponents for two-dimensional self-avoiding walksSelf-avoiding walks



Cites Work


This page was built for publication: The pivot algorithm: a highly efficient Monte Carlo method for the self-avoiding walk.