Join-and-Cut algorithm for self-avoiding walks with variable length and free endpoints
From MaRDI portal
Monte Carlo methods (65C05) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Critical phenomena in equilibrium statistical mechanics (82B27)
Recommendations
- Cut-and-permute algorithm for self-avoiding walks in the presence of surfaces
- An optimal algorithm to generate extendable self-avoiding walks in arbitrary dimension
- On self-avoiding polygons and walks: the snake method via polygon joining
- Calculation of the connective constant for self-avoiding walks via the pivot algorithm
- Nonlocal Monte Carlo algorithm for self-avoiding walks with fixed endpoints.
- A lower bound for the end-to-end distance of self-avoiding walk
- Asymptotically faster algorithm for counting self-avoiding walks and self-avoiding polygons
- Self-avoiding walks and connective constants
- A faster implementation of the pivot algorithm for self-avoiding walks
- Extendable self-avoiding walks
Cites work
- scientific article; zbMATH DE number 3701980 (Why is no real title available?)
- scientific article; zbMATH DE number 3533576 (Why is no real title available?)
- scientific article; zbMATH DE number 3274494 (Why is no real title available?)
- scientific article; zbMATH DE number 3277086 (Why is no real title available?)
- scientific article; zbMATH DE number 3296351 (Why is no real title available?)
- scientific article; zbMATH DE number 3303654 (Why is no real title available?)
- Absence of mass gap for a class of stochastic contour models.
- 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
- General Irreducible Markov Chains and Non-Negative Operators
- Markov chain models - rarity and exponentiality
- Maximum likelihood estimates of incorrect Markov models for time series and the derivation of AIC
- Maximum likelihood estimation of order m for stationary stochastic processes
- Nonlocal Monte Carlo algorithm for self-avoiding walks with fixed endpoints.
- On the rate of convergence in the central limit theorem for Markov-chains
- Self-avoiding random loops
- The pivot algorithm and polygons: results on the FCC lattice
- The pivot algorithm: a highly efficient Monte Carlo method for the self-avoiding walk.
Cited in
(5)- Cut-and-permute algorithm for self-avoiding walks in the presence of surfaces
- Scale-free Monte Carlo method for calculating the critical exponent \(\gamma\) of self-avoiding walks
- Critical phenomena and renormalization-group theory
- An optimal algorithm to generate extendable self-avoiding walks in arbitrary dimension
- Nonlocal Monte Carlo algorithm for self-avoiding walks with fixed endpoints.
This page was built for publication: Join-and-Cut algorithm for self-avoiding walks with variable length and free endpoints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1203237)
