{
  "id": "1311.1091",
  "version": "v2",
  "published": "2013-11-05T15:40:04.000Z",
  "updated": "2014-02-15T12:00:52.000Z",
  "title": "The power of 2 choices over preferential attachment",
  "authors": [
    "Yury Malyshkin",
    "Elliot Paquette"
  ],
  "categories": [
    "math.PR",
    "math.CO"
  ],
  "abstract": "We introduce a new type of preferential attachment tree that includes choices in its evolution, like with Achlioptas processes. At each step in the growth of the graph, a new vertex is introduced. Two possible neighbor vertices are selected independently and with probability proportional to degree. Between the two, the vertex with smaller degree is chosen, and a new edge is created. We determine with high probability the largest degree of this graph up to some additive error term.",
  "revisions": [
    {
      "version": "v2",
      "updated": "2014-02-15T12:00:52.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C80"
    ],
    "keywords": [
      "preferential attachment tree",
      "probability proportional",
      "achlioptas processes",
      "smaller degree",
      "high probability"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2013arXiv1311.1091M"
    }
  }
}