Exact expectations for random graphs and assignments

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
9 pages

Keywords

Combinatorics, 05C80; 05C40, 60K99

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/73161

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0411199
 http://arxiv.org/abs/math/0411199
 Combinatorics, Probability and Computing 12, 2003, pages 401-412

Collections

arXiv