Metraipolis › archive › dc_fdca56880073
Fractal dimensions of paths on three-dimensional random-walk traces — arXiv:2610.39612
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.39612
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-01T02:35:41.356Z
- SHA-256 of the archived text
b9bef05b1b95abd228f23f3c6b7262484c19fd9c83280a6a125904ef43ef9806- Stable URL of this page
https://metraipolis.com/documento/dc_fdca56880073
How to cite
Fractal dimensions of paths on three-dimensional random-walk traces — arXiv:2610.39612 — arXiv (en), https://arxiv.org/abs/2610.39612 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_fdca56880073 (Metraipolis archive dc_fdca56880073, sha256 b9bef05b1b95abd228f23f3c6b7262484c19fd9c83280a6a125904ef43ef9806)
BibTeX
@misc{dcfdca56880073,
title = {Fractal dimensions of paths on three-dimensional random-walk traces — arXiv:2610.39612},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.39612},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_fdca56880073; sha256 b9bef05b1b95abd228f23f3c6b7262484c19fd9c83280a6a125904ef43ef9806},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.39612. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We study four paths that join the starting site to the final position of a simple random walk of \(N=L^2\) steps on the infinite cubic lattice. The paths are selected on the walk trace---the graph of visited sites and traversed bonds---by different rules: the undirected shortest path \(S_1\), the directed shortest path \(S_2\), the time-respecting shortest path \(S_3\), and the depth \(D_e\) of the final site in a depth-first-search tree. Monte Carlo simulations for \(L\) up to 32768 give mean lengths scaling as \(L^{d_O}\), with \(d_{S_1}=1.48005(9)\), \(d_{S_2}=1.49868(5)\), \(d_{S_3}=1.51205(5)\), and \(d_{D_e}=1.7099(7)\), so that \(d_{S_1}<d_{S_2}<d_{S_3}<d_{\rm LE}<d_{D_e}\), where $d_{\rm LE}=1.62400(5)$ is the known loop-erased-random-walk exponent. Imposing traversal directions increases the shortest-path exponent, and imposing time order increases it further; these constraints therefore change the scaling exponent, not only the amplitude. For every path, the standard deviation scales with the same exponent as the mean, so it is scale-invariant, unlike the visited-site mass; the rescaled length distributions collapse onto a finite-width scaling function. No analytical theory currently predicts these exponents; our results provide precise numerical benchmarks for future studies of path geometry on random-walk traces.
Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.PR, nuovi lavori del giorno).
Categorie arXiv: Statistical Mechanics (cond-mat.stat-mech) ; Probability (math.PR).
Pagina del lavoro: https://arxiv.org/abs/2610.39612 — 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-11-01T02:14:58.670Z dalla pagina https://arxiv.org/list/math.PR/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).