{
  "id": "1510.00575",
  "version": "v1",
  "published": "2015-10-02T12:17:47.000Z",
  "updated": "2015-10-02T12:17:47.000Z",
  "title": "Construction of Directed Assortative Configuration Graphs",
  "authors": [
    "Philippe Deprez",
    "Mario V. Wüthrich"
  ],
  "categories": [
    "math.PR"
  ],
  "abstract": "Constructions of directed configuration graphs with given bi-degree distribution were introduced in random graph theory some years ago. These constructions lead to graphs where the degrees of two nodes belonging to the same edge are independent. However, it is observed that many real-life networks are assortative, meaning that edges tend to connect low degree nodes with high degree nodes, or variations thereof. In this article we provide an explicit algorithm to construct directed assortative configuration graphs with given bi-degree distribution and arbitrary pre-specified assortativity.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2015-10-02T12:17:47.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "construction",
      "connect low degree nodes",
      "bi-degree distribution",
      "construct directed assortative configuration graphs",
      "random graph theory"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2015arXiv151000575D"
    }
  }
}