A nonlocal Monte Carlo algorithm for lattice trees

DOI10.1088/0305-4470/25/2/013MaRDI QIDQ4008135zbMATH OpenOpenAlexFDO

Authors E. J. Janse van Rensburg, Neal Madras

Publication date 27 September 1992

Published in Journal of Physics A: Mathematical and General (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1088/0305-4470/25/2/013

zbMATH Keywords

non-local algorithm for the simulation of treesproperties of lattice trees

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Other physical applications of random processes (60K40) Monte Carlo methods (65C05) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41)

Recommendations

• Metropolis Monte Carlo simulation of lattice animals
• Nonlocal Monte Carlo algorithm for self-avoiding walks with fixed endpoints.
• Simulations of lattice animals and trees
• New Monte Carlo algorithms for interacting self-avoiding walks
• Note on the Metropolis Monte Carlo method on random lattices

Cited in

(12)

• The number and size of branched polymers in high dimensions
• Monte Carlo study of the -point for collapsing trees
• Mean-field lattice trees
• Binary tree summation Monte Carlo simulation for Potts models
• Adsorption of lattice polymers with quenched topologies
• Efficiency of the incomplete enumeration algorithm for Monte-Carlo simulation of linear and branched polymers
• Metropolis Monte Carlo simulation of lattice animals
• Polya tree Monte Carlo method
• Models of random subtrees of a graph
• What are the limits of universality?
• Witness trees in the Moser-Tardos algorithmic Lovász local lemma and Penrose trees in the hard-core lattice gas
• Pseudo-random trees in Monte Carlo

This page was built for publication: A nonlocal Monte Carlo algorithm for lattice trees

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