Size Exponents of Branched Polymers/ Extension of the Isaacson-Lubensky Formula and the Application to Lattice Trees
Kazumi Suematsu, Haruo Ogura, Seiichi Inayama, and Toshihiko Okamoto

TL;DR
This paper extends the Isaacson-Lubensky formula to classify branched polymers' size exponents and applies it to lattice trees, revealing discrepancies due to architectural differences and proposing a mixture of isomers with an average size exponent.
Contribution
It generalizes the size exponent formula for branched polymers and applies it to lattice trees, providing insights into their structural differences and size scaling behavior.
Findings
Different formulae govern size exponents for two polymer categories.
Lattice trees exhibit a larger size exponent than predicted by simple models.
Lattice trees are a mixture of isomers with an average size exponent of approximately 0.32.
Abstract
Branched polymers can be classified into two categories that obey the different formulae: \begin{equation} \nu= \begin{cases} \hspace{1mm}\displaystyle\frac{2(1+\nu_{0})}{d+2} & \hspace{3mm}\mbox{for polymers with}\hspace{2mm}\displaystyle\nu_{0}\ge\frac{1}{d+1}\hspace{10mm}\text{(I)}\\[3mm] \hspace{5mm}2\nu_{0}& \hspace{3mm}\mbox{for polymers with}\hspace{2mm}\displaystyle\nu_{0}\le\frac{1}{d+1}\hspace{10mm}\text{(II)} \end{cases}\notag \end{equation} for the dilution limit in good solvents. The category II covers the exceptional polymers having fully expanded configurations. On the basis of these equalities, we discuss the size exponents of the nested architectures and the lattice trees. In particular, we compare our preceding result, , for the =2 polymer having with the numerical result, , for the lattice trees generated on the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTheoretical and Computational Physics · Markov Chains and Monte Carlo Methods · Graph theory and applications
