{
  "aliases": null,
  "backlinks": [
    {
      "field": "defines",
      "target": "7F5MZS55Y1"
    },
    {
      "field": "uses",
      "target": "MK827B9NDR"
    }
  ],
  "body": "\n## Summary\n\nA graph has the Liouville property if every bounded [[discrete harmonic function|WRY0M7SW59]] on it is constant.\nThe name comes from Liouville's theorem, whose harmonic form says that bounded harmonic functions on $\\R^n$ are constant.\nThe lattices $\\Z^d$ have the property, while regular trees of degree at least $3$ do not.\nFor Cayley graphs of groups it says that the [[Poisson boundary|6EEF2E8XPF]] of the simple random walk is trivial.\n\n## Explanations\n\n### L1 human\n\nA harmonic function on a graph gives each vertex the average of the values at its neighbours.\nOn a graph with the Liouville property, the only way to do this with values that stay bounded is to use the same value everywhere.\nOn the integers, the harmonic functions are the lines $an + b$, and only the constant ones are bounded.\nOn a tree that branches into two or more new directions at every vertex, a random walk drifts off along one branch.\nThe probability of ending up in a fixed branch is then a bounded harmonic function that is not constant.\n",
  "commit": "ff8a40749dc16545e3d2fc637f6b0196e81d0bfa",
  "front": {
    "kind": "concept",
    "msc": [
      "31C20",
      "05C81"
    ],
    "name": "Liouville property of graphs",
    "sources": [
      {
        "url": "https://en.wikipedia.org/wiki/Harmonic_function"
      }
    ],
    "tag": "Y1EGR8DF84"
  },
  "kind": "concept",
  "link": "https://tamnd.github.io/math2/node/Y1EGR8DF84/",
  "links": null,
  "markdown": "https://tamnd.github.io/math2/node/Y1EGR8DF84.md",
  "msc": [
    "31C20",
    "05C81"
  ],
  "name": "Liouville property of graphs",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/Y1E/Y1EGR8DF84.md",
  "status": null,
  "tag": "Y1EGR8DF84",
  "uri": "m2://Y1EGR8DF84",
  "url": "https://tamnd.github.io/math2/wiki/liouville-property-of-graphs/",
  "writing": {
    "tag": "Y1EGR8DF84",
    "kind": "concept",
    "level": "W0",
    "next": [
      {
        "what": "an inventory row",
        "note": "the row of the inventory that the node accounts for",
        "have": 0,
        "want": 1
      },
      {
        "what": "a source with a locator",
        "have": 0,
        "want": 1
      }
    ]
  }
}