Quenched Averages for self-avoiding walks and polygons on deterministic fractals
Sumedha, Deepak Dhar

TL;DR
This paper investigates self-avoiding walks and polygons on deterministic fractals, deriving exact recursion relations to compute quenched averages and revealing differences in exponents compared to annealed averages, with implications for understanding fractal lattice properties.
Contribution
The paper introduces exact recursion equations for rooted self-avoiding walks and polygons on deterministic fractals, enabling computation of quenched averages and analysis of their exponents.
Findings
Quenched and annealed averages share the same connectivity constant and radius of gyration exponent.
Exponents for quenched averages differ from annealed values, indicating distinct scaling behaviors.
Numerical estimates for the 3-simplex lattice provide precise values for the exponents lpha_q and mma_q.
Abstract
We study rooted self avoiding polygons and self avoiding walks on deterministic fractal lattices of finite ramification index. Different sites on such lattices are not equivalent, and the number of rooted open walks W_n(S), and rooted self-avoiding polygons P_n(S) of n steps depend on the root S. We use exact recursion equations on the fractal to determine the generating functions for P_n(S), and W_n(S) for an arbitrary point S on the lattice. These are used to compute the averages and over different positions of S. We find that the connectivity constant , and the radius of gyration exponent are the same for the annealed and quenched averages. However, , and , where the exponents and take values different from…
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.
