On the Importance Sampling of Self-Avoiding Walks

DOI10.1017/S0963548313000643zbMath1298.05020arXiv1106.1876MaRDI QIDQ3191198

Mireille Bousquet-Mélou

Publication date: 24 September 2014

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1106.1876

zbMATH Keywords

estimatorsequential importance sampling

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial probability (60C05) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41)

Related Items (5)

The sample size required in importance sampling ⋮ Counting Walks and Graph Homomorphisms via Markov Chains and Importance Sampling ⋮ Robust importance sampling with adaptive winsorization ⋮ An optimal algorithm to generate extendable self-avoiding walks in arbitrary dimension ⋮ Taming reluctant random walks in the positive quadrant

Cites Work

• Unnamed Item
• Weakly directed self-avoiding walks
• Generating functions for generating trees
• Linear recurrences with constant coefficients: The multivariate case
• A faster implementation of the pivot algorithm for self-avoiding walks
• Mathematics and Computer Science: Coping with Finiteness
• A Monte Carlo study of non-trapped self-avoiding walks
• Scaling of the atmosphere of self-avoiding walks
• Critical behaviour of self-avoiding walks: that cross a square
• Self-avoiding walks crossing a square
• Sequential Monte Carlo Methods for Statistical Analysis of Tables

This page was built for publication: On the Importance Sampling of Self-Avoiding Walks