{
  "id": "math/0406446",
  "version": "v1",
  "published": "2004-06-23T03:37:02.000Z",
  "updated": "2004-06-23T03:37:02.000Z",
  "title": "Survey: Information flow on trees",
  "authors": [
    "Elchanan Mossel"
  ],
  "categories": [
    "math.PR",
    "math.ST",
    "stat.TH"
  ],
  "abstract": "Consider a tree network T, where each edge acts as an independent copy of a given channel M, and information is propagated from the root. For which T and M does the configuration obtained at level n of T typically contain significant information on the root variable? This model appeared independently in biology, information theory, and statistical physics. Its analysis uses techniques from the theory of finite markov chains, statistics, statistical physics, information theory, cryptography and noisy computation. In this paper, we survey developments and challenges related to this problem.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2004-06-23T03:37:02.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "60J80",
      "60K35",
      "60F05"
    ],
    "keywords": [
      "information flow",
      "information theory",
      "finite markov chains",
      "typically contain significant information",
      "statistical physics"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2004math......6446M"
    }
  }
}