Scaling of Hamiltonian walks on fractal lattices

Physics – Condensed Matter – Statistical Mechanics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

19 pages, 13 figures, RevTex4; extended Introduction, several references added; one figure added in section II; corrected typo

Scientific paper

10.1103/PhysRevE.76.011107

We investigate asymptotical behavior of numbers of long Hamiltonian walks (HWs), i.e. self-avoiding random walks that visit every site of a lattice, on various fractal lattices. By applying an exact recursive technique we obtain scaling forms for open HWs on 3-simplex lattice, Sierpinski gasket, and their generalizations: Given-Mandelbrot (GM), modified Sierpinski gasket (MSG) and n-simplex fractal families. For GM, MSG and n-simplex lattices with odd values of n, number of open HWs $Z_N$, for the lattice with $N\gg 1$ sites, varies as $\omega^N N^\gamma$. We explicitly calculate exponent $\gamma$ for several members of GM and MSG families, as well as for n-simplices with n=3,5, and 7. For n-simplex fractals with even n we find different scaling form: $Z_N\sim \omega^N \mu^{N^{1/d_f}}$, where $d_f$ is fractal dimension of the lattice, which also differs from the formula expected for homogeneous lattices. We discuss possible implications of our results on studies of real compact polymers.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Scaling of Hamiltonian walks on fractal lattices does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Scaling of Hamiltonian walks on fractal lattices, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Scaling of Hamiltonian walks on fractal lattices will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-314815

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.