Scale-free Monte Carlo method for calculating the critical exponent of self-avoiding walks
From MaRDI portal
Publication:5348309
Abstract: We implement a scale-free version of the pivot algorithm and use it to sample pairs of three-dimensional self-avoiding walks, for the purpose of efficiently calculating an observable that corresponds to the probability that pairs of self-avoiding walks remain self-avoiding when they are concatenated. We study the properties of this Markov chain, and then use it to find the critical exponent for self-avoiding walks to unprecedented accuracy. Our final estimate for is .
Recommendations
- The pivot algorithm: a highly efficient Monte Carlo method for the self-avoiding walk.
- Critical exponents, hyperscaling, and universal amplitude ratios for two- and three-dimensional self-avoiding walks.
- Join-and-Cut algorithm for self-avoiding walks with variable length and free endpoints
- Canonical Monte Carlo determination of the connective constant of self-avoiding walks
- Calculation of the connective constant for self-avoiding walks via the pivot algorithm
Cites work
- A faster implementation of the pivot algorithm for self-avoiding walks
- Algebraic techniques for enumerating self-avoiding walks on the square lattice
- Calculation of the connective constant for self-avoiding walks via the pivot algorithm
- Critical exponents of theN-vector model
- Critical exponents, hyperscaling, and universal amplitude ratios for two- and three-dimensional self-avoiding walks.
- Cut-and-permute algorithm for self-avoiding walks in the presence of surfaces
- Efficient implementation of the Pivot algorithm for self-avoiding walks
- Enumeration of self-avoiding walks on the square lattice
- Exact enumeration of self-avoiding walks
- Join-and-Cut algorithm for self-avoiding walks with variable length and free endpoints
- Self-avoiding walk enumeration via the lace expansion
- Self-avoiding walks on the simple cubic lattice
- The pivot algorithm: a highly efficient Monte Carlo method for the self-avoiding walk.
- Three-dimensional terminally attached self-avoiding walks and bridges
Cited in
(20)- The critical \(O(N)\) CFT: methods and conformal data
- Universal features of complex n-block copolymers
- New Monte Carlo algorithms for interacting self-avoiding walks
- The pivot algorithm: a highly efficient Monte Carlo method for the self-avoiding walk.
- Weakly self-avoiding walk on a high-dimensional torus
- Self-avoiding walk, spin systems and renormalization
- Continued functions and perturbation series: simple tools for convergence of diverging series in \(\mathrm{O}(n)\)-symmetric \(\phi^4\) field theory at weak coupling limit
- Lattice star and acyclic branched polymer vertex exponents in \(3d\)
- Exact enumeration of self-avoiding walks on BCC and FCC lattices
- Critical exponents, hyperscaling, and universal amplitude ratios for two- and three-dimensional self-avoiding walks.
- The nonperturbative functional renormalization group and its applications
- Critical exponents from the weak-coupling, strong-coupling and large-order parametrization of the hypergeometric \((_{k+1}F_k)\) approximants
- Determination of the exponent for SAWs on the two-dimensional Manhattan lattice
- Monte Carlo study of four-dimensional self-avoiding walks of up to one billion steps
- Critical properties of semi-flexible polymer chains situated within the simple cubic lattice
- Correction-to-scaling exponents for two-dimensional self-avoiding walks
- Self-similar sequence transformation for critical exponents
- New scaling laws for self-avoiding walks: bridges and worms
- On the existence of critical exponents for self-avoiding walks
- Brownian non-Gaussian diffusion of self-avoiding walks
This page was built for publication: Scale-free Monte Carlo method for calculating the critical exponent \(\gamma\) of self-avoiding walks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5348309)
