Numerical estimates of square lattice star vertex exponents

Abstract

We implement parallel versions of the GARM and Wang-Landau algorithms for stars and for acyclic uniform branched networks in the square lattice. These are models of monodispersed branched polymers, and we estimate the star vertex exponents ${\sigma }_f$ for $f$-stars, and the entropic exponent ${\gamma }_{\mathcal{G}}$ for networks with comb and brush connectivity in two dimensions. Our results verify the predicted (but not rigorously proven) exact values of the vertex exponents and we test the scaling relation [5] $${\gamma }_{\mathcal{G}}-1=\sum _{f\ge 1}{m}_f{\sigma }_f$$ for the branched networks in two dimensions.

References in corpus (13)

• An efficient, multiple range random walk algorithm to calculate the density of states
• Understanding and Improving the Wang-Landau Algorithm
• A review of Monte Carlo simulations of polymers with PERM
• Scaling of Star Polymers with one to 80 Arms
• Exact enumeration of self-avoiding walks
• Correction-to-scaling exponents for two-dimensional self-avoiding walks
• A new transfer-matrix algorithm for exact enumerations: Self-avoiding polygons on the square lattice
• Optimal Modification Factor and Convergence of the Wang-Landau Algorithm
• Calculation of the connective constant for self-avoiding walks via the pivot algorithm
• Scale-free Monte Carlo method for calculating the critical exponent $\gamma$ of self-avoiding walks
• On the growth constant for square-lattice self-avoiding walks
• Parallel PERM
• Statistical Mechanics of Confined Polymer Networks

Cited by in corpus (2)

• Lattice star and acyclic branched polymer vertex exponents in 3d
• Entropic exponents of grafted lattices stars