Scale-free Monte Carlo method for calculating the critical exponent of self-avoiding walks
DOI10.1088/1751-8121/AA7231zbMATH Open1368.82008arXiv1701.08415OpenAlexW2587502657MaRDI QIDQ5348309FDOQ5348309
Authors: Nathan Clisby
Publication date: 15 August 2017
Published in: Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1701.08415
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
Monte Carlo methods (65C05) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41) Bifurcations in context of PDEs (35B32)
Cites Work
- Critical exponents of theN-vector model
- Efficient implementation of the Pivot algorithm for self-avoiding walks
- The pivot algorithm: a highly efficient Monte Carlo method for the self-avoiding walk.
- Three-dimensional terminally attached self-avoiding walks and bridges
- Critical exponents, hyperscaling, and universal amplitude ratios for two- and three-dimensional self-avoiding walks.
- Self-avoiding walk enumeration via the lace expansion
- Enumeration of self-avoiding walks on the square lattice
- A faster implementation of the pivot algorithm for self-avoiding walks
- Algebraic techniques for enumerating self-avoiding walks on the square lattice
- Self-avoiding walks on the simple cubic lattice
- Join-and-Cut algorithm for self-avoiding walks with variable length and free endpoints
- Cut-and-permute algorithm for self-avoiding walks in the presence of surfaces
- Calculation of the connective constant for self-avoiding walks via the pivot algorithm
- Exact enumeration of self-avoiding walks
Cited In (19)
- New Monte Carlo algorithms for interacting self-avoiding walks
- The critical \(O(N)\) CFT: methods and conformal data
- 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
- Lattice star and acyclic branched polymer vertex exponents in \(3d\)
- 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
- 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
- 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
- Universal features of complex n-block copolymers
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)