{
  "id": "math/0411199",
  "version": "v1",
  "published": "2004-11-09T16:14:00.000Z",
  "updated": "2004-11-09T16:14:00.000Z",
  "title": "Exact expectations for random graphs and assignments",
  "authors": [
    "Henrik Eriksson",
    "Kimmo Eriksson",
    "Jonas Sjostrand"
  ],
  "comment": "9 pages",
  "journal": "Combinatorics, Probability and Computing 12, 2003, pages 401-412",
  "categories": [
    "math.CO"
  ],
  "abstract": "For a random graph on n vertices where the edges appear with individual rates, we give exact formulas for the expected time at which the number of components has gone down to k and the expected length of the corresponding minimal spanning forest. For a random bipartite graph we give a formula for the expected time at which a k-assignment appears. This result has bearing upon the random assignment problem.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2004-11-09T16:14:00.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C80",
      "05C40",
      "60K99"
    ],
    "keywords": [
      "random graph",
      "exact expectations",
      "expected time",
      "random bipartite graph",
      "random assignment problem"
    ],
    "tags": [
      "journal article"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 9,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2004math.....11199E"
    }
  }
}