An optimal algorithm to generate extendable self-avoiding walks in arbitrary dimension
type: Item
instance of: scholarly article
title: An optimal algorithm to generate extendable self-avoiding walks in arbitrary dimension
zbMATH Open document ID: 1427.05213
author: Pascal Préa
author: Mathieu Rouault
author: François Brucker
publication date: 2018-01-04T00:00:00Z
Mathematics Subject Classification ID: 05C81
Mathematics Subject Classification ID: 82B20
zbMATH DE Number: 6821883
zbMATH Keywords: self-avoiding walk
zbMATH Keywords: connective constant
zbMATH Keywords: critical exponent
zbMATH Keywords: random generation
MaRDI profile type: Publication
full work available at URL: j.endm.2017.05.004
OpenAlex ID: W2623577381
cites work: On the Importance Sampling of Self-Avoiding Walks
cites work: A linear time and space algorithm for detecting path intersection in \(\mathbb Z^d\)
cites work: A Monte Carlo study of non-trapped self-avoiding walks
cites work: The connective constant of the honeycomb lattice equals \(\sqrt{2+\sqrt 2}\)
cites work: Extendable self-avoiding walks
cites work: Self-avoiding polygons on the square lattice
cites work: A faster implementation of the pivot algorithm for self-avoiding walks
cites work: Q4693177
cites work: The Monte Carlo Method
cites work: Generalized atmospheric Rosenbluth methods (GARM)
DOI: 10.1016/J.ENDM.2017.05.004
description: scientific article; zbMATH DE number 6821883