Exact expectations for random graphs and assignments

Details Exact expectations for random graphs and assignments Exact expectations for random graphs and assignments

2004-11-09

arxiv.org/abs/math/0411199v1

Combinatorics, Probability and Computing 12, 2003, pages 401-412

Mathematics

Combinatorics

9 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Exact expectations for random graphs and assignments does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Exact expectations for random graphs and assignments, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Exact expectations for random graphs and assignments will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-367672