Scale-free Monte Carlo method for calculating the critical exponentγof self-avoiding walks
From MaRDI portal
Publication:5348309
DOI10.1088/1751-8121/aa7231zbMath1368.82008arXiv1701.08415OpenAlexW2587502657MaRDI QIDQ5348309
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
Monte Carlo methods (65C05) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41) Bifurcations in context of PDEs (35B32)
Related Items (15)
Lattice star and acyclic branched polymer vertex exponents in 3d ⋮ The critical \(O(N)\) CFT: methods and conformal data ⋮ Weakly self-avoiding walk on a high-dimensional torus ⋮ Critical properties of semi-flexible polymer chains situated within the simple cubic lattice ⋮ The nonperturbative functional renormalization group and its applications ⋮ Exact enumeration of self-avoiding walks on BCC and FCC lattices ⋮ New scaling laws for self-avoiding walks: bridges and worms ⋮ 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 ⋮ Monte Carlo study of four-dimensional self-avoiding walks of up to one billion steps ⋮ Critical exponents from the weak-coupling, strong-coupling and large-order parametrization of the hypergeometric \((_{k+1}F_k)\) approximants ⋮ Self-similar sequence transformation for critical exponents ⋮ Self-avoiding walk, spin systems and renormalization ⋮ Brownian non-Gaussian diffusion of self-avoiding walks ⋮ Universal features of complex n-block copolymers ⋮ On the existence of critical exponents for self-avoiding walks
Cites Work
- Join-and-Cut algorithm for self-avoiding walks with variable length and free endpoints
- Critical exponents, hyperscaling, and universal amplitude ratios for two- and three-dimensional self-avoiding walks.
- A faster implementation of the pivot algorithm for self-avoiding walks
- Cut-and-permute algorithm for self-avoiding walks in the presence of surfaces
- The pivot algorithm: a highly efficient Monte Carlo method for the self-avoiding walk.
- Calculation of the connective constant for self-avoiding walks via the pivot algorithm
- Three-dimensional terminally attached self-avoiding walks and bridges
- Enumeration of self-avoiding walks on the square lattice
- Exact enumeration of self-avoiding walks
- Critical exponents of theN-vector model
- Self-avoiding walks on the simple cubic lattice
- Algebraic techniques for enumerating self-avoiding walks on the square lattice
- Self-avoiding walk enumeration via the lace expansion
- Efficient implementation of the Pivot algorithm for self-avoiding walks
This page was built for publication: Scale-free Monte Carlo method for calculating the critical exponentγof self-avoiding walks
