{
  "aliases": null,
  "backlinks": [
    {
      "field": "defines",
      "target": "RDFA0SYHEQ"
    }
  ],
  "body": "\n## Summary\n\nA self-avoiding walk is a path on a lattice that never visits the same point twice.\nCounting such walks and describing a typical long one are hard problems, much harder than for [[random walks|04VZE3FZXF]].\nThe growth rate of their number is the connective constant of the lattice.\nSelf-avoiding walks are a model of long polymer molecules, which cannot occupy the same place twice.\n\n## Explanations\n\n### L1 human\n\nDraw a path on squared paper along the grid lines, one unit step at a time, and never come back to a corner you have visited.\nThat path is a self-avoiding walk.\nOn the square grid there are $4$ walks of one step, $12$ of two steps and $36$ of three steps.\nThe number grows roughly like $\\mu^n$ for some number $\\mu$ between $2$ and $3$.\n",
  "commit": "547b6eddb8f2feb8d579f2d633d22a27b7e132fc",
  "front": {
    "kind": "concept",
    "msc": [
      "82B41",
      "60K35",
      "05A16"
    ],
    "name": "Self-avoiding walk",
    "same_as": {
      "wikidata": "Q7448025",
      "wikipedia": "Self-avoiding walk"
    },
    "sources": [
      {
        "url": "https://en.wikipedia.org/wiki/Self-avoiding_walk"
      }
    ],
    "tag": "E2BVEB570S"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/E2BVEB570S/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/E2BVEB570S.md",
  "msc": [
    "82B41",
    "60K35",
    "05A16"
  ],
  "name": "Self-avoiding walk",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/E2B/E2BVEB570S.md",
  "status": null,
  "tag": "E2BVEB570S",
  "uri": "m2://E2BVEB570S",
  "url": "https://math2.tamnd.com/wiki/self-avoiding-walk/",
  "writing": {
    "tag": "E2BVEB570S",
    "kind": "concept",
    "level": "W0",
    "next": [
      {
        "what": "a source with a locator",
        "have": 0,
        "want": 1
      }
    ]
  }
}