Join-and-Cut algorithm for self-avoiding walks with variable length and free endpoints

DOI10.1007/BF01049027zbMath0925.82100WikidataQ56893572 ScholiaQ56893572MaRDI QIDQ1203237

Sergio Caracciolo, Andrea Pelissetto, Alan D. Sokal

Publication date: 27 September 1994

Published in: Journal of Statistical Physics (Search for Journal in Brave)

zbMATH Keywords

critical exponent; pivot algorithm

Mathematics Subject Classification ID

65C05: Monte Carlo methods

82B41: Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics

82B20: Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics

82B27: Critical phenomena in equilibrium statistical mechanics

Related Items

Critical phenomena and renormalization-group theory

Cites Work

• 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
• Exponential convergence to equilibrium for a class of random-walk models
• Markov chain models - rarity and exponentiality
• The pivot algorithm: a highly efficient Monte Carlo method for the self-avoiding walk.
• Absence of mass gap for a class of stochastic contour models.
• Nonlocal Monte Carlo algorithm for self-avoiding walks with fixed endpoints.
• The pivot algorithm and polygons: results on the FCC lattice
• Maximum likelihood estimation of order m for stationary stochastic processes
• General Irreducible Markov Chains and Non-Negative Operators
• Self-avoiding random loops
• Maximum likelihood estimates of incorrect Markov models for time series and the derivation of AIC
• On the rate of convergence in the central limit theorem for Markov-chains