{
  "id": "1408.3610",
  "version": "v1",
  "published": "2014-08-15T18:52:04.000Z",
  "updated": "2014-08-15T18:52:04.000Z",
  "title": "PageRank in scale-free random graphs",
  "authors": [
    "Ningyuan Chen",
    "Nelly Litvak",
    "Mariana Olvera-Cravioto"
  ],
  "categories": [
    "math.PR"
  ],
  "abstract": "We analyze the distribution of PageRank on a directed configuration model and show that as the size of the graph grows to infinity it can be closely approximated by the PageRank of the root node of an appropriately constructed tree. This tree approximation is in turn related to the solution of a linear stochastic fixed point equation that has been thoroughly studied in the recent literature.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2014-08-15T18:52:04.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "scale-free random graphs",
      "linear stochastic fixed point equation",
      "graph grows",
      "root node",
      "directed configuration model"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2014arXiv1408.3610C"
    }
  }
}