Join-and-Cut algorithm for self-avoiding walks with variable length and free endpoints
type: Item
instance of: scholarly article
title: Join-and-Cut algorithm for self-avoiding walks with variable length and free endpoints
zbMATH Open document ID: 0925.82100
DOI: 10.1007/BF01049027
author: Sergio Caracciolo
author: Andrea Pelissetto
author: Alan D. Sokal
published in: Journal of Statistical Physics
publication date: 1994-09-27T00:00:00Z
Mathematics Subject Classification ID: 82B41
Mathematics Subject Classification ID: 82B80
Mathematics Subject Classification ID: 65C05
Mathematics Subject Classification ID: 82B20
Mathematics Subject Classification ID: 82B27
zbMATH DE Number: 111971
zbMATH Keywords: pivot algorithm
zbMATH Keywords: critical exponent
Wikidata QID: Q56893572
MaRDI profile type: Publication
cites work: The pivot algorithm: a highly efficient Monte Carlo method for the self-avoiding walk.
cites work: Nonlocal Monte Carlo algorithm for self-avoiding walks with fixed endpoints.
cites work: Self-avoiding random loops
cites work: The pivot algorithm and polygons: results on the FCC lattice
cites work: Exponential convergence to equilibrium for a class of random-walk models
cites work: Absence of mass gap for a class of stochastic contour models.
cites work: Q4110164
cites work: Markov chain models - rarity and exponentiality
cites work: Q5579577
cites work: Q5585020
cites work: Q5561562
cites work: Q3894827
cites work: Maximum likelihood estimates of incorrect Markov models for time series and the derivation of AIC
cites work: Maximum likelihood estimation of order m for stationary stochastic processes
cites work: Q5560061
cites work: On the rate of convergence in the central limit theorem for Markov-chains
cites work: General Irreducible Markov Chains and Non-Negative Operators
cites work: Critical behavior of two-dimensional spin models and charge asymmetry in the Coulomb gas
Recommended article: Cut-and-permute algorithm for self-avoiding walks in the presence of surfaces
Recommended article: An optimal algorithm to generate extendable self-avoiding walks in arbitrary dimension
Recommended article: On self-avoiding polygons and walks: the snake method via polygon joining
Recommended article: Calculation of the connective constant for self-avoiding walks via the pivot algorithm
Recommended article: Nonlocal Monte Carlo algorithm for self-avoiding walks with fixed endpoints.
Recommended article: A Lower Bound for the End-to-End Distance of the Self-Avoiding Walk
Recommended article: Asymptotically faster algorithm for counting self-avoiding walks and self-avoiding polygons
Recommended article: Self-Avoiding Walks and Connective Constants
Recommended article: A faster implementation of the pivot algorithm for self-avoiding walks
Recommended article: Extendable self-avoiding walks
description: scientific article; zbMATH DE number 111971