An optimal algorithm to generate extendable self-avoiding walks in arbitrary dimension (Q1687779)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An optimal algorithm to generate extendable self-avoiding walks in arbitrary dimension |
scientific article; zbMATH DE number 6821883
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An optimal algorithm to generate extendable self-avoiding walks in arbitrary dimension |
scientific article; zbMATH DE number 6821883 |
Statements
An optimal algorithm to generate extendable self-avoiding walks in arbitrary dimension (English)
0 references
4 January 2018
0 references
self-avoiding walk
0 references
connective constant
0 references
critical exponent
0 references
random generation
0 references
0.7891584634780884
0 references
0.7799187302589417
0 references
0.7753551602363586
0 references
0.7748063802719116
0 references
