Calculation of the connective constant for self-avoiding walks via the pivot algorithm
From MaRDI portal
Publication:2839458
DOI10.1088/1751-8113/46/24/245001zbMath1269.82027arXiv1302.2106OpenAlexW1963509022MaRDI QIDQ2839458
Publication date: 11 July 2013
Published in: Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1302.2106
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (13)
Lattice star and acyclic branched polymer vertex exponents in 3d ⋮ Monte Carlo simulation of 3-star lattice polymers pulled from an adsorbing surface ⋮ Scale-free Monte Carlo method for calculating the critical exponentγof self-avoiding walks ⋮ Growing self avoiding walk trees ⋮ The distribution of first hitting times of randomwalks on Erdős–Rényi networks ⋮ Critical properties of semi-flexible polymer chains situated within the simple cubic lattice ⋮ Two-sided prudent walks: a solvable non-directed model of polymer adsorption ⋮ Partition and generating function zeros in adsorbing self-avoiding walks ⋮ New scaling laws for self-avoiding walks: bridges and worms ⋮ Critical scaling of lattice polymers confined to a box without endpoint restriction ⋮ Brownian non-Gaussian diffusion of self-avoiding walks ⋮ Universal features of complex n-block copolymers ⋮ Supermultiplicative relations in models of interacting self-avoiding walks and polygons
This page was built for publication: Calculation of the connective constant for self-avoiding walks via the pivot algorithm
