{
  "id": "0910.5460",
  "version": "v1",
  "published": "2009-10-28T18:49:42.000Z",
  "updated": "2009-10-28T18:49:42.000Z",
  "title": "Gibbs Measures and Phase Transitions on Sparse Random Graphs",
  "authors": [
    "Amir Dembo",
    "Andrea Montanari"
  ],
  "comment": "111 pages, 3 eps figures, Lecture notes for the 2008 Brazilian School of Probability (to appear in BJPS without Sections 1.3 and 6)",
  "categories": [
    "math.PR",
    "cond-mat.stat-mech",
    "math-ph",
    "math.MP"
  ],
  "abstract": "Many problems of interest in computer science and information theory can be phrased in terms of a probability distribution over discrete variables associated to the vertices of a large (but finite) sparse graph. In recent years, considerable progress has been achieved by viewing these distributions as Gibbs measures and applying to their study heuristic tools from statistical physics. We review this approach and provide some results towards a rigorous treatment of these problems.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2009-10-28T18:49:42.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "sparse random graphs",
      "gibbs measures",
      "phase transitions",
      "study heuristic tools",
      "probability distribution"
    ],
    "tags": [
      "lecture notes"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 111,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2009arXiv0910.5460D"
    }
  }
}