Self-avoiding random loops

DOI10.1109/18.21290MaRDI QIDQ3827351zbMATH OpenOpenAlexFDO

Authors Lester E. Dubins, Alon Orlitsky, James A. Reeds, Larry Shepp

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

random walksimulationself-avoiding loops

Mathematics Subject Classification ID

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

Recommendations

• Area distribution of the planar random loop boundary
• Knots in random walks
• The fullerene graphs with a perfect star packing
• scientific article; zbMATH DE number 1537469
• Random linking of lattice polygons

Cited in

(5)

• Nonlocal Monte Carlo algorithm for self-avoiding walks with fixed endpoints.
• Area distribution of the planar random loop boundary
• The Erdős--Nagy theorem and its ramifications
• Computing signed permutations of polygons
• Join-and-Cut algorithm for self-avoiding walks with variable length and free endpoints

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3827351)