Self-avoiding random loops

DOI10.1109/18.21290zbMath0673.60076OpenAlexW2017790017MaRDI QIDQ3827351

Alon Orlitsky, Lester E. Dubins, Lawrence A. Shepp, James A. Reeds

Publication date: 1988

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/cc7c5d8445c717e842229186ba0fdde7fe538916

zbMATH Keywords

simulationrandom walkself-avoiding loops

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50)

Related Items (4)

Nonlocal Monte Carlo algorithm for self-avoiding walks with fixed endpoints. ⋮ COMPUTING SIGNED PERMUTATIONS OF POLYGONS ⋮ Join-and-Cut algorithm for self-avoiding walks with variable length and free endpoints ⋮ The Erdős--Nagy theorem and its ramifications

This page was built for publication: Self-avoiding random loops