Quenched averages for self-avoiding walks and polygons on deterministic fractals

DOI10.1007/S10955-006-9098-7MaRDI QIDQ863503zbMATH OpenOpenAlexFDO

Authors Sumedha, Deepak Dhar

Publication date 26 January 2007

Published in Journal of Statistical Physics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/cond-mat/0512051

zbMATH Keywords

fractals random media self-avoiding walks

Mathematics Subject Classification ID

Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41)

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

< P_{n} (S) >, < W_{n} (S) >, < l o g P_{n} (S) >

and

< l o g W_{n} (S) >

over different positions of S. We find that the connectivity constant

m u

, and the radius of gyration exponent

u

are the same for the annealed and quenched averages. However,

< l o g P_{n} (S) > n l o g m u + (a l p h a_{q} - 2) l o g n

, and

< l o g W_{n} (S) > n l o g m u + (g a m m a_{q} - 1) l o g n

, where the exponents

a l p h a_{q}

and

g a m m a_{q}

take values different from the annealed case. These are expressed as the Lyapunov exponents of random product of finite-dimensional matrices. For the 3-simplex lattice, our numerical estimation gives

a l p h a_{q} s i m e q 0.72837 p m 0.00001

; and

g a m m a_{q} s i m e q 1.37501 p m 0.00003

, to be compared with the annealed values

a l p h a_{a} = 0.73421

and

g a m m a_{a} = 1.37522

.

Review text

The authors study rooted self avoiding polygons and self avoiding walks on deterministic fractal lattices of finite ramification index. The number of rooted open walks \(W_n(S)\) and rooted self-avoiding polygons \(P_n(S)\) of \(n\) steps, passing through particular site \(S\), are considered. Exact recursion equations, i.~e., the renormalization equations, are used to determine generating functions \(P_n(S)\) and \(W_n(S)\). These are used to compute the averages \(\langle P_n(S) \rangle\), \(\langle W_n(S) \rangle\), \(\langle \log P_n(S) \rangle\), and \(\langle \log W_n(S) \rangle\) over different positions of \(S\). Besides, annealed and quenched averages are calculated. The considered fractal is nearly homogeneous, and the difference between these averages is not large. It is shown that the value of the growth constant \(\mu\) and the size exponent \(\nu\) are the same for the quenched and annealed cases, but the critical exponents \(\gamma\) and \(\alpha\) do differ in the two cases. In particular, the hyperscaling relation \(d \nu = 2 - \alpha\) is valid only for the annealed average. Rigorous bounds on the quenched exponents are obtained, and their values are estimated numerically to a very good precision.

Recommendations

Cites work

Cited in

(4)

Describes a project that uses

Uses Software

Mathematica

This page was built for publication: Quenched averages for self-avoiding walks and polygons on deterministic fractals

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q863503)