Canonical Monte Carlo determination of the connective constant of self-avoiding walks
From MaRDI portal
Publication:4450101
Recommendations
Cited in
(18)- New Monte Carlo algorithms for interacting self-avoiding walks
- A Monte Carlo study of non-trapped self-avoiding walks
- Exact enumeration and Monte Carlo results for self-avoiding walks in a slab
- Scale-free Monte Carlo method for calculating the critical exponent \(\gamma\) of self-avoiding walks
- Scaling of the atmosphere of self-avoiding walks
- Calculation of the connective constant for self-avoiding walks via the pivot algorithm
- The fixed irreducible bridge ensemble for self-avoiding walks
- Phase transitions in a linear self-interacting polymer on FCC lattice using flat energy interacting growth walk algorithm
- Self-avoiding walks and polygons on the triangular lattice
- Critical properties of semi-flexible polymer chains situated within the simple cubic lattice
- Weakly directed self-avoiding walks
- Monte Carlo Methods for Lattice Polygons
- Generalized atmospheric sampling of self-avoiding walks
- Scaling of self-avoiding walks in high dimensions.
- Statistical analysis and Monte Carlo simulation of growing self-avoiding walks on percolation
- Generalized atmospheric sampling of knotted polygons
- Phase diagram of inhomogeneous percolation with a defect plane
- Self-avoiding walks on the simple cubic lattice
This page was built for publication: Canonical Monte Carlo determination of the connective constant of self-avoiding walks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4450101)