Join-and-Cut algorithm for self-avoiding walks with variable length and free endpoints
From MaRDI portal
Publication:1203237
DOI10.1007/BF01049027zbMath0925.82100WikidataQ56893572 ScholiaQ56893572MaRDI QIDQ1203237
Alan D. Sokal, Sergio Caracciolo, Andrea Pelissetto
Publication date: 27 September 1994
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 (2)
Critical phenomena and renormalization-group theory ⋮ Scale-free Monte Carlo method for calculating the critical exponentγof self-avoiding walks
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
This page was built for publication: Join-and-Cut algorithm for self-avoiding walks with variable length and free endpoints
