Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 78 tok/s
Gemini 2.5 Pro 52 tok/s Pro
GPT-5 Medium 24 tok/s Pro
GPT-5 High 26 tok/s Pro
GPT-4o 120 tok/s Pro
Kimi K2 193 tok/s Pro
GPT OSS 120B 459 tok/s Pro
Claude Sonnet 4.5 36 tok/s Pro
2000 character limit reached

Winding angles of long lattice walks (1606.02907v2)

Published 9 Jun 2016 in cond-mat.stat-mech and cond-mat.soft

Abstract: We study the winding angles of random and self-avoiding walks on square and cubic lattices with number of steps $N$ ranging up to $107$. We show that the mean square winding angle $\langle\theta2\rangle$ of random walks converges to the theoretical form when $N\rightarrow\infty$. For self-avoiding walks on the square lattice, we show that the ratio $\langle\theta4\rangle/\langle\theta2\rangle2$ converges slowly to the Gaussian value 3. For self avoiding walks on the cubic lattice we find that the ratio $\langle\theta4\rangle/\langle\theta2\rangle2$ exhibits non-monotonic dependence on $N$ and reaches a maximum of 3.73(1) for $N\approx104$. We show that to a good approximation, the square winding angle of a self-avoiding walk on the cubic lattice can be obtained from the summation of the square change in the winding angles of $\ln N$ independent segments of the walk, where the $i$-th segment contains $2i$ steps. We find that the square winding angle of the $i$-th segment increases approximately as $i{0.5}$, which leads to an increase of the total square winding angle proportional to $(\ln N){1.5}$.

Summary

We haven't generated a summary for this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.