Abstract
We implement parallel versions of the generalized atmospheric Rosenbluth methods 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 σ_{f} for f stars, and the entropic exponent γ_{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 [B. Duplantier, J. Stat. Phys. 54, 581 (1989)JSTPBS0022-471510.1007/BF01019770]γ_{G}-1=[under ∑]f≥1m_{f}σ_{f}for several acyclic branched networks in two dimensions.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
