Metraipolis › archive › dc_5ec8d82f0bb3
Self-avoiding trails in two and three dimensions — arXiv:2609.21724
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.21724
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-10T02:55:05.340Z
- SHA-256 of the archived text
c3fbfa9529fa943b06e38baa40eacfadb5553a9e2479a4baa840e0f4b656d355- Stable URL of this page
https://metraipolis.com/documento/dc_5ec8d82f0bb3
How to cite
Self-avoiding trails in two and three dimensions — arXiv:2609.21724 — arXiv (en), https://arxiv.org/abs/2609.21724 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_5ec8d82f0bb3 (Metraipolis archive dc_5ec8d82f0bb3, sha256 c3fbfa9529fa943b06e38baa40eacfadb5553a9e2479a4baa840e0f4b656d355)
BibTeX
@misc{dc5ec8d82f0bb3,
title = {Self-avoiding trails in two and three dimensions — arXiv:2609.21724},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.21724},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_5ec8d82f0bb3; sha256 c3fbfa9529fa943b06e38baa40eacfadb5553a9e2479a4baa840e0f4b656d355},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.21724. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
The self-avoiding trail is an important variant of the self-avoiding walk. In this work, we employ an irreversible Markov chain Monte Carlo algorithm, together with the reversible Berretti-Sokal algorithm for comparison, to simulate self-avoiding trails on the square and simple cubic lattices with periodic boundary conditions. Based on finite-size analyses of the unwrapped end-to-end distance and the Binder ratio, we accurately estimate the critical points on the simple cubic and square lattices to be 0.206\,376\,9(2) and 0.367\,561\,1(1), respectively, improving the precision of previous best estimates by factors of 500 and 70. At the estimated critical point of the simple cubic lattice, we numerically demonstrate that both the critical scaling behaviors of various quantities and the length distributions of self-avoiding trails and walks are consistent with each other. Our accurate numerical results are attributed to the efficiency of the irreversible algorithm, whose advantage over the reversible algorithm is even more pronounced for the self-avoiding trail model than for the self-avoiding walk model. Tema degli esploratori: fisica e astronomia (retro-catalogo arXiv: annunci del 2026-09-21 in cond-mat.stat-mech). Categorie arXiv: Statistical Mechanics (cond-mat.stat-mech). Pagina del lavoro: https://arxiv.org/abs/2609.21724 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-10T02:36:49.165Z dalla pagina https://arxiv.org/catchup/cond-mat.stat-mech/2026-09-21?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).