Self-testing algorithms for self-avoiding walks

DOI10.1063/1.533197MaRDI QIDQ2737885zbMATH OpenOpenAlexFDO

Authors Dana Randall, Alistair Sinclair

Publication date 30 August 2001

Published in Journal of Mathematical Physics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1063/1.533197

zbMATH Keywords

Markov chain Monte Carlo algorithm

Mathematics Subject Classification ID

Markov processes (60J99) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41)

Recommendations

• scientific article; zbMATH DE number 1003292
• Simulating self-avoiding walks in bounded domains
• An optimal algorithm to generate extendable self-avoiding walks in arbitrary dimension
• Efficient implementation of the Pivot algorithm for self-avoiding walks
• A faster implementation of the pivot algorithm for self-avoiding walks
• Monte Carlo methods for the self-avoiding walk
• New Monte Carlo algorithms for interacting self-avoiding walks
• A series test of the scaling limit of self-avoiding walks
• scientific article; zbMATH DE number 5831714

Cites work

• Approximate counting, uniform generation and rapidly mixing Markov chains
• Approximating the Permanent
• Exponential convergence to equilibrium for a class of random-walk models
• FURTHER RESULTS ON THE RATE OF CONVERGENCE TO THE CONNECTIVE CONSTANT OF THE HYPERCUBICAL LATTICE
• Geometric bounds for eigenvalues of Markov chains
• Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow
• Lower bound on the connective constant for square lattice self-avoiding walks
• Monotonicity of the number of self-avoiding walks
• Monte-Carlo approximation algorithms for enumeration problems
• New lower bounds on the self-avoiding-walk connective constant
• Random generation of combinatorial structures from a uniform distribution
• Self-avoiding polygons on the square lattice
• Self-avoiding walk in five or more dimensions. I: The critical behaviour
• THE LACE EXPANSION FOR SELF-AVOIDING WALK IN FIVE OR MORE DIMENSIONS
• Upper Bounds for the Connective Constant of Self-Avoiding Walks

Cited in

(12)

• Nonlocal Monte Carlo algorithm for self-avoiding walks with fixed endpoints.
• On sampling simple paths in planar graphs according to their lengths
• Growing self avoiding walk trees
• Monte Carlo methods for the self-avoiding walk
• The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes.
• On the importance sampling of self-avoiding walks
• Persistence length convergence and universality for the self-avoiding random walk
• Invasion percolation on Galton-Watson trees
• Computing and counting longest paths on circular-arc graphs in polynomial time
• Exact sampling of self-avoiding paths via discrete Schramm-Loewner evolution
• Asymptotically faster algorithm for counting self-avoiding walks and self-avoiding polygons
• An optimal algorithm to generate extendable self-avoiding walks in arbitrary dimension

This page was built for publication: Self-testing algorithms for self-avoiding walks

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