Exact expectations for random graphs and assignments
组合数学
2007-05-23 v1
摘要
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.
引用
@article{arxiv.math/0411199,
title = {Exact expectations for random graphs and assignments},
author = {Henrik Eriksson and Kimmo Eriksson and Jonas Sjostrand},
journal= {arXiv preprint arXiv:math/0411199},
year = {2007}
}
备注
9 pages