{
  "id": "1405.1267",
  "version": "v1",
  "published": "2014-05-06T13:44:33.000Z",
  "updated": "2014-05-06T13:44:33.000Z",
  "title": "The asymptotic behaviour of the weights and the degrees in an N-interactions random graph model",
  "authors": [
    "István Fazekas",
    "Bettina Porvázsnyik"
  ],
  "comment": "15 pages",
  "categories": [
    "math.PR"
  ],
  "abstract": "A random graph evolution based on the interactions of N vertices is studied. During the evolution both the preferential attachment method and the uniform choice of vertices are allowed. The weight of a vertex means the number of its interactions. The asymptotic behaviour of the weight and the degree of a fixed vertex, moreover the limit of the maximal weight and the maximal degree are described. The proofs are based on martingale methods.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2014-05-06T13:44:33.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C80",
      "60G42"
    ],
    "keywords": [
      "n-interactions random graph model",
      "asymptotic behaviour",
      "random graph evolution",
      "preferential attachment method",
      "vertex means"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 15,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2014arXiv1405.1267F"
    }
  }
}